oj.uz

Submission #121469

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

using namespace std;

int d[300005],a,k,n,m,q,p,c[300005],d2[300005],v1[300005],sz,sz1,sz2,st,fx[300005],ch,res[2005];
vector<pair<int,int> >v[300005];
vector<int>rv[300005];
set<int>s;

void cch(int x,int dis,int st){
    for(int i=0;i<rv[x].size();i++){
        if(rv[x][i]==st) {sz=dis+1;return;}
        cch(rv[x][i],dis+1,st);
    }
}

void dfs(int x,int dis,int st){
    //cout<<st<<" "<<x<<" "<<dis<<" "<<k<<" "<<sz<<endl;
    if(x%2==0 && (k%sz)==(dis%sz) && dis<=k)
    {
        s.insert(x/2);
    }
    for(int i=0;i<rv[x].size();i++){
        if(rv[x][i]==st) continue;
        dfs(rv[x][i],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
        int a=R[i][0];
        int b=R[i][1];
        v[a].push_back({i,b});
        v[b].push_back({i,a});
    }
    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];
        s.clear();
        sz=sz1;dfs(2*p,0,2*p);
        sz=sz2;dfs(2*p+1,0,2*p+1);
        sz=s.size();
        answer(sz);
    }
}

Compilation message

garden.cpp: In function 'void cch(int, int, int)':
garden.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<rv[x].size();i++){
                 ~^~~~~~~~~~~~~
garden.cpp: In function 'void dfs(int, int, int)':
garden.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<rv[x].size();i++){
                 ~^~~~~~~~~~~~~

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14684 KB Output is correct
2 Correct 16 ms 14556 KB Output is correct
3 Correct 16 ms 14556 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 16 ms 14728 KB Output is correct
7 Correct 13 ms 14460 KB Output is correct
8 Correct 17 ms 14560 KB Output is correct
9 Correct 18 ms 14844 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14684 KB Output is correct
2 Correct 16 ms 14556 KB Output is correct
3 Correct 16 ms 14556 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 16 ms 14728 KB Output is correct
7 Correct 13 ms 14460 KB Output is correct
8 Correct 17 ms 14560 KB Output is correct
9 Correct 18 ms 14844 KB Output is correct
10 Correct 15 ms 14432 KB Output is correct
11 Correct 29 ms 16920 KB Output is correct
12 Correct 41 ms 18424 KB Output is correct
13 Correct 84 ms 35036 KB Output is correct
14 Correct 155 ms 26872 KB Output is correct
15 Correct 234 ms 27524 KB Output is correct
16 Correct 165 ms 24588 KB Output is correct
17 Correct 156 ms 23800 KB Output is correct
18 Correct 51 ms 18512 KB Output is correct
19 Correct 156 ms 26852 KB Output is correct
20 Correct 216 ms 27472 KB Output is correct
21 Correct 166 ms 24416 KB Output is correct
22 Correct 141 ms 23620 KB Output is correct
23 Correct 152 ms 28000 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14684 KB Output is correct
2 Correct 16 ms 14556 KB Output is correct
3 Correct 16 ms 14556 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 16 ms 14728 KB Output is correct
7 Correct 13 ms 14460 KB Output is correct
8 Correct 17 ms 14560 KB Output is correct
9 Correct 18 ms 14844 KB Output is correct
10 Correct 15 ms 14432 KB Output is correct
11 Correct 29 ms 16920 KB Output is correct
12 Correct 41 ms 18424 KB Output is correct
13 Correct 84 ms 35036 KB Output is correct
14 Correct 155 ms 26872 KB Output is correct
15 Correct 234 ms 27524 KB Output is correct
16 Correct 165 ms 24588 KB Output is correct
17 Correct 156 ms 23800 KB Output is correct
18 Correct 51 ms 18512 KB Output is correct
19 Correct 156 ms 26852 KB Output is correct
20 Correct 216 ms 27472 KB Output is correct
21 Correct 166 ms 24416 KB Output is correct
22 Correct 141 ms 23620 KB Output is correct
23 Correct 152 ms 28000 KB Output is correct
24 Correct 17 ms 14508 KB Output is correct
25 Correct 161 ms 16808 KB Output is correct
26 Correct 108 ms 18364 KB Output is correct
27 Execution timed out 5032 ms 34708 KB Time limit exceeded
28 Halted 0 ms 0 KB -