oj.uz

답안 #947831

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947831 2024-03-17T05:35:23 Z willychan Inside information (BOI21_servers) C++17
0 / 100
 23 ms 15828 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds


struct qT {
    int type;
    int a;
    int d;
    int t;
    qT(int _type,int _a,int _d,int _t):type(_type),a(_a),d(_d),t(_t) {}
};
const int N = 120005;
vector<pair<int,int> > side[N];
static const int B = 5;
int P[N][B];
int iv[N][B];
int dv[N][B];
int mx[N][B];
pair<int,int> dfn[N];

struct Qstruct {
    int n;
    int T;
    void dfs(int cur,int p,int v) {
        dfn[cur].first=++T;
        P[cur][0]=p;
        iv[cur][0]=v;
        dv[cur][0]=v;
        mx[cur][0]=v;
        for(auto e : side[cur]) {
            if(e.first!=p) dfs(e.first,cur,e.second);
        }
        dfn[cur].second=++T;
    }
    void init(int _n) {
        n = _n;
        T = 0;
        dfs(1,1,1e9);
        for(int i=0; i<B; i++) {
            P[1][i]=1;
            iv[1][i]=-1;
            dv[1][i]=-1;
            mx[1][i]=-1;
        }
        for(int j=1; j<B; j++) {
            for(int i=2; i<=n; i++) {
                P[i][j]=P[P[i][j-1]][j-1];
                iv[i][j] = (iv[i][j-1]<iv[P[i][j-1]][0])?(iv[P[i][j-1]][j-1]):(-1);
                dv[i][j] = (dv[i][j-1]>dv[P[i][j-1]][0])?(dv[P[i][j-1]][j-1]):(-1);
                mx[i][j] = max(mx[i][j-1],mx[P[i][j-1]][j-1]);
            }
        }
    }
    bool isanc(int a,int b) {
		return a<=b;
        return (dfn[a].first<=dfn[b].first)&(dfn[a].second>=dfn[b].second);
    }
    int lca(int a,int b) {
        if(isanc(a,b)) return a;
        if(isanc(b,a)) return b;
        for(int j=B-1; j>=0; j--) {
            if(!isanc(P[a][j],b)) a = P[a][j];
        }
        return P[a][0];
    }
    pair<int,int> dec(int a,int b) {
        assert(isanc(a,b));
        int v = 1e9;
        int maxn = -1e9;
        for(int j=B-1; j>=0; j--) {
            if(!isanc(P[b][j],a)) {
                if(dv[b][0]>v) return {-1,-1};
                if(dv[b][j]==-1) return {-1,-1};
                v = dv[b][j];
                maxn = max(maxn,mx[b][j]);
                b = P[b][j];
            }
        }
        maxn = max(maxn,mx[b][0]);
        if(dv[b][0]>v) return {-1,-1};
        return {dv[b][0],maxn};
    }
    pair<int,int> inc(int a,int b) {
        assert(isanc(a,b));
        int v = -1e9;
        int maxn = -1e9;
        for(int j=B-1; j>=0; j--) {
            if(!isanc(P[b][j],a)) {
                if(iv[b][0]<v) return {-1,-1};
                if(iv[b][j]==-1) return {-1,-1};
                v = iv[b][j];
                maxn = max(maxn,mx[b][j]);
                b = P[b][j];
            }
        }
        maxn = max(maxn,mx[b][0]);
        if(iv[b][0]<v)	 return {-1,-1};
        return {iv[b][0],maxn};
    }
    bool query(int a,int d,int t) {
        if(a==d) return 1;
        if(isanc(d,a)) {
            pair<int,int> k = dec(d,a);
            if(k.first==-1) return 0;
            if(k.second>t) return 0;
            return 1;
        }
        if(isanc(a,d)) {
            pair<int,int> k = inc(a,d);
            if(k.first==-1) return 0;
            if(k.second>t) return 0;
            return 1;
        }
        int c = lca(a,d);
        pair<int,int> k1 = inc(c,d);
        pair<int,int> k2 = dec(c,a);
        if(k1.first==-1 || k2.first==-1) return 0;
        if(max(k1.second,k2.second)>t) return 0;
        return (k1.first>k2.first);
    }
};



int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n,k;
    cin>>n>>k;
    vector<qT> query;
    for(int i=1; i<=n+k-1; i++) {
        char t;
        cin>>t;
        if(t=='S') {
            int a,b;
            cin>>a>>b;
            side[a].push_back({b,i});
            side[b].push_back({a,i});
        }
        if(t=='Q') {
            int a,d;
            cin>>a>>d;
            query.emplace_back(0,a,d,i);
        }
        if(t=='C') {
            int d;
            cin>>d;
            query.emplace_back(1,0,d,i);
        }
    }
    Qstruct Qans;
    Qans.init(n);
    for(auto cur : query)	{
        if(cur.type==0) {
            if(Qans.query(cur.a,cur.d,cur.t)){
				cout<<"yes\n";
			}else{
				cout<<"no\n";
			}
        } else {
            cout<<0<<"\n";
        }
    }
    return 0;
}

Subtask #1
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 15824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 15824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 15828 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 15828 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 15716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 15716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 15620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 15620 KB Output isn't correct
2 Halted 0 ms 0 KB -