oj.uz

Submission #121489

# Submission time Handle Problem Language Result Execution time Memory
121489 2019-06-26T14:37:53 Z baqargam Tropical Garden (IOI11_garden) C++14
69 / 100
 5000 ms 29412 KB 
#include<bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"

using namespace std;

int a,k,n,m,q,p,v1[300005],sz,sz1,sz2,st,ch,res;
bool fx[300005];
vector<pair<int,int> >v[150005];
vector<int>rv[300005];

void cch(int x,int dis,int st){
    for(vector<int> :: iterator it=rv[x].begin();it!=rv[x].end();it++){
        if(*it==st) {sz=dis+1;return;}
        cch(*it,dis+1,st);
    }
}

void dfs(int x,int dis,int st){
    //cout<<st<<" "<<x<<" "<<dis<<" "<<k<<" "<<sz<<endl;
    if(x%2==0 && abs(k-dis)%sz==0 && dis<=k)
    {
        res+=(1^fx[x]);
        fx[x]=1;
    }
    for(vector<int> :: iterator it=rv[x].begin();it!=rv[x].end();it++){
        if(*it==st) continue;
        dfs(*it,dis+1,st);
    }
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    int n=N,m=M,p=P;
    for(int i=0;i<m;i++){///grafi1
        v[R[i][0]].push_back({i,R[i][1]});
        v[R[i][1]].push_back({i,R[i][0]});
    }
    for(int i=0;i<n;i++){
        sort(v[i].begin(),v[i].end());
    }
    for(int i=0;i<n;i++){///grafi2
        if(v[i].size()==1)
        {
            int to=v[i][0].second;
            int val=v[i][0].first;
            if(v[to][0].first==val)
                v1[2*i+1]=2*to+1;
            else
                v1[2*i+1]=2*to;

            if(v[to][0].first==val)
                v1[2*i]=2*to+1;
            else
                v1[2*i]=2*to;
        }
        else
        {
            int to=v[i][0].second;
            int val=v[i][0].first;
//            cout<<i<<" "<<to<<" "<<val<<" "<<v[to][0].first<<endl;
            if(v[to][0].first==val)
                v1[2*i]=2*to+1;
            else
                v1[2*i]=2*to;

            to=v[i][1].second;
            val=v[i][1].first;
//            cout<<i<<" "<<to<<" "<<val<<" "<<v[to][0].first<<endl;
            if(v[to][0].first==val)
                v1[2*i+1]=2*to+1;
            else
                v1[2*i+1]=2*to;

        }
    }

    for(int i=0;i<2*n;i++){
        //cout<<i<<" "<<v1[i]<<endl;
        rv[v1[i]].push_back(i);
    }


    sz=1000000003;cch(2*p,0,2*p);sz1=sz;
    sz=1000000003;cch(2*p+1,0,2*p+1);sz2=sz;

    for(int i=0; i<Q; i++)
    {
        k=G[i];
        for(int j=0;j<2*n;j++)
            fx[j]=0;
        res=0;
        sz=sz1;dfs(2*p,0,2*p);
        sz=sz2;dfs(2*p+1,0,2*p+1);
        answer(res);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11000 KB Output is correct
2 Correct 10 ms 11000 KB Output is correct
3 Correct 13 ms 11076 KB Output is correct
4 Correct 12 ms 10972 KB Output is correct
5 Correct 12 ms 10972 KB Output is correct
6 Correct 13 ms 11220 KB Output is correct
7 Correct 9 ms 10872 KB Output is correct
8 Correct 12 ms 11000 KB Output is correct
9 Correct 15 ms 11256 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11000 KB Output is correct
2 Correct 10 ms 11000 KB Output is correct
3 Correct 13 ms 11076 KB Output is correct
4 Correct 12 ms 10972 KB Output is correct
5 Correct 12 ms 10972 KB Output is correct
6 Correct 13 ms 11220 KB Output is correct
7 Correct 9 ms 10872 KB Output is correct
8 Correct 12 ms 11000 KB Output is correct
9 Correct 15 ms 11256 KB Output is correct
10 Correct 12 ms 10972 KB Output is correct
11 Correct 25 ms 13304 KB Output is correct
12 Correct 49 ms 15376 KB Output is correct
13 Correct 75 ms 29412 KB Output is correct
14 Correct 135 ms 24696 KB Output is correct
15 Correct 214 ms 25100 KB Output is correct
16 Correct 145 ms 22160 KB Output is correct
17 Correct 133 ms 21236 KB Output is correct
18 Correct 46 ms 15260 KB Output is correct
19 Correct 140 ms 24696 KB Output is correct
20 Correct 201 ms 25232 KB Output is correct
21 Correct 161 ms 22032 KB Output is correct
22 Correct 137 ms 20316 KB Output is correct
23 Correct 162 ms 24720 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11000 KB Output is correct
2 Correct 10 ms 11000 KB Output is correct
3 Correct 13 ms 11076 KB Output is correct
4 Correct 12 ms 10972 KB Output is correct
5 Correct 12 ms 10972 KB Output is correct
6 Correct 13 ms 11220 KB Output is correct
7 Correct 9 ms 10872 KB Output is correct
8 Correct 12 ms 11000 KB Output is correct
9 Correct 15 ms 11256 KB Output is correct
10 Correct 12 ms 10972 KB Output is correct
11 Correct 25 ms 13304 KB Output is correct
12 Correct 49 ms 15376 KB Output is correct
13 Correct 75 ms 29412 KB Output is correct
14 Correct 135 ms 24696 KB Output is correct
15 Correct 214 ms 25100 KB Output is correct
16 Correct 145 ms 22160 KB Output is correct
17 Correct 133 ms 21236 KB Output is correct
18 Correct 46 ms 15260 KB Output is correct
19 Correct 140 ms 24696 KB Output is correct
20 Correct 201 ms 25232 KB Output is correct
21 Correct 161 ms 22032 KB Output is correct
22 Correct 137 ms 20316 KB Output is correct
23 Correct 162 ms 24720 KB Output is correct
24 Correct 13 ms 11000 KB Output is correct
25 Correct 192 ms 13412 KB Output is correct
26 Correct 198 ms 15364 KB Output is correct
27 Execution timed out 5077 ms 28464 KB Time limit exceeded
28 Halted 0 ms 0 KB -