답안 #998894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
998894	2024-06-14T19:23:13 Z	lucascgar	어르신 집배원 (BOI14_postmen)	C++17	100 / 100	238 ms	64192 KB

postmen

#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<double, double> pdd;

/*
desde quando vi da ultima vez até quando vejo de novo, deixo ele em ans sozinho
*/

const int MAXN = 5e5+10;

vector<pii> e[MAXN];
vector<int> ans;
bool ve[MAXN];
bool v[MAXN];


void dfs(int x){
    while (!e[x].empty()){
        pii u = e[x].back();
        e[x].pop_back();
        if (ve[u.second] == 1) continue;
        ve[u.second] = 1;

        dfs(u.first);
    }
    ans.push_back(x);

    if (!v[x]) v[x] = 1;
    else{
        ans.pop_back();
        cout << x;
        while (ans.back() != x){
            cout << " " << ans.back();
            v[ans.back()] = 0;
            ans.pop_back();
        }
        cout << "\n";
    }

}

int main(){
    std::ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    int a, b;

    for (int i=0;i<m;i++){
        cin >> a >> b;
        e[a].emplace_back(b, i);
        e[b].emplace_back(a, i);
    }

    dfs(1);

}

Subtask #1

38.0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	12120 KB	Output is correct
2	Correct	5 ms	12120 KB	Output is correct
3	Correct	4 ms	12120 KB	Output is correct
4	Correct	6 ms	12380 KB	Output is correct
5	Correct	5 ms	12120 KB	Output is correct
6	Correct	6 ms	12380 KB	Output is correct
7	Correct	7 ms	13404 KB	Output is correct
8	Correct	5 ms	12380 KB	Output is correct
9	Correct	24 ms	19872 KB	Output is correct
10	Correct	6 ms	12380 KB	Output is correct
11	Correct	5 ms	12380 KB	Output is correct
12	Correct	27 ms	20308 KB	Output is correct

Subtask #2

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	12124 KB	Output is correct
2	Correct	5 ms	12064 KB	Output is correct
3	Correct	5 ms	12188 KB	Output is correct
4	Correct	6 ms	12376 KB	Output is correct
5	Correct	5 ms	12180 KB	Output is correct
6	Correct	6 ms	12380 KB	Output is correct
7	Correct	12 ms	13660 KB	Output is correct
8	Correct	5 ms	12380 KB	Output is correct
9	Correct	25 ms	20052 KB	Output is correct
10	Correct	5 ms	12380 KB	Output is correct
11	Correct	6 ms	12376 KB	Output is correct
12	Correct	27 ms	20312 KB	Output is correct
13	Correct	38 ms	22476 KB	Output is correct
14	Correct	34 ms	19404 KB	Output is correct
15	Correct	35 ms	20932 KB	Output is correct
16	Correct	40 ms	22472 KB	Output is correct
17	Correct	34 ms	16976 KB	Output is correct
18	Correct	37 ms	20572 KB	Output is correct

Subtask #3

45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	12124 KB	Output is correct
2	Correct	4 ms	12124 KB	Output is correct
3	Correct	5 ms	12124 KB	Output is correct
4	Correct	7 ms	12376 KB	Output is correct
5	Correct	6 ms	12124 KB	Output is correct
6	Correct	6 ms	12380 KB	Output is correct
7	Correct	8 ms	13404 KB	Output is correct
8	Correct	5 ms	12380 KB	Output is correct
9	Correct	25 ms	20060 KB	Output is correct
10	Correct	6 ms	12380 KB	Output is correct
11	Correct	6 ms	12380 KB	Output is correct
12	Correct	29 ms	20304 KB	Output is correct
13	Correct	37 ms	22480 KB	Output is correct
14	Correct	36 ms	19408 KB	Output is correct
15	Correct	36 ms	20940 KB	Output is correct
16	Correct	37 ms	22484 KB	Output is correct
17	Correct	35 ms	17104 KB	Output is correct
18	Correct	36 ms	20564 KB	Output is correct
19	Correct	236 ms	64192 KB	Output is correct
20	Correct	198 ms	50116 KB	Output is correct
21	Correct	184 ms	57016 KB	Output is correct
22	Correct	238 ms	64192 KB	Output is correct
23	Correct	108 ms	50512 KB	Output is correct
24	Correct	208 ms	38220 KB	Output is correct
25	Correct	210 ms	55292 KB	Output is correct