oj.uz

Submission #87176

# Submission time Handle Problem Language Result Execution time Memory
87176 2018-11-29T22:15:02 Z nikolapesic2802 Zagrade (COI17_zagrade) C++14
100 / 100
 988 ms 135384 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a) {
	os << '{';
	for(int i=0;i<sz(a);i++)
	{
		if(i>0&&i<sz(a)-1)
			os << ", ";
		os << a[i];
	}
	os << '}';
    return os;
}
const int N=3e5+5;
vector<vector<int> > graf(N),drvo(N);
vector<int> visited(N),siz(N),local(N),what(N);
void dfs(int tr,int par)
{
    siz[tr]=1;
    for(auto p:graf[tr])
    {
        if(visited[p]||p==par)
            continue;
        dfs(p,tr);
        siz[tr]+=siz[p];
    }
}
int find_centroid(int tr,int n,int par)
{
    for(auto p:graf[tr])
    {
        if(p==par||visited[p])
            continue;
        if(siz[p]>n/2)
            return find_centroid(p,n,tr);
    }
    return tr;
}
int decompose(int tr)
{
    dfs(tr,-1);
    tr=find_centroid(tr,siz[tr],-1);
    visited[tr]=1;
    for(auto p:graf[tr])
    {
        if(visited[p])
            continue;
        int t=decompose(p);
        //printf("%i--%i\n",tr,t);
        drvo[t].pb(tr);
        drvo[tr].pb(t);
    }
    return tr;
}
ll cnt=0;
vector<int> allowed(N),str,fin,start(N),finish(N);
void calculate(int tr,int par,int offset,int maxx,int minn)
{
    //printf("Calculatujem %i\n",tr);
    if(what[tr]==0){
        offset++;
        maxx=max(maxx,offset);
        if(offset>=0&&offset==maxx)
        {
            str.pb(offset);
            //printf("Dodajem start %i\n",offset);
        }
    }
    else{
        offset--;
        minn=min(minn,offset);
        if(offset<=0&&offset==minn)
        {
            fin.pb(-1*offset);
            //printf("Dodajem finish %i\n",offset*-1);
        }
    }
    for(auto p:graf[tr])
    {
        if(allowed[p]==0||p==par)
            continue;
        calculate(p,tr,offset,maxx,minn);
    }
}
void solve(int tr,int par)
{
    for(auto p:drvo[tr])
    {
        if(p==par)
            continue;
        solve(p,tr);
    }
    int off;
    if(what[tr]==0)
        off=1;
    else
        off=-1;
    //printf("Solvujem %i %lld\n",tr,cnt);
    vector<int> s,f;
    for(auto p:graf[tr])
    {
        if(allowed[p]){
            //printf("Calculatujem %i\n",p);
            calculate(p,tr,0,0,0);
            for(auto p:str)
            {
                if(off+p>=0)
                    cnt+=finish[p+off];
                s.pb(p);
            }
            for(auto p:fin){
                if(p-off>=0)
                    cnt+=start[p-off];
                finish[p]++;
                f.pb(p);
            }
            for(auto p:str)
                start[p]++;
            str.clear();
            fin.clear();
        }
    }
    //printf("%i %i %i\n",tr,what[tr],finish[1]);
    allowed[tr]=1;
    if(what[tr]==0)
        cnt+=finish[1];
    else
        cnt+=start[1];
    for(auto p:s)
        start[p]=0;
    for(auto p:f)
        finish[p]=0;
}
int main()
{
	int n;
	scanf("%i",&n);
	string s;
	cin >> s;
	for(int i=0;i<n;i++)
        what[i+1]=s[i]==')';
	for(int i=1;i<n;i++)
    {
        int a,b;
        scanf("%i %i",&a,&b);
        graf[a].pb(b);
        graf[b].pb(a);
    }
    int root=decompose(1);
    //printf("Root: %i\n",root);
    solve(root,-1);
    printf("%lld\n",cnt);
    return 0;
}

Compilation message

zagrade.cpp: In function 'int main()':
zagrade.cpp:154:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
zagrade.cpp:162:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i %i",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 22776 KB Output is correct
2 Correct 22 ms 22780 KB Output is correct
3 Correct 22 ms 22852 KB Output is correct
4 Correct 29 ms 22852 KB Output is correct
5 Correct 25 ms 22864 KB Output is correct
6 Correct 25 ms 22884 KB Output is correct
7 Correct 23 ms 22896 KB Output is correct
8 Correct 23 ms 22908 KB Output is correct
9 Correct 28 ms 23060 KB Output is correct
10 Correct 28 ms 23072 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 60828 KB Output is correct
2 Correct 486 ms 67212 KB Output is correct
3 Correct 462 ms 68764 KB Output is correct
4 Correct 498 ms 72916 KB Output is correct
5 Correct 448 ms 74680 KB Output is correct
6 Correct 463 ms 79936 KB Output is correct
7 Correct 477 ms 83132 KB Output is correct
8 Correct 483 ms 88388 KB Output is correct
9 Correct 468 ms 88388 KB Output is correct
10 Correct 442 ms 91964 KB Output is correct
11 Correct 451 ms 91964 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 22776 KB Output is correct
2 Correct 22 ms 22780 KB Output is correct
3 Correct 22 ms 22852 KB Output is correct
4 Correct 29 ms 22852 KB Output is correct
5 Correct 25 ms 22864 KB Output is correct
6 Correct 25 ms 22884 KB Output is correct
7 Correct 23 ms 22896 KB Output is correct
8 Correct 23 ms 22908 KB Output is correct
9 Correct 28 ms 23060 KB Output is correct
10 Correct 28 ms 23072 KB Output is correct
11 Correct 475 ms 60828 KB Output is correct
12 Correct 486 ms 67212 KB Output is correct
13 Correct 462 ms 68764 KB Output is correct
14 Correct 498 ms 72916 KB Output is correct
15 Correct 448 ms 74680 KB Output is correct
16 Correct 463 ms 79936 KB Output is correct
17 Correct 477 ms 83132 KB Output is correct
18 Correct 483 ms 88388 KB Output is correct
19 Correct 468 ms 88388 KB Output is correct
20 Correct 442 ms 91964 KB Output is correct
21 Correct 451 ms 91964 KB Output is correct
22 Correct 928 ms 91964 KB Output is correct
23 Correct 939 ms 91964 KB Output is correct
24 Correct 918 ms 91964 KB Output is correct
25 Correct 988 ms 91964 KB Output is correct
26 Correct 498 ms 95868 KB Output is correct
27 Correct 568 ms 97500 KB Output is correct
28 Correct 533 ms 100560 KB Output is correct
29 Correct 447 ms 124884 KB Output is correct
30 Correct 439 ms 129188 KB Output is correct
31 Correct 164 ms 129188 KB Output is correct
32 Correct 494 ms 135384 KB Output is correct