oj.uz

Submission #17658

# Submission time Handle Problem Language Result Execution time Memory
17658 2016-01-08T00:14:24 Z Namnamseo Senior Postmen (BOI14_postmen) C++14
100 / 100
 399 ms 20012 KB 
#include <cstdio>
#include <vector>
 
int n,m;
 
int start[ 500010];
int endp [1000010];
int next [1000010];
bool dead[1000010];
 
int counter;
 
void addEdge(int from,int to)
{
    next [counter] = start[from];
    start[from   ] = counter;
    endp [counter] = to;
    ++counter;
}
 
int stack[500010];
int hi   [500010];
int top=-1;
 
void push(int x) { stack[++top]=x; }
int  pop (     ) { return stack[top--]; }
 
bool visited[500010];
 
int main()
{
    counter=1;
    scanf("%d%d",&n,&m);
    int i,a,b;
    for(i=0;i<m;i++){
        scanf("%d%d",&a,&b);
        addEdge(a,b);
        addEdge(b,a);
    }
    push(1);
    int cur;
    int t=0;
    while(top>=0)
    {
        cur=stack[top];
        while(dead[start[cur]] && start[cur]) {
            start[cur]=next[start[cur]];
        }
        if(start[cur]==0) {
            hi[t++]=cur;
            --top;
            continue;
        } else {
            push(endp[start[cur]]);
            dead[start[cur]]=true;
            if(start[cur]%2){
                dead[start[cur]+1]=true;
            } else dead[start[cur]-1]=true;
        }
    }
    top=-1;
    int temp;
    for(i=0;i<t;++i)
    {
        cur = hi[i];
        //printf("%d ",cur);
        if(visited[cur])
        {
            while((temp=pop())!=cur) {
                printf("%d ",temp);
                visited[temp]=false;
            }
            printf("%d\n",cur);
            push(cur);
        } else {
            visited[cur]=true;
            push(cur);
        }
    }
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:33: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:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.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 432 KB Output is correct
4 Correct 6 ms 488 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 11 ms 768 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 41 ms 3324 KB Output is correct
10 Correct 6 ms 488 KB Output is correct
11 Correct 6 ms 416 KB Output is correct
12 Correct 56 ms 3320 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 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 41 ms 3320 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 43 ms 3336 KB Output is correct
13 Correct 52 ms 4088 KB Output is correct
14 Correct 51 ms 3704 KB Output is correct
15 Correct 50 ms 3692 KB Output is correct
16 Correct 47 ms 3960 KB Output is correct
17 Correct 51 ms 3448 KB Output is correct
18 Correct 55 ms 3808 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 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 11 ms 888 KB Output is correct
8 Correct 5 ms 488 KB Output is correct
9 Correct 42 ms 3832 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 45 ms 3960 KB Output is correct
13 Correct 63 ms 4576 KB Output is correct
14 Correct 70 ms 4196 KB Output is correct
15 Correct 47 ms 4220 KB Output is correct
16 Correct 56 ms 4600 KB Output is correct
17 Correct 53 ms 3960 KB Output is correct
18 Correct 60 ms 4384 KB Output is correct
19 Correct 351 ms 20012 KB Output is correct
20 Correct 365 ms 18408 KB Output is correct
21 Correct 329 ms 17252 KB Output is correct
22 Correct 331 ms 18912 KB Output is correct
23 Correct 205 ms 14928 KB Output is correct
24 Correct 399 ms 16064 KB Output is correct
25 Correct 330 ms 17600 KB Output is correct