oj.uz

답안 #226520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226520 2020-04-24T07:05:01 Z MKopchev 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 499 ms 61816 KB 
#include<bits/stdc++.h>
using namespace std;

const int nmax=5e5+42;

int n,m;

vector< pair<int,int> > adj[nmax];

int pointer[nmax];

int outp[nmax],pnt=0;

bool blocked[nmax];

void tour(int node)
{
    for(;pointer[node]<adj[node].size();pointer[node]++)
        if(blocked[adj[node][pointer[node]].second]==0)
        {
            blocked[adj[node][pointer[node]].second]=1;
            tour(adj[node][pointer[node]].first);
        }
    pnt++;
    outp[pnt]=node;
}

int current[nmax],pnt_current=0;

int lst_seen[nmax];

void add(int val)
{
    pnt_current++;
    lst_seen[val]=pnt_current;
    current[pnt_current]=val;
}
int main()
{
    scanf("%i%i",&n,&m);

    for(int i=1;i<=m;i++)
    {
        int u,v;
        scanf("%i%i",&u,&v);
        adj[u].push_back({v,i});
        adj[v].push_back({u,i});
    }

    tour(1);

    memset(lst_seen,-1,sizeof(lst_seen));

    //for(int i=1;i<=pnt;i++)cout<<outp[i]<<" ";cout<<endl;

    for(int i=1;i<=pnt;i++)
    {
        if(lst_seen[outp[i]]==-1)
        {
            add(outp[i]);
            continue;
        }

        vector<int> help={};
        int pos=i;

        while(current[pnt_current]!=outp[i])
        {
            printf("%i ",current[pnt_current]);
            lst_seen[current[pnt_current]]=-1;
            pnt_current--;
        }

        printf("%i",current[pnt_current]);
        lst_seen[current[pnt_current]]=-1;
        pnt_current--;

        printf("\n");

        add(outp[i]);
    }
    return 0;
}

Compilation message

postmen.cpp: In function 'void tour(int)':
postmen.cpp:18:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(;pointer[node]<adj[node].size();pointer[node]++)
          ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:65:13: warning: unused variable 'pos' [-Wunused-variable]
         int pos=i;
             ^~~
postmen.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
postmen.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&u,&v);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14080 KB Output is correct
2 Correct 11 ms 14080 KB Output is correct
3 Correct 12 ms 14080 KB Output is correct
4 Correct 13 ms 14208 KB Output is correct
5 Correct 12 ms 14080 KB Output is correct
6 Correct 13 ms 14336 KB Output is correct
7 Correct 20 ms 15232 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 50 ms 19960 KB Output is correct
10 Correct 13 ms 14208 KB Output is correct
11 Correct 13 ms 14208 KB Output is correct
12 Correct 56 ms 20356 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14080 KB Output is correct
2 Correct 11 ms 14080 KB Output is correct
3 Correct 11 ms 14080 KB Output is correct
4 Correct 13 ms 14208 KB Output is correct
5 Correct 12 ms 14080 KB Output is correct
6 Correct 15 ms 14336 KB Output is correct
7 Correct 18 ms 15104 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 52 ms 19960 KB Output is correct
10 Correct 14 ms 14208 KB Output is correct
11 Correct 13 ms 14208 KB Output is correct
12 Correct 55 ms 20344 KB Output is correct
13 Correct 75 ms 22136 KB Output is correct
14 Correct 72 ms 20088 KB Output is correct
15 Correct 66 ms 20972 KB Output is correct
16 Correct 78 ms 22136 KB Output is correct
17 Correct 74 ms 18424 KB Output is correct
18 Correct 73 ms 20732 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14080 KB Output is correct
2 Correct 12 ms 14080 KB Output is correct
3 Correct 12 ms 14080 KB Output is correct
4 Correct 13 ms 14208 KB Output is correct
5 Correct 12 ms 14080 KB Output is correct
6 Correct 13 ms 14336 KB Output is correct
7 Correct 18 ms 15104 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 51 ms 19960 KB Output is correct
10 Correct 13 ms 14208 KB Output is correct
11 Correct 13 ms 14208 KB Output is correct
12 Correct 57 ms 20344 KB Output is correct
13 Correct 73 ms 22136 KB Output is correct
14 Correct 81 ms 20088 KB Output is correct
15 Correct 66 ms 20976 KB Output is correct
16 Correct 74 ms 22136 KB Output is correct
17 Correct 74 ms 18552 KB Output is correct
18 Correct 70 ms 20728 KB Output is correct
19 Correct 469 ms 55156 KB Output is correct
20 Correct 447 ms 50988 KB Output is correct
21 Correct 408 ms 54108 KB Output is correct
22 Correct 469 ms 61816 KB Output is correct
23 Correct 216 ms 46584 KB Output is correct
24 Correct 499 ms 42416 KB Output is correct
25 Correct 473 ms 54264 KB Output is correct