oj.uz

답안 #499800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499800 2021-12-29T13:11:23 Z Lobo 어르신 집배원 (BOI14_postmen) C++17
100 / 100
 426 ms 83928 KB 
#include<bits/stdc++.h>
using namespace std;
 
/*for ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
*/
 
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
#define maxn 550000
 
ii n, m, blk[maxn], nx[maxn], mark[maxn];
vector<pair<ii,ii>> g[maxn];
 
void dfs(ii u) {
    if(mark[u]) {
        ii v = u;
        cout << v << " ";
        mark[v] = 0;
        v = nx[v];
        while(v != u) {
            cout << v << " ";
            mark[v] = 0;
            v = nx[v];
        }
        cout << endl;
    }

    mark[u] = 1;

    while(g[u].size()) {
        ii v = g[u].back().fr;
        ii id = g[u].back().sc;
        g[u].pop_back();
 
        if(blk[id]) continue;
 
        blk[id] = 1;
        nx[u] = v;
        mark[u] = 1;
        // cout << u << " -> " << v << endl;
        dfs(v);
    }
}

void solve() {
    cin >> n >> m;
 
    for(ii i = 1; i <= m; i++) {
        ii u, v; cin >> u >> v;
 
        g[u].pb(mp(v,i));
        g[v].pb(mp(u,i));
    }

    // for(ii i = 1; i <= n; i++) reverse(all(g[i]));
 
    dfs(1);
    
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
 
    ii tt = 1;
    // cin >> tt;
    while(tt--) solve();
 
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 13132 KB Output is correct
2 Correct 7 ms 13132 KB Output is correct
3 Correct 7 ms 13236 KB Output is correct
4 Correct 8 ms 13632 KB Output is correct
5 Correct 10 ms 13388 KB Output is correct
6 Correct 8 ms 13756 KB Output is correct
7 Correct 12 ms 15024 KB Output is correct
8 Correct 7 ms 13504 KB Output is correct
9 Correct 34 ms 24504 KB Output is correct
10 Correct 7 ms 13388 KB Output is correct
11 Correct 8 ms 13488 KB Output is correct
12 Correct 39 ms 25020 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 13132 KB Output is correct
2 Correct 7 ms 13132 KB Output is correct
3 Correct 7 ms 13132 KB Output is correct
4 Correct 8 ms 13516 KB Output is correct
5 Correct 8 ms 13324 KB Output is correct
6 Correct 8 ms 13772 KB Output is correct
7 Correct 13 ms 15048 KB Output is correct
8 Correct 8 ms 13516 KB Output is correct
9 Correct 36 ms 24452 KB Output is correct
10 Correct 8 ms 13508 KB Output is correct
11 Correct 8 ms 13540 KB Output is correct
12 Correct 44 ms 25024 KB Output is correct
13 Correct 74 ms 27024 KB Output is correct
14 Correct 59 ms 22724 KB Output is correct
15 Correct 50 ms 25884 KB Output is correct
16 Correct 66 ms 27104 KB Output is correct
17 Correct 62 ms 19224 KB Output is correct
18 Correct 59 ms 24772 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 13260 KB Output is correct
2 Correct 7 ms 13236 KB Output is correct
3 Correct 7 ms 13236 KB Output is correct
4 Correct 8 ms 13516 KB Output is correct
5 Correct 7 ms 13360 KB Output is correct
6 Correct 9 ms 13768 KB Output is correct
7 Correct 11 ms 15052 KB Output is correct
8 Correct 8 ms 13508 KB Output is correct
9 Correct 38 ms 24556 KB Output is correct
10 Correct 8 ms 13504 KB Output is correct
11 Correct 10 ms 13464 KB Output is correct
12 Correct 40 ms 25036 KB Output is correct
13 Correct 56 ms 27072 KB Output is correct
14 Correct 59 ms 22692 KB Output is correct
15 Correct 56 ms 25912 KB Output is correct
16 Correct 59 ms 27076 KB Output is correct
17 Correct 53 ms 19260 KB Output is correct
18 Correct 57 ms 24612 KB Output is correct
19 Correct 386 ms 83916 KB Output is correct
20 Correct 366 ms 62032 KB Output is correct
21 Correct 326 ms 77620 KB Output is correct
22 Correct 402 ms 83928 KB Output is correct
23 Correct 157 ms 68796 KB Output is correct
24 Correct 389 ms 44688 KB Output is correct
25 Correct 426 ms 71588 KB Output is correct