oj.uz

Submission #72977

# Submission time Handle Problem Language Result Execution time Memory
72977 2018-08-27T11:46:28 Z yusufake Min-max tree (BOI18_minmaxtree) C++
100 / 100
 782 ms 24568 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define pp pair<int,int>
 
const int N = 7e4 + 4;
const int mod = 1e9 + 7;
vector < pp > V[N],A[N],B[N];
vector<pp> M[N];
int H[N],W[N];
int ans[N],U[N],sz[N],T[N],Mn[N],Mx[N],C;
 
void f(int x, int p, int n){
    int h=1; sz[x] = 1;
    for(auto y : V[x]){
        if(U[y.st] || y.st == p) continue;
        f(y.st,x,n);
        sz[x] += sz[y.st];
        if(sz[y.st] > n/2) h=0;
    }
    if(h && n-sz[x] <= n/2) C=x;
}
void g(int x, int p, int roo){
    T[x] = roo;
    for(auto y : V[x]){
        if(U[y.st] || y.st == p) continue;
        g(y.st,x,roo);
    }
}
pp h(int x, int p, int i){
    sz[x] = 1;
    int mn = 0;
    for(auto t : A[x]) if(T[t.st] && T[t.st] != T[x]) mn = max(mn , t.nd);
    int mx = mod;
    for(auto t : B[x]) if(T[t.st] && T[t.st] != T[x]) mx = min(mx , t.nd);
    pp a;
    for(auto y : V[x]){
        if(U[y.st] || y.st == p) continue;
        a = h(y.st,x,y.nd);
        mn = max(mn , a.st);
        mx = min(mx , a.nd);
        sz[x] += sz[y.st];
    }
    Mn[i] = max(Mn[i] , mn);
    Mx[i] = min(Mx[i] , mx);
    return mp(mn,mx);
}
void slv(int x, int n){
    f(x,-1,n);
    x = C;
    U[x] = 1;
    T[x] = -1;
    for(auto y : V[x]){
        if(U[y.st]) continue;
        g(y.st,x,y.st);
    }
    h(x,-1,0);
    g(x,-1,0);
    for(auto y : V[x]) if(!U[y.st]) slv(y.st,sz[y.st]);
}
void ff(int x){
    H[x] = 1;
    for(auto y : M[x]){
        if(H[y.st]) continue;
        ans[y.nd] = y.st;
        ff(y.st);
    }
}
void gg(int x, int p){
    H[x] = 1;
    for(auto y : M[x]){
        if(y.nd == p) continue;
        if(!H[y.st]) { ans[y.nd] = x; gg(y.st,y.nd); }
        else if(!ans[y.nd]) ans[y.nd] = x;
    }
}
 
int n,k,i,x,y,z,uu[N],vv[N],K[N];
char c;
int main(){
    scanf("%d",&n);
    for(i=1;i<n;i++){
        scanf("%d%d",&x,&y);
        V[x].pb(mp(y,i));
        V[y].pb(mp(x,i));
        Mx[i] = mod;
        uu[i] = x; vv[i] = y;
    }
    scanf("%d",&k);
    for(i=1;i<=k;i++){
        scanf(" %c%d%d%d",&c,&x,&y,&z);
        K[i] = z;
        if(c == 'm') { A[x].pb(mp(y,z)); A[y].pb(mp(x,z)); }
        else { B[x].pb(mp(y,z)); B[y].pb(mp(x,z)); }
    }
    slv(1,n);
 
    K[++k] = 0;
    K[++k] = mod;
    sort(K+1 , K+k+1);
    for(i=1;i<n;i++)
        if(Mn[i] != 0 || Mx[i] != mod){
            x = lower_bound(K+1 , K+k+1 , Mn[i]) - K;
            y = lower_bound(K+1 , K+k+1 , Mx[i]) - K;
            M[x].pb(mp(y,i));
            M[y].pb(mp(x,i));
            W[x]++; W[y]++;
        }
 
    ff(1); ff(k);
    for(i=1;i<=k;i++){
        x = i;
        if(H[x]) continue;
        for(; W[x] == 1 ; x = z) {
            W[x]--;
            H[x] = 1;
            z = 0;
            for(auto y : M[x]){
                W[y.st]--;
                if(W[y.st] > 0){
                    ans[y.nd] = x;
                    z = y.st;
                }
            }
        }
    }
    for(i=1;i<=k;i++)
        if(!H[i])
            gg(i,0);
 
    for(i=1;i<n;i++)
        printf("%d %d %d\n", uu[i], vv[i], ans[i] ? K[ ans[i] ] : Mx[i]);
    return 0;
}

