oj.uz

답안 #16474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16474 2015-08-26T11:03:48 Z khsoo01 열대 식물원 (Tropical Garden) (IOI11_garden) C++
69 / 100
 5000 ms 32456 KB 
#include<bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"
#define INF 0x7fffffff
using namespace std;
vector<int>cg[300005],cn[300005];
int n,m,p,ed[300005][2],cur,flag,vis[300005],cnt;
bool state;

struct destination {
    int dist[300005],cyc_len=0;
    bool in_cyc=false;
}d[2];

void find_cyc(int idx) {
    if(vis[idx]==1) {
        if(!d[state].in_cyc && idx!=cn[p][state]) return;
        d[state].in_cyc=true;
        d[state].cyc_len++;
    }
    if(vis[idx]==2) return;
    vis[idx]++;
    find_cyc(cn[ed[idx][1]][(cg[ed[idx][1]][0]==ed[idx][0] && cg[ed[idx][1]].size()>1)?1:0]);
    vis[idx]=0;
}

int find_dist(int idx) {
    if(cn[p][state]==idx) return d[state].dist[idx]=0;
    if(vis[idx]) return d[state].dist[idx];
    vis[idx]++;
    return d[state].dist[idx]=find_dist(cn[ed[idx][1]][(cg[ed[idx][1]][0]==ed[idx][0] && cg[ed[idx][1]].size()>1)?1:0])+1;
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    int i,j,k; n=N; m=M; p=P;
    for(i=0;i<m;i++) {
        ed[i][0]=R[i][0];
        ed[i][1]=R[i][1];
        ed[i+m][0]=R[i][1];
        ed[i+m][1]=R[i][0];
        cg[ed[i][0]].push_back(ed[i][1]);
        cn[ed[i][0]].push_back(i);
        cg[ed[i][1]].push_back(ed[i][0]);
        cn[ed[i][1]].push_back(i+m);
        d[0].dist[i]=-INF;
        d[1].dist[i]=-INF;
        d[0].dist[i+M]=-INF;
        d[1].dist[i+M]=-INF;
    }
    state=0;
    find_cyc(cn[p][0]);
    state=1;
    find_cyc(cn[p][1]);
    state=0;
    for(i=0;i<2*m;i++) {
        if(vis[i])continue;
        find_dist(i);
    }
    state=1;
    memset(vis,0,sizeof(vis));
    for(i=0;i<2*m;i++) {
        if(vis[i])continue;
        find_dist(i);
    }
    int tmp;
    for(i=0;i<Q;i++) {
        cnt=0;
        for(j=0;j<n;j++) {
            tmp=cn[j][0];
            flag=0;
            for(k=0;k<2;k++) {
                if(d[k].dist[tmp]<0) continue;
                if(d[k].dist[tmp]==G[i])flag=1;
                if(d[k].dist[tmp]<G[i] && d[k].in_cyc && (G[i]-d[k].dist[tmp])%d[k].cyc_len==0)flag=1;
            }
            if(flag)cnt++;
        }
        answer(cnt);
    }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 15728 KB Output is correct
2 Correct 17 ms 15736 KB Output is correct
3 Correct 17 ms 15692 KB Output is correct
4 Correct 17 ms 15672 KB Output is correct
5 Correct 13 ms 15608 KB Output is correct
6 Correct 17 ms 15840 KB Output is correct
7 Correct 17 ms 15736 KB Output is correct
8 Correct 17 ms 15736 KB Output is correct
9 Correct 21 ms 16304 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 15728 KB Output is correct
2 Correct 17 ms 15736 KB Output is correct
3 Correct 17 ms 15692 KB Output is correct
4 Correct 17 ms 15672 KB Output is correct
5 Correct 13 ms 15608 KB Output is correct
6 Correct 17 ms 15840 KB Output is correct
7 Correct 17 ms 15736 KB Output is correct
8 Correct 17 ms 15736 KB Output is correct
9 Correct 21 ms 16304 KB Output is correct
10 Correct 17 ms 15672 KB Output is correct
11 Correct 32 ms 18260 KB Output is correct
12 Correct 67 ms 21052 KB Output is correct
13 Correct 86 ms 30456 KB Output is correct
14 Correct 239 ms 31356 KB Output is correct
15 Correct 245 ms 31740 KB Output is correct
16 Correct 224 ms 29128 KB Output is correct
17 Correct 219 ms 28384 KB Output is correct
18 Correct 65 ms 20892 KB Output is correct
19 Correct 238 ms 31440 KB Output is correct
20 Correct 244 ms 31748 KB Output is correct
21 Correct 233 ms 28856 KB Output is correct
22 Correct 223 ms 28132 KB Output is correct
23 Correct 234 ms 32456 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 15728 KB Output is correct
2 Correct 17 ms 15736 KB Output is correct
3 Correct 17 ms 15692 KB Output is correct
4 Correct 17 ms 15672 KB Output is correct
5 Correct 13 ms 15608 KB Output is correct
6 Correct 17 ms 15840 KB Output is correct
7 Correct 17 ms 15736 KB Output is correct
8 Correct 17 ms 15736 KB Output is correct
9 Correct 21 ms 16304 KB Output is correct
10 Correct 17 ms 15672 KB Output is correct
11 Correct 32 ms 18260 KB Output is correct
12 Correct 67 ms 21052 KB Output is correct
13 Correct 86 ms 30456 KB Output is correct
14 Correct 239 ms 31356 KB Output is correct
15 Correct 245 ms 31740 KB Output is correct
16 Correct 224 ms 29128 KB Output is correct
17 Correct 219 ms 28384 KB Output is correct
18 Correct 65 ms 20892 KB Output is correct
19 Correct 238 ms 31440 KB Output is correct
20 Correct 244 ms 31748 KB Output is correct
21 Correct 233 ms 28856 KB Output is correct
22 Correct 223 ms 28132 KB Output is correct
23 Correct 234 ms 32456 KB Output is correct
24 Correct 18 ms 15580 KB Output is correct
25 Correct 260 ms 18276 KB Output is correct
26 Correct 510 ms 20884 KB Output is correct
27 Correct 1999 ms 30056 KB Output is correct
28 Execution timed out 5044 ms 30232 KB Time limit exceeded
29 Halted 0 ms 0 KB -