oj.uz

Submission #10721

# Submission time Handle Problem Language Result Execution time Memory
10721 2014-11-09T17:20:30 Z dohyun0324 Senior Postmen (BOI14_postmen) C++
100 / 100
 420 ms 46720 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;
int p,n,m,pos[500010],chv[500010],dap[500010],top,cnt,w,che[500010];
struct data
{
    int x,y,z;
    bool operator<(const data&r)const
    {
        return x<r.x;
    }
}arr[1000010];
void dfs(int x)
{
    int i,j;
    chv[x]=cnt;
    for(i=pos[x];;i++)
    {
        if(p)
        {
            dap[++top]=x;
            if(x==p)
            {
                for(j=1;j<=top;j++) printf("%d ",dap[j]);
                printf("\n");
                p=0;
            }
            else
            {
                chv[x]=0;
                break;
            }
        }
        if(arr[i].x!=x) break;
        if(che[arr[i].z]) continue;
        che[arr[i].z]=1;
        if(chv[arr[i].y]==cnt)
        {
            p=arr[i].y;
            top=0;
            dap[++top]=x;
            i++;
            chv[x]=0;
            break;
        }
        dfs(arr[i].y);
    }
    pos[x]=i;
}
int main()
{
    int i,j,x,y;
    scanf("%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        w++; arr[w].x=x; arr[w].y=y; arr[w].z=i;
        w++; arr[w].x=y; arr[w].y=x; arr[w].z=i;
    }
    sort(arr+1,arr+w+1);
    for(i=1;i<=w;i++)
    {
        if(arr[i].x!=arr[i-1].x) pos[arr[i].x]=i;
    }
    for(i=1;i<=n;i++)
    {
        while(arr[pos[i]].x==i)
        {
            p=0; cnt++; dfs(i);
        }
    }
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:52:11: warning: unused variable 'j' [-Wunused-variable]
     int i,j,x,y;
           ^
postmen.cpp:53: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:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 5 ms 436 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 56 ms 3448 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 58 ms 3576 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 12 ms 824 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 53 ms 3448 KB Output is correct
10 Correct 6 ms 432 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 69 ms 3528 KB Output is correct
13 Correct 73 ms 9464 KB Output is correct
14 Correct 68 ms 4216 KB Output is correct
15 Correct 63 ms 4088 KB Output is correct
16 Correct 80 ms 9576 KB Output is correct
17 Correct 74 ms 4216 KB Output is correct
18 Correct 71 ms 5496 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 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 12 ms 768 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 66 ms 3480 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 70 ms 3536 KB Output is correct
13 Correct 75 ms 9464 KB Output is correct
14 Correct 65 ms 4344 KB Output is correct
15 Correct 65 ms 4064 KB Output is correct
16 Correct 70 ms 9568 KB Output is correct
17 Correct 76 ms 4192 KB Output is correct
18 Correct 75 ms 5496 KB Output is correct
19 Correct 364 ms 46720 KB Output is correct
20 Correct 354 ms 20408 KB Output is correct
21 Correct 375 ms 19404 KB Output is correct
22 Correct 369 ms 46712 KB Output is correct
23 Correct 298 ms 16008 KB Output is correct
24 Correct 420 ms 20048 KB Output is correct
25 Correct 377 ms 26848 KB Output is correct