oj.uz

답안 #861254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861254 2023-10-15T17:48:43 Z qwusha 어르신 집배원 (BOI14_postmen) C++17
55 / 100
 500 ms 109688 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
#define fi first
#define se second
typedef long double ld;
const ll inf = 1e9;
const ld eps = 1e-8;
vector<multiset<int>> g;
vector<vector<int>> ans;
vector<bool> used;
vector<int> cur;
set<int> stcur;
vector<int> res;

void dfs(int v) {
    if (stcur.find(v) != stcur.end()) {
        res.clear();
        while(cur.back() != v) {
            stcur.erase(cur.back());
            res.push_back(cur.back());
            cur.pop_back();
        }
        stcur.erase(cur.back());
        res.push_back(cur.back());
        cur.pop_back();
        ans.push_back(res);
    }
    if (v == 4) {
        int x = 1;
    }
    while (!g[v].empty()) {
        cur.push_back(v);
        stcur.insert(v);
        auto t = g[v].begin();
        int u = *t;
        g[v].erase(t);
        g[u].erase(g[u].find(v));
        dfs(u);
    }
}



signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    used.resize(n);
    g.resize(n);
    for (int i = 0; i < m; i++) {
        int v, u;
        cin >> v >> u;
        g[v - 1].insert(u - 1);
        g[u - 1].insert(v - 1);
    }
    dfs(0);
    for (auto s : ans) {
        for (auto el : s) {
            cout << el + 1 << ' ';
        }
        cout << '\n';
    }
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:32:13: warning: unused variable 'x' [-Wunused-variable]
   32 |         int x = 1;
      |             ^

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 12 ms 3020 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 88 ms 16960 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 78 ms 17300 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 0 ms 600 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 11 ms 2908 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 82 ms 17096 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 93 ms 17256 KB Output is correct
13 Correct 65 ms 22096 KB Output is correct
14 Correct 81 ms 21068 KB Output is correct
15 Correct 68 ms 20680 KB Output is correct
16 Correct 94 ms 22100 KB Output is correct
17 Correct 80 ms 20792 KB Output is correct
18 Correct 71 ms 16364 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 11 ms 2908 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 90 ms 17316 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 82 ms 17216 KB Output is correct
13 Correct 84 ms 22232 KB Output is correct
14 Correct 66 ms 21068 KB Output is correct
15 Correct 68 ms 20680 KB Output is correct
16 Correct 64 ms 22096 KB Output is correct
17 Correct 67 ms 20684 KB Output is correct
18 Correct 53 ms 16360 KB Output is correct
19 Execution timed out 545 ms 109688 KB Time limit exceeded
20 Halted 0 ms 0 KB -