Submission #636294

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
636294	2022-08-28T20:45:28 Z	tvladm2009	Senior Postmen (BOI14_postmen)	C++14	100 / 100	436 ms	77968 KB

postmen

#include <iostream>
#include <vector>

using namespace std;

const int MAX_N = 5 * 1e5;
int in[MAX_N + 1], out[MAX_N + 1];
vector<int> g[MAX_N + 1], aux;
bool viz[MAX_N + 1], b[MAX_N + 1];
int n, m;

void dfs(int u) {
	while(g[u].size()) {
		int e=g[u].back();
		g[u].pop_back();
		if(viz[e])
			continue;
		viz[e]=1;
		dfs(in[e]^out[e]^u);
		aux.push_back(u);
	}
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> in[i] >> out[i];
        in[i]--;
        out[i]--;
        g[in[i]].push_back(i);
        g[out[i]].push_back(i);
    }
    aux.push_back(0);
    dfs(0);
    vector<int> sol;
    for (int it : aux) {
        if (b[it] == true) {
            while (b[it] == true) {
                cout << sol.back() + 1 << " ";
                b[sol.back()] = false;
                sol.pop_back();
            }
            cout << "\n";
        }
        b[it] = true;
        sol.push_back(it);
    }
    return 0;
}

Subtask #1

38.0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	11988 KB	Output is correct
2	Correct	6 ms	11988 KB	Output is correct
3	Correct	6 ms	11988 KB	Output is correct
4	Correct	8 ms	12356 KB	Output is correct
5	Correct	8 ms	12116 KB	Output is correct
6	Correct	9 ms	12500 KB	Output is correct
7	Correct	11 ms	13572 KB	Output is correct
8	Correct	7 ms	12308 KB	Output is correct
9	Correct	38 ms	21112 KB	Output is correct
10	Correct	8 ms	12244 KB	Output is correct
11	Correct	8 ms	12244 KB	Output is correct
12	Correct	48 ms	21272 KB	Output is correct

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	11988 KB	Output is correct
2	Correct	7 ms	11988 KB	Output is correct
3	Correct	6 ms	11988 KB	Output is correct
4	Correct	7 ms	12372 KB	Output is correct
5	Correct	7 ms	12116 KB	Output is correct
6	Correct	8 ms	12500 KB	Output is correct
7	Correct	11 ms	13524 KB	Output is correct
8	Correct	9 ms	12328 KB	Output is correct
9	Correct	37 ms	21036 KB	Output is correct
10	Correct	8 ms	12244 KB	Output is correct
11	Correct	9 ms	12256 KB	Output is correct
12	Correct	42 ms	21328 KB	Output is correct
13	Correct	80 ms	23912 KB	Output is correct
14	Correct	48 ms	19872 KB	Output is correct
15	Correct	56 ms	22592 KB	Output is correct
16	Correct	55 ms	25100 KB	Output is correct
17	Correct	50 ms	17972 KB	Output is correct
18	Correct	55 ms	22380 KB	Output is correct

Subtask #3

45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	12096 KB	Output is correct
2	Correct	6 ms	11988 KB	Output is correct
3	Correct	8 ms	11988 KB	Output is correct
4	Correct	8 ms	12372 KB	Output is correct
5	Correct	6 ms	12136 KB	Output is correct
6	Correct	8 ms	12500 KB	Output is correct
7	Correct	10 ms	13476 KB	Output is correct
8	Correct	8 ms	12244 KB	Output is correct
9	Correct	34 ms	21092 KB	Output is correct
10	Correct	7 ms	12244 KB	Output is correct
11	Correct	7 ms	12244 KB	Output is correct
12	Correct	38 ms	21316 KB	Output is correct
13	Correct	81 ms	23856 KB	Output is correct
14	Correct	47 ms	19908 KB	Output is correct
15	Correct	63 ms	22580 KB	Output is correct
16	Correct	56 ms	25032 KB	Output is correct
17	Correct	58 ms	18052 KB	Output is correct
18	Correct	58 ms	22320 KB	Output is correct
19	Correct	410 ms	77944 KB	Output is correct
20	Correct	359 ms	58132 KB	Output is correct
21	Correct	357 ms	69588 KB	Output is correct
22	Correct	421 ms	77968 KB	Output is correct
23	Correct	163 ms	59976 KB	Output is correct
24	Correct	436 ms	42732 KB	Output is correct
25	Correct	423 ms	64724 KB	Output is correct