oj.uz

Submission #861258

# Submission time Handle Problem Language Result Execution time Memory
861258 2023-10-15T18:01:40 Z qwusha Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 113096 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma gcc optimize("Ofast")
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;
vector<int> stcur;
vector<int> res;

void dfs(int v) {
    if (stcur[v] > 0) {
        res.clear();
        while(cur.back() != v) {
            stcur[cur.back()]--;
            res.push_back(cur.back());
            cur.pop_back();
        }
        stcur[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[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);
    }
    stcur.resize(n);
    dfs(0);
    for (auto s : ans) {
        for (auto el : s) {
            cout << el + 1 << ' ';
        }
        cout << '\n';
    }
}

Compilation message

postmen.cpp:4: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    4 | #pragma gcc optimize("Ofast")
      | 
postmen.cpp: In function 'void dfs(int)':
postmen.cpp:33:13: warning: unused variable 'x' [-Wunused-variable]
   33 |         int x = 1;
      |             ^

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory 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 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 10 ms 2980 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 79 ms 17616 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 920 KB Output is correct
12 Correct 76 ms 17944 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory 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 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 10 ms 2908 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 82 ms 17616 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 72 ms 17960 KB Output is correct
13 Correct 49 ms 22988 KB Output is correct
14 Correct 66 ms 22096 KB Output is correct
15 Correct 65 ms 21704 KB Output is correct
16 Correct 61 ms 23288 KB Output is correct
17 Correct 61 ms 21708 KB Output is correct
18 Correct 50 ms 17532 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 3 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 9 ms 2908 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 84 ms 17456 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 74 ms 18116 KB Output is correct
13 Correct 51 ms 22988 KB Output is correct
14 Correct 59 ms 22096 KB Output is correct
15 Correct 64 ms 21652 KB Output is correct
16 Correct 47 ms 23040 KB Output is correct
17 Correct 97 ms 21596 KB Output is correct
18 Correct 49 ms 17636 KB Output is correct
19 Correct 420 ms 113096 KB Output is correct
20 Execution timed out 544 ms 112736 KB Time limit exceeded
21 Halted 0 ms 0 KB -