oj.uz

답안 #261217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261217 2020-08-11T14:49:12 Z eohomegrownapps 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 93180 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> eulertour;
vector<set<int>> adjlist;

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);
    }
    eulertour.push_back(node);
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n,m;
    cin>>n>>m;
    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);
    stack<int> proc;
    vector<bool> visited(n);
    for (int i : eulertour){
        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);
        }
    }
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 20 ms 2304 KB Output is correct
8 Correct 2 ms 708 KB Output is correct
9 Correct 194 ms 13656 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 154 ms 13816 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 16 ms 2432 KB Output is correct
8 Correct 2 ms 708 KB Output is correct
9 Correct 224 ms 13560 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 155 ms 13816 KB Output is correct
13 Correct 121 ms 18684 KB Output is correct
14 Correct 132 ms 17528 KB Output is correct
15 Correct 131 ms 16888 KB Output is correct
16 Correct 122 ms 18680 KB Output is correct
17 Correct 139 ms 17144 KB Output is correct
18 Correct 127 ms 16372 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 15 ms 2304 KB Output is correct
8 Correct 2 ms 708 KB Output is correct
9 Correct 201 ms 13560 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 187 ms 13944 KB Output is correct
13 Correct 137 ms 18680 KB Output is correct
14 Correct 152 ms 17528 KB Output is correct
15 Correct 144 ms 16888 KB Output is correct
16 Correct 124 ms 18680 KB Output is correct
17 Correct 188 ms 17144 KB Output is correct
18 Correct 139 ms 16244 KB Output is correct
19 Execution timed out 715 ms 93180 KB Time limit exceeded
20 Halted 0 ms 0 KB -