oj.uz

답안 #895567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895567 2023-12-30T09:19:14 Z codefox 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 330 ms 71248 KB 
#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>

vector<vector<pii>> graph;
stack<int> s;
vector<bool> ins;

void dfs(int i)
{
    while (graph[i].size())
    {
        pii ele = graph[i].back();
        graph[i].pop_back();

        int r1 = ele.first;
        int r2 = ele.second;
        graph[r1][r2] = graph[r1].back();
        graph[graph[r1][r2].first][graph[r1][r2].second].second = r2;
        graph[r1].pop_back();

        dfs(r1);
    }

    s.push(i);
    if (ins[i])
    {
        do
        {
            ins[s.top()] = false;
            cout << s.top()+1 << " ";
            s.pop();
        }
        while (s.size() && s.top() != i);
        cout << "\n";
    }
    ins[i] = true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    graph = vector<vector<pii>>(n);
    ins = vector<bool>(n, 0);
    for (int i =0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        a--; b--;
        int sa = graph[a].size();
        int sb = graph[b].size();
        graph[a].push_back({b, sb});
        graph[b].push_back({a, sa});
    }
    dfs(0);
    return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 26 ms 9680 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 26 ms 10328 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 6 ms 1884 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 36 ms 9812 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 41 ms 10120 KB Output is correct
13 Correct 69 ms 14252 KB Output is correct
14 Correct 40 ms 10028 KB Output is correct
15 Correct 51 ms 12220 KB Output is correct
16 Correct 57 ms 14196 KB Output is correct
17 Correct 45 ms 6952 KB Output is correct
18 Correct 52 ms 11496 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 4 ms 1884 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 23 ms 9820 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 30 ms 10068 KB Output is correct
13 Correct 49 ms 14288 KB Output is correct
14 Correct 38 ms 10140 KB Output is correct
15 Correct 34 ms 12228 KB Output is correct
16 Correct 40 ms 14200 KB Output is correct
17 Correct 31 ms 7136 KB Output is correct
18 Correct 34 ms 11420 KB Output is correct
19 Correct 330 ms 71248 KB Output is correct
20 Correct 241 ms 50256 KB Output is correct
21 Correct 251 ms 60344 KB Output is correct
22 Correct 289 ms 71104 KB Output is correct
23 Correct 118 ms 46168 KB Output is correct
24 Correct 240 ms 33616 KB Output is correct
25 Correct 280 ms 57284 KB Output is correct