oj.uz

Submission #261224

# Submission time Handle Problem Language Result Execution time Memory
261224 2020-08-11T14:54:39 Z eohomegrownapps Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 110456 KB 
#include <bits/stdc++.h>
using namespace std;

stack<int> proc;
bool visited[500000];
unordered_set<int> adjlist[500000];

inline void deleteEdge(int a, int b){
    adjlist[a].erase(b);
    adjlist[b].erase(a);
}
void tour(int node){
    while (adjlist[node].size()>0){
        int newnode = *adjlist[node].begin();
        deleteEdge(node, newnode);
        tour(newnode);
    }
    int i = node;
    if (visited[i]){
        cout<<i+1<<' ';
        while (proc.size()>0&&proc.top()!=i){
            cout<<proc.top()+1<<' ';
            visited[proc.top()]=false;
            proc.pop();
        }
        cout<<'\n';
    } else {
        visited[i]=true;
        proc.push(i);
    }
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n,m;
    cin>>n>>m;
    for (int i = 0; i<n; i++){
        visited[i]=0;
    }
    //adjlist.resize(n);
    for (int i = 0; i<m; i++){
        int a,b;
        cin>>a>>b;
        a--;b--;
        adjlist[a].insert(b);
        adjlist[b].insert(a);
    }
    tour(0);
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 27776 KB Output is correct
2 Correct 23 ms 27776 KB Output is correct
3 Correct 23 ms 27776 KB Output is correct
4 Correct 27 ms 28288 KB Output is correct
5 Correct 24 ms 27904 KB Output is correct
6 Correct 26 ms 28416 KB Output is correct
7 Correct 43 ms 30072 KB Output is correct
8 Correct 28 ms 28032 KB Output is correct
9 Correct 159 ms 43388 KB Output is correct
10 Correct 26 ms 28032 KB Output is correct
11 Correct 26 ms 28160 KB Output is correct
12 Correct 148 ms 43656 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 27776 KB Output is correct
2 Correct 25 ms 27776 KB Output is correct
3 Correct 23 ms 27776 KB Output is correct
4 Correct 26 ms 28280 KB Output is correct
5 Correct 24 ms 27896 KB Output is correct
6 Correct 27 ms 28408 KB Output is correct
7 Correct 35 ms 29944 KB Output is correct
8 Correct 25 ms 28032 KB Output is correct
9 Correct 137 ms 43384 KB Output is correct
10 Correct 26 ms 28032 KB Output is correct
11 Correct 27 ms 28160 KB Output is correct
12 Correct 153 ms 43640 KB Output is correct
13 Correct 182 ms 44408 KB Output is correct
14 Correct 180 ms 41336 KB Output is correct
15 Correct 159 ms 44040 KB Output is correct
16 Correct 186 ms 44408 KB Output is correct
17 Correct 173 ms 38648 KB Output is correct
18 Correct 218 ms 43512 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 27776 KB Output is correct
2 Correct 23 ms 27680 KB Output is correct
3 Correct 23 ms 27776 KB Output is correct
4 Correct 26 ms 28288 KB Output is correct
5 Correct 25 ms 27904 KB Output is correct
6 Correct 27 ms 28416 KB Output is correct
7 Correct 35 ms 30080 KB Output is correct
8 Correct 27 ms 28032 KB Output is correct
9 Correct 159 ms 43284 KB Output is correct
10 Correct 27 ms 28032 KB Output is correct
11 Correct 27 ms 28136 KB Output is correct
12 Correct 175 ms 43664 KB Output is correct
13 Correct 188 ms 44536 KB Output is correct
14 Correct 189 ms 41452 KB Output is correct
15 Correct 186 ms 44040 KB Output is correct
16 Correct 185 ms 44408 KB Output is correct
17 Correct 176 ms 38648 KB Output is correct
18 Correct 190 ms 43524 KB Output is correct
19 Execution timed out 1010 ms 110456 KB Time limit exceeded
20 Halted 0 ms 0 KB -