Submission #1758504


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":"\n"); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
    is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

template<class T>
struct SegmentTree {
    int size;
    vector<T> data;
    function<T(T,T)> merger;
    T ident;
    SegmentTree(int n, function<T(T, T)> merge_func, T identity_element) : merger(merge_func), ident(identity_element) {
        size = 1;
        while (size < n) size <<= 1;
        data.resize(size * 2, ident);
    }
    void update(int i, T x) {
        i += size - 1;
        data[i] = x;
        while (i > 0) {
            i = (i - 1) / 2;
            data[i] = merger(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }
    T query(int wishL, int wishR, int watchL = 0, int watchR = -1, int k = 0) {
        if(watchR == -1) watchR = size;
        if(watchR <= wishL || wishR <= watchL) return ident;
        if(wishL <= watchL && watchR <= wishR) return data[k];
        T ld = query(wishL, wishR, watchL, (watchL + watchR) / 2, k * 2 + 1);
        T rd = query(wishL, wishR, (watchL + watchR) / 2, watchR, k * 2 + 2);
        return merger(ld, rd);
    }
    T at(int i) {
        i+=size-1;
        return data[i];
    }
};
signed main() {
    int n;
    cin>>n;
    
    vector<vector<int>> g(n);
    REP(i,n-1) {
        int x,y;
        cin>>x>>y;
        x--,y--;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    vector<int> id(n);
    vector<int> vs(n*2);
    vector<int> depth(n*2);
    SegmentTree<pii> rmq(n*2,[](pii a,pii b){return min(a,b);},{INF,-1});

    int k=0;
    function<void(int,int,int)> dfs=[&](int v,int p,int d) {
        id[v]=k;
        vs[k]=v;
        depth[k]=d;
        rmq.update(k,{d,k});
        k++;
        REP(i,SZ(g[v])) {
            if(g[v][i]!=p) {
                dfs(g[v][i],v,d+1);
                vs[k]=v;
                depth[k]=d;
                rmq.update(k,{d,k});
                k++;
            }
        }
    };

    dfs(0,-1,0);

    auto lca=[&](int u,int v) {
        return vs[rmq.query(min(id[u],id[v]),max(id[u],id[v])+1).second];
    };

    int Q;
    cin>>Q;
    while(Q--) {
        int a,b;
        cin>>a>>b;
        a--,b--;
        int l=lca(a,b);
        int dist=(depth[id[a]]-depth[id[l]])+(depth[id[b]]-depth[id[l]]);
        cout<<dist+1<<endl;
    }
    return 0;
}

Submission Info

Submission Time
Task D - 閉路
User algon
Language C++14 (GCC 5.4.1)
Score 100
Code Size 3881 Byte
Status AC
Exec Time 195 ms
Memory 37248 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 12
AC × 27
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 1 ms 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt AC 1 ms 256 KB
subtask1_01.txt AC 66 ms 36608 KB
subtask1_02.txt AC 67 ms 36608 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 2 ms 384 KB
subtask1_06.txt AC 2 ms 512 KB
subtask1_07.txt AC 82 ms 18432 KB
subtask1_08.txt AC 82 ms 18304 KB
subtask1_09.txt AC 81 ms 18432 KB
subtask1_10.txt AC 86 ms 18432 KB
subtask1_11.txt AC 76 ms 18432 KB
subtask1_12.txt AC 83 ms 18432 KB
subtask2_01.txt AC 103 ms 37248 KB
subtask2_02.txt AC 125 ms 37120 KB
subtask2_03.txt AC 30 ms 512 KB
subtask2_04.txt AC 46 ms 512 KB
subtask2_05.txt AC 59 ms 768 KB
subtask2_06.txt AC 59 ms 896 KB
subtask2_07.txt AC 187 ms 18688 KB
subtask2_08.txt AC 195 ms 18688 KB
subtask2_09.txt AC 187 ms 18688 KB
subtask2_10.txt AC 187 ms 18816 KB
subtask2_11.txt AC 175 ms 18816 KB
subtask2_12.txt AC 179 ms 18816 KB