Compilation message

minmaxtree.cpp: In function 'int main()':
minmaxtree.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
minmaxtree.cpp:87:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~
minmaxtree.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&k);
     ~~~~~^~~~~~~~~
minmaxtree.cpp:95:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c%d%d%d",&c,&x,&y,&z);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6904 KB Output is correct
2 Correct 9 ms 7016 KB Output is correct
3 Correct 12 ms 7016 KB Output is correct
4 Correct 9 ms 7104 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 670 ms 22316 KB Output is correct
2 Correct 314 ms 22316 KB Output is correct
3 Correct 634 ms 22316 KB Output is correct
4 Correct 589 ms 23144 KB Output is correct
5 Correct 534 ms 23144 KB Output is correct
6 Correct 517 ms 23144 KB Output is correct
7 Correct 375 ms 23144 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 23144 KB Output is correct
2 Correct 221 ms 23144 KB Output is correct
3 Correct 516 ms 23144 KB Output is correct
4 Correct 547 ms 23144 KB Output is correct
5 Correct 438 ms 23144 KB Output is correct
6 Correct 423 ms 23144 KB Output is correct
7 Correct 281 ms 23144 KB Output is correct
8 Correct 329 ms 23144 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6904 KB Output is correct
2 Correct 9 ms 7016 KB Output is correct
3 Correct 12 ms 7016 KB Output is correct
4 Correct 9 ms 7104 KB Output is correct
5 Correct 670 ms 22316 KB Output is correct
6 Correct 314 ms 22316 KB Output is correct
7 Correct 634 ms 22316 KB Output is correct
8 Correct 589 ms 23144 KB Output is correct
9 Correct 534 ms 23144 KB Output is correct
10 Correct 517 ms 23144 KB Output is correct
11 Correct 375 ms 23144 KB Output is correct
12 Correct 218 ms 23144 KB Output is correct
13 Correct 221 ms 23144 KB Output is correct
14 Correct 516 ms 23144 KB Output is correct
15 Correct 547 ms 23144 KB Output is correct
16 Correct 438 ms 23144 KB Output is correct
17 Correct 423 ms 23144 KB Output is correct
18 Correct 281 ms 23144 KB Output is correct
19 Correct 329 ms 23144 KB Output is correct
20 Correct 387 ms 23144 KB Output is correct
21 Correct 294 ms 23144 KB Output is correct
22 Correct 286 ms 23144 KB Output is correct
23 Correct 276 ms 23144 KB Output is correct
24 Correct 782 ms 23160 KB Output is correct
25 Correct 726 ms 24568 KB Output is correct
26 Correct 719 ms 24568 KB Output is correct
27 Correct 691 ms 24568 KB Output is correct
28 Correct 672 ms 24568 KB Output is correct
29 Correct 667 ms 24568 KB Output is correct
30 Correct 590 ms 24568 KB Output is correct
31 Correct 600 ms 24568 KB Output is correct
32 Correct 387 ms 24568 KB Output is correct
33 Correct 311 ms 24568 KB Output is correct
34 Correct 327 ms 24568 KB Output is correct
35 Correct 335 ms 24568 KB Output is correct