oj.uz

Submission #912904

# Submission time Handle Problem Language Result Execution time Memory
912904 2024-01-20T04:23:58 Z 1075508020060209tc Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 73248 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];
int br[500005];
vector<int>e[500005];
int eit[500005];
bool vis[500005];
bool visv[500005];
//vector<int>ans;
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;
}
vector<vector<int>>fans;
int stk[510005];
signed main(){
//cin.tie(0);
//ios_base::sync_with_stdio(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
//    cin>>ar[i]>>br[i];
    scanf("%d",&ar[i]);
    scanf("%d",&br[i]);
    e[ar[i]].push_back(i);
    e[br[i]].push_back(i);
    ar[i]^=br[i];
}
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]);
            if(stk[ssz-1]==v){printf("\n");break;}
            visv[stk[ssz-1]]=0;
            //stk.pop();
            ssz--;
        }
//        fans.push_back(vc);
    }else{
        visv[v]=1;
        stk[ssz++]=v;
    }
}return 0;
for(int i=0;i<fans.size();i++){
    for(int j=0;j<fans[i].size();j++){
        cout<<fans[i][j]<<" ";
    }cout<<"\n";
}


}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:20:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | for(;eit[nw]<e[nw].size();eit[nw]++){
      |      ~~~~~~~^~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:64:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 | for(int i=0;i<fans.size();i++){
      |             ~^~~~~~~~~~~~
postmen.cpp:65:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int j=0;j<fans[i].size();j++){
      |                 ~^~~~~~~~~~~~~~~
postmen.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scanf("%d",&ar[i]);
      |     ~~~~~^~~~~~~~~~~~~
postmen.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d",&br[i]);
      |     ~~~~~^~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16728 KB Output is correct
2 Correct 5 ms 16728 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 6 ms 17004 KB Output is correct
5 Correct 5 ms 16732 KB Output is correct
6 Correct 6 ms 16984 KB Output is correct
7 Correct 11 ms 18012 KB Output is correct
8 Correct 5 ms 16984 KB Output is correct
9 Correct 39 ms 26712 KB Output is correct
10 Correct 5 ms 16984 KB Output is correct
11 Correct 6 ms 16984 KB Output is correct
12 Correct 38 ms 26964 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 6 ms 16984 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 5 ms 16988 KB Output is correct
7 Correct 11 ms 18008 KB Output is correct
8 Correct 5 ms 16984 KB Output is correct
9 Correct 40 ms 26724 KB Output is correct
10 Correct 7 ms 16988 KB Output is correct
11 Correct 7 ms 16984 KB Output is correct
12 Correct 41 ms 26968 KB Output is correct
13 Correct 56 ms 29804 KB Output is correct
14 Correct 70 ms 25684 KB Output is correct
15 Correct 54 ms 28472 KB Output is correct
16 Correct 75 ms 29780 KB Output is correct
17 Correct 51 ms 23056 KB Output is correct
18 Correct 65 ms 27348 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16836 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 4 ms 16740 KB Output is correct
4 Correct 6 ms 16988 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 7 ms 17240 KB Output is correct
7 Correct 13 ms 18012 KB Output is correct
8 Correct 7 ms 17096 KB Output is correct
9 Correct 35 ms 26704 KB Output is correct
10 Correct 6 ms 16984 KB Output is correct
11 Correct 5 ms 16984 KB Output is correct
12 Correct 38 ms 27016 KB Output is correct
13 Correct 86 ms 30024 KB Output is correct
14 Correct 48 ms 25680 KB Output is correct
15 Correct 69 ms 28452 KB Output is correct
16 Correct 49 ms 29716 KB Output is correct
17 Correct 58 ms 23124 KB Output is correct
18 Correct 50 ms 27224 KB Output is correct
19 Correct 476 ms 73248 KB Output is correct
20 Execution timed out 521 ms 60108 KB Time limit exceeded
21 Halted 0 ms 0 KB -