Submission #230422

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair

#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)

#define lengthof(x) (sizeof(x) / sizeof(*(x)))

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

int V, E;

map<int, vector<int> > cost;

bool isFind(int s, int t){
    for(int i=0; i < cost[s].size(); i++){
        if(cost[s][i] == t) return true;
    }
    return false;
}

int dijkstra(int s, int t) {
    int d[100000];
    bool used[100000];
    fill(d, d + V, inf);
    fill(used, used + V, false);
    d[s] = 0;

    while(true) {
        int v = -1;
        for (int u = 0; u < V; u++) {
            if (!used[u] && (v == -1 || d[u] < d[v])) v = u;
        }
        if (v == -1) break;
        used[v] = true;

        for (int u = 0; u < V; u++) {
            int c = d[v];
            if(isFind(v, u)) c+= 1;
            else c += inf;
            d[u] = min(d[u], c);
        }
    }
    return d[t];
}
int main(){
    cin >> V;
    E = V-1;
    for(int i=0; i < E; i++){
        int s, t;
        cin >> s >> t; s--; t--;
        cost[s].push_back(t);
        cost[t].push_back(s);
    }
    int n;
    cin >> n;
    for(int i=0; i < n; i++){
        int s, t;
        cin >> s >> t;
        s--; t--;
        cout << dijkstra(s, t)+1 << endl;
    }
}

Submission Info

Judge Result