Submission #912985

# Submission time Handle Problem Language Result Execution time Memory
912985 2024-01-20T05:01:56 Z 1075508020060209tc Senior Postmen (BOI14_postmen) C++14
55 / 100
500 ms 66244 KB
#pragma GCC optimize("Ofast")
#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 id;
int ans[500005];
int asz;
void dfs(int nw){
for(;eit[nw]<e[nw].size();eit[nw]++){
    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]++){
      |      ~~~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 5 ms 14684 KB Output is correct
3 Correct 6 ms 14840 KB Output is correct
4 Correct 7 ms 14940 KB Output is correct
5 Correct 5 ms 14940 KB Output is correct
6 Correct 7 ms 14940 KB Output is correct
7 Correct 9 ms 15964 KB Output is correct
8 Correct 6 ms 14940 KB Output is correct
9 Correct 32 ms 21836 KB Output is correct
10 Correct 6 ms 14936 KB Output is correct
11 Correct 6 ms 14936 KB Output is correct
12 Correct 35 ms 22096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 14680 KB Output is correct
2 Correct 6 ms 14832 KB Output is correct
3 Correct 6 ms 14828 KB Output is correct
4 Correct 6 ms 14928 KB Output is correct
5 Correct 6 ms 15096 KB Output is correct
6 Correct 8 ms 15160 KB Output is correct
7 Correct 10 ms 16024 KB Output is correct
8 Correct 7 ms 14936 KB Output is correct
9 Correct 31 ms 21672 KB Output is correct
10 Correct 7 ms 14940 KB Output is correct
11 Correct 8 ms 14936 KB Output is correct
12 Correct 33 ms 22284 KB Output is correct
13 Correct 61 ms 25080 KB Output is correct
14 Correct 48 ms 21512 KB Output is correct
15 Correct 49 ms 23756 KB Output is correct
16 Correct 57 ms 25072 KB Output is correct
17 Correct 61 ms 19492 KB Output is correct
18 Correct 51 ms 22808 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 5 ms 14936 KB Output is correct
3 Correct 6 ms 14940 KB Output is correct
4 Correct 7 ms 14940 KB Output is correct
5 Correct 6 ms 14940 KB Output is correct
6 Correct 6 ms 15032 KB Output is correct
7 Correct 11 ms 15964 KB Output is correct
8 Correct 6 ms 14940 KB Output is correct
9 Correct 36 ms 21648 KB Output is correct
10 Correct 7 ms 14940 KB Output is correct
11 Correct 6 ms 15072 KB Output is correct
12 Correct 39 ms 22100 KB Output is correct
13 Correct 78 ms 25016 KB Output is correct
14 Correct 68 ms 21520 KB Output is correct
15 Correct 60 ms 23528 KB Output is correct
16 Correct 69 ms 24896 KB Output is correct
17 Correct 77 ms 19596 KB Output is correct
18 Correct 50 ms 22640 KB Output is correct
19 Execution timed out 594 ms 66244 KB Time limit exceeded
20 Halted 0 ms 0 KB -