oj.uz

답안 #912947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912947 2024-01-20T04:40:33 Z 1075508020060209tc 어르신 집배원 (BOI14_postmen) C++11
55 / 100
 500 ms 62548 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()

int n;int m;
int ar[500005];

vector<int>e[500005];
int eit[500005];
//bool vis[500005];
//bool visv[500005];
bitset<500005>vis;
bitset<500005>visv;

int ans[500005];
int asz;
void dfs(int nw){
for(;eit[nw]<e[nw].size();eit[nw]++){
    int id=e[nw][eit[nw]];
    if(vis[id]){continue;}
    vis[id]=1;
    int v=ar[id]^nw;
    dfs(v);
}
ans[asz++]=nw;
}

int stk[500005];
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
    int b;
    cin>>ar[i]>>b;
 //   scanf("%d",&ar[i]);
   // scanf("%d",&br[i]);
    e[ar[i]].push_back(i);
    e[b].push_back(i);
    ar[i]^=b;
}
dfs(1);
int ssz=0;
//stack<int>stk;
for(int i=0;i<asz;i++){
    //vector<int>vc;
    int v=ans[i];
    if(visv[v]){
        while(1){
  //          vc.push_back(stk.back());
            //printf("%d ",stk[ssz-1]);
            cout<<stk[ssz-1];
            if(stk[ssz-1]==v){cout<<'\n';break;}else{
                cout<<' ';
            }

            visv[stk[ssz-1]]=0;
            //stk.pop();
            ssz--;
        }
//        fans.push_back(vc);
    }else{
        visv[v]=1;
        stk[ssz++]=v;
    }
}return 0;

}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:22:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 | for(;eit[nw]<e[nw].size();eit[nw]++){
      |      ~~~~~~~^~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 5 ms 14684 KB Output is correct
3 Correct 5 ms 14684 KB Output is correct
4 Correct 5 ms 14940 KB Output is correct
5 Correct 5 ms 14684 KB Output is correct
6 Correct 6 ms 14940 KB Output is correct
7 Correct 10 ms 15708 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 29 ms 21080 KB Output is correct
10 Correct 6 ms 14936 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 31 ms 21340 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14680 KB Output is correct
2 Correct 6 ms 14684 KB Output is correct
3 Correct 5 ms 14684 KB Output is correct
4 Correct 6 ms 14936 KB Output is correct
5 Correct 5 ms 14680 KB Output is correct
6 Correct 8 ms 15096 KB Output is correct
7 Correct 9 ms 15708 KB Output is correct
8 Correct 7 ms 14980 KB Output is correct
9 Correct 30 ms 21268 KB Output is correct
10 Correct 7 ms 14956 KB Output is correct
11 Correct 6 ms 14940 KB Output is correct
12 Correct 40 ms 21340 KB Output is correct
13 Correct 75 ms 24064 KB Output is correct
14 Correct 52 ms 20972 KB Output is correct
15 Correct 46 ms 22804 KB Output is correct
16 Correct 59 ms 24060 KB Output is correct
17 Correct 56 ms 18732 KB Output is correct
18 Correct 59 ms 21840 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14680 KB Output is correct
2 Correct 6 ms 14680 KB Output is correct
3 Correct 5 ms 14684 KB Output is correct
4 Correct 6 ms 14940 KB Output is correct
5 Correct 5 ms 14680 KB Output is correct
6 Correct 7 ms 14936 KB Output is correct
7 Correct 8 ms 15708 KB Output is correct
8 Correct 6 ms 15196 KB Output is correct
9 Correct 31 ms 21196 KB Output is correct
10 Correct 7 ms 15092 KB Output is correct
11 Correct 8 ms 14936 KB Output is correct
12 Correct 30 ms 21516 KB Output is correct
13 Correct 66 ms 24092 KB Output is correct
14 Correct 56 ms 20724 KB Output is correct
15 Correct 59 ms 22956 KB Output is correct
16 Correct 65 ms 24052 KB Output is correct
17 Correct 46 ms 18880 KB Output is correct
18 Correct 46 ms 21872 KB Output is correct
19 Execution timed out 520 ms 62548 KB Time limit exceeded
20 Halted 0 ms 0 KB -