oj.uz

답안 #121511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121511 2019-06-26T15:36:51 Z baqargam 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
69 / 100
 5000 ms 27304 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];
bool fx1[300005];
vector<pair<int,int> >v[150005];
vector<int>rv[300005];

inline 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);
    }
}

inline void dfs(int x,int dis,int st){
    fx1[x]=1;
    if(k<dis) return;
    if(!(x&1) && (k-dis)%sz==0)
    {
        res+=(1^fx[x]);
        fx[x]=1;
    }
    for(vector<int> :: iterator it=rv[x].begin();it!=rv[x].end();it++){
        if(*it==st) continue;
        if(!fx[*it])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,i;
    for(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(i=0;i<n;i++){
        sort(v[i].begin(),v[i].end());
    }
    for(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[(i<<1)^1]=(to<<1)^1;
            else
                v1[(i<<1)^1]=(to<<1);

            if(v[to][0].first==val)
                v1[(i<<1)]=(to<<1)^1;
            else
                v1[(i<<1)]=(to<<1);
        }
        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[(i<<1)]=(to<<1)^1;
            else
                v1[(i<<1)]=(to<<1);

            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[(i<<1)^1]=(to<<1)^1;
            else
                v1[(i<<1)^1]=(to<<1);

        }
    }

    for(i=0;i<2*n;i++){
        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(i=0; i<Q; i++)
    {
        k=G[i];
        memset (fx,0,n<<1);
        res=0;
        memset (fx1,0,n<<1);sz=sz1;dfs((p<<1),0,(p<<1));
        memset (fx1,0,n<<1);sz=sz2;dfs((p<<1)^1,0,(p<<1)^1);
        answer(res);
    }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10972 KB Output is correct
2 Correct 12 ms 10872 KB Output is correct
3 Correct 12 ms 11128 KB Output is correct
4 Correct 11 ms 10872 KB Output is correct
5 Correct 12 ms 10872 KB Output is correct
6 Correct 12 ms 11084 KB Output is correct
7 Correct 12 ms 10972 KB Output is correct
8 Correct 8 ms 11000 KB Output is correct
9 Correct 8 ms 11196 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10972 KB Output is correct
2 Correct 12 ms 10872 KB Output is correct
3 Correct 12 ms 11128 KB Output is correct
4 Correct 11 ms 10872 KB Output is correct
5 Correct 12 ms 10872 KB Output is correct
6 Correct 12 ms 11084 KB Output is correct
7 Correct 12 ms 10972 KB Output is correct
8 Correct 8 ms 11000 KB Output is correct
9 Correct 8 ms 11196 KB Output is correct
10 Correct 12 ms 10872 KB Output is correct
11 Correct 25 ms 13176 KB Output is correct
12 Correct 46 ms 14880 KB Output is correct
13 Correct 68 ms 27232 KB Output is correct
14 Correct 199 ms 23348 KB Output is correct
15 Correct 201 ms 23640 KB Output is correct
16 Correct 166 ms 20856 KB Output is correct
17 Correct 157 ms 19852 KB Output is correct
18 Correct 48 ms 14752 KB Output is correct
19 Correct 151 ms 23328 KB Output is correct
20 Correct 198 ms 23544 KB Output is correct
21 Correct 182 ms 20672 KB Output is correct
22 Correct 143 ms 19804 KB Output is correct
23 Correct 162 ms 24508 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10972 KB Output is correct
2 Correct 12 ms 10872 KB Output is correct
3 Correct 12 ms 11128 KB Output is correct
4 Correct 11 ms 10872 KB Output is correct
5 Correct 12 ms 10872 KB Output is correct
6 Correct 12 ms 11084 KB Output is correct
7 Correct 12 ms 10972 KB Output is correct
8 Correct 8 ms 11000 KB Output is correct
9 Correct 8 ms 11196 KB Output is correct
10 Correct 12 ms 10872 KB Output is correct
11 Correct 25 ms 13176 KB Output is correct
12 Correct 46 ms 14880 KB Output is correct
13 Correct 68 ms 27232 KB Output is correct
14 Correct 199 ms 23348 KB Output is correct
15 Correct 201 ms 23640 KB Output is correct
16 Correct 166 ms 20856 KB Output is correct
17 Correct 157 ms 19852 KB Output is correct
18 Correct 48 ms 14752 KB Output is correct
19 Correct 151 ms 23328 KB Output is correct
20 Correct 198 ms 23544 KB Output is correct
21 Correct 182 ms 20672 KB Output is correct
22 Correct 143 ms 19804 KB Output is correct
23 Correct 162 ms 24508 KB Output is correct
24 Correct 13 ms 11000 KB Output is correct
25 Correct 164 ms 13200 KB Output is correct
26 Correct 141 ms 14848 KB Output is correct
27 Execution timed out 5046 ms 27304 KB Time limit exceeded
28 Halted 0 ms 0 KB -