oj.uz

Submission #14817

# Submission time Handle Problem Language Result Execution time Memory
14817 2015-06-28T07:13:31 Z eaststar Senior Postmen (BOI14_postmen) C++
100 / 100
 437 ms 19560 KB 
#include <stdio.h>
int s[500010],e[500010],cnt[500010],a[1000010],visit[500010],chk[500010],p[500010];
void ans(int k){
    int t,l;
    for(;;k=l){
        int&n=cnt[k];
        for(;(s[a[n]]==k||e[a[n]]==k)&&chk[a[n]];++n);
        if(s[a[n]]!=k&&e[a[n]]!=k)return;
        visit[k]=chk[a[n]]=1;
        l=s[a[n]]==k? e[a[n]]:s[a[n]];
        if(visit[l]){
            t=k;
            for(;t!=l;t=p[t]){
                visit[t]=0;
                printf("%d ",t);
            }
            printf("%d\n",t);
        }
        else p[l]=k;
    }
}
int main(){
    int i,n,m;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i){
        scanf("%d%d",s+i,e+i);
        ++cnt[s[i]],++cnt[e[i]];
    }
    for(i=1;i<=n;++i)cnt[i]+=cnt[i-1];
    for(i=1;i<=m;++i)a[--cnt[s[i]]]=a[--cnt[e[i]]]=i;
    for(i=1;i<=n;++i)ans(i);
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
postmen.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",s+i,e+i);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 13 ms 768 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 50 ms 2656 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 45 ms 2808 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 43 ms 2728 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 51 ms 2744 KB Output is correct
13 Correct 52 ms 4088 KB Output is correct
14 Correct 57 ms 3808 KB Output is correct
15 Correct 58 ms 3540 KB Output is correct
16 Correct 59 ms 4120 KB Output is correct
17 Correct 55 ms 3704 KB Output is correct
18 Correct 61 ms 3724 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 560 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 11 ms 768 KB Output is correct
8 Correct 8 ms 384 KB Output is correct
9 Correct 44 ms 2684 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 45 ms 2808 KB Output is correct
13 Correct 58 ms 4064 KB Output is correct
14 Correct 66 ms 3704 KB Output is correct
15 Correct 49 ms 3484 KB Output is correct
16 Correct 64 ms 4088 KB Output is correct
17 Correct 55 ms 3680 KB Output is correct
18 Correct 51 ms 3808 KB Output is correct
19 Correct 339 ms 19560 KB Output is correct
20 Correct 327 ms 17912 KB Output is correct
21 Correct 329 ms 16540 KB Output is correct
22 Correct 322 ms 19336 KB Output is correct
23 Correct 214 ms 12024 KB Output is correct
24 Correct 437 ms 17284 KB Output is correct
25 Correct 344 ms 17836 KB Output is correct