oj.uz

Submission #66367

# Submission time Handle Problem Language Result Execution time Memory
66367 2018-08-10T10:29:01 Z yusufake Zagrade (COI17_zagrade) C++
10 / 100
 3000 ms 53080 KB 
#include<bits/stdc++.h> 
using namespace std; 

#define mp make_pair 
#define pb push_back 
#define st first 
#define nd second 

typedef long long ll; 
typedef pair < int , int > pp; 
const int mod = 1e9 + 7; 
const int N   = 3e5 + 5; 

vector < int > V[N];
int sz[N],U[N],T[N+N],A[N],C,n,i,x,y;
char s[N];
ll ans;

void f(int x, int p, int n){
    sz[x] = 1; int h=1;
    for(auto y : V[x]){
        if(U[y] || y == p) continue;
        f(y,x,n);
        sz[x] += sz[y];
        if(sz[y] > n/2) h=0;
    }
    if(h && n-sz[x] <= n/2) C=x;
}

vector < int > v[N];
int node;
void g(int x, int p, int t, int mn, int mx){
    sz[x] = 1; 
    t += A[x];
    mn = min(mn , t);
    mx = max(mx , t);
    if(!node && t == mx && A[x] == 1) ans += T[t];
    if(node && t == mn && t <= 0) { v[node].pb(-t); T[-t]++; }
    for(auto y : V[x]){
        if(U[y] || y == p) continue;
        g(y,x,t,mn,mx);
        sz[x] += sz[y];
    }
}

void slv(int x, int n){
    f(x,0,n);
    x = C;
    U[x] = 1;
    memset(T,0,sizeof T);
    if(A[x] == -1) T[1]++;
    for(auto y : V[x]){
        if(U[y]) continue;
        node = y;
        g(y,x,A[x],A[x],A[x]);
    }
    node = 0;
    if(A[x] == 1) ans += T[0];
    for(auto y : V[x]){
        if(U[y]) continue;
        for(auto t : v[y]) T[t]--;
        g(y,x,0,0,0);
        for(auto t : v[y]) T[t]++;
    }
    
    if(A[x] == -1) T[1]--;
    for(auto y : V[x]){
        if(U[y]) continue;
        for(auto t : v[y]) T[t]--;
        v[y].clear();
    }
    
    //cout << x << " " << ans << " ss\n";
    //exit(0);
    for(auto y : V[x]) if(!U[y]) slv(y,sz[y]);
}


int main(){
    scanf("%d %s",&n,s+1);
    for(i=1;i<=n;i++) A[i] = s[i] == '(' ? 1 : -1;
    for(i=2;i<=n;i++){
        scanf("%d%d",&x,&y);
        V[x].pb(y); V[y].pb(x);
    }
    
    slv(1,n);
    printf("%lld",ans);
    return 0;
}

Compilation message

zagrade.cpp: In function 'int main()':
zagrade.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s",&n,s+1);
     ~~~~~^~~~~~~~~~~~~~~~
zagrade.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 16760 KB Output is correct
2 Correct 146 ms 16888 KB Output is correct
3 Correct 148 ms 17032 KB Output is correct
4 Correct 145 ms 17032 KB Output is correct
5 Correct 147 ms 17032 KB Output is correct
6 Correct 149 ms 17032 KB Output is correct
7 Correct 150 ms 17272 KB Output is correct
8 Correct 157 ms 17272 KB Output is correct
9 Correct 132 ms 17272 KB Output is correct
10 Correct 139 ms 17272 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 53080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 16760 KB Output is correct
2 Correct 146 ms 16888 KB Output is correct
3 Correct 148 ms 17032 KB Output is correct
4 Correct 145 ms 17032 KB Output is correct
5 Correct 147 ms 17032 KB Output is correct
6 Correct 149 ms 17032 KB Output is correct
7 Correct 150 ms 17272 KB Output is correct
8 Correct 157 ms 17272 KB Output is correct
9 Correct 132 ms 17272 KB Output is correct
10 Correct 139 ms 17272 KB Output is correct
11 Execution timed out 3063 ms 53080 KB Time limit exceeded
12 Halted 0 ms 0 KB -