답안 #912946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912946 2024-01-20T04:39:53 Z 1075508020060209tc 어르신 집배원 (BOI14_postmen) C++14
55 / 100
500 ms 62640 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]++){
      |      ~~~~~~~^~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14680 KB Output is correct
2 Correct 5 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 7 ms 14936 KB Output is correct
5 Correct 6 ms 14836 KB Output is correct
6 Correct 7 ms 15160 KB Output is correct
7 Correct 9 ms 15708 KB Output is correct
8 Correct 7 ms 14940 KB Output is correct
9 Correct 29 ms 21272 KB Output is correct
10 Correct 7 ms 14988 KB Output is correct
11 Correct 7 ms 14940 KB Output is correct
12 Correct 33 ms 21316 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14680 KB Output is correct
2 Correct 5 ms 14684 KB Output is correct
3 Correct 5 ms 14684 KB Output is correct
4 Correct 6 ms 14940 KB Output is correct
5 Correct 6 ms 14936 KB Output is correct
6 Correct 7 ms 14940 KB Output is correct
7 Correct 9 ms 15708 KB Output is correct
8 Correct 7 ms 15040 KB Output is correct
9 Correct 29 ms 21056 KB Output is correct
10 Correct 6 ms 14940 KB Output is correct
11 Correct 7 ms 14940 KB Output is correct
12 Correct 30 ms 21336 KB Output is correct
13 Correct 47 ms 24136 KB Output is correct
14 Correct 47 ms 20964 KB Output is correct
15 Correct 42 ms 22984 KB Output is correct
16 Correct 72 ms 24144 KB Output is correct
17 Correct 55 ms 18772 KB Output is correct
18 Correct 40 ms 21804 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 5 ms 14680 KB Output is correct
3 Correct 5 ms 14680 KB Output is correct
4 Correct 7 ms 14936 KB Output is correct
5 Correct 5 ms 14680 KB Output is correct
6 Correct 6 ms 15036 KB Output is correct
7 Correct 9 ms 15708 KB Output is correct
8 Correct 6 ms 14936 KB Output is correct
9 Correct 39 ms 21076 KB Output is correct
10 Correct 6 ms 14940 KB Output is correct
11 Correct 6 ms 15048 KB Output is correct
12 Correct 40 ms 21536 KB Output is correct
13 Correct 56 ms 24116 KB Output is correct
14 Correct 41 ms 20936 KB Output is correct
15 Correct 40 ms 22876 KB Output is correct
16 Correct 62 ms 24216 KB Output is correct
17 Correct 37 ms 18768 KB Output is correct
18 Correct 39 ms 21840 KB Output is correct
19 Correct 480 ms 62540 KB Output is correct
20 Correct 377 ms 45748 KB Output is correct
21 Correct 422 ms 55756 KB Output is correct
22 Correct 431 ms 62640 KB Output is correct
23 Correct 162 ms 47580 KB Output is correct
24 Execution timed out 513 ms 35004 KB Time limit exceeded
25 Halted 0 ms 0 KB -