oj.uz

답안 #240495

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240495 2020-06-19T17:27:12 Z karma 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 487 ms 44792 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = int(5e5) + 10;
typedef pair<int, int> pii;

struct TEdge {
    int u, v;
    bool del;
} e[N];
int n, m, vis[N], ss[N], st[N], cnts, cntt;
int path[N], cp, u, id;
vector<vector<int>> adj;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> m; adj.resize(n + 1);
    for(int i = 1; i <= m; ++i) {
        cin >> e[i].u >> e[i].v;
        adj[e[i].u].pb(i);
        adj[e[i].v].pb(i);
    }
    path[++cp] = 1;
    do {
        u = path[cp];
        while(adj[u].size() && e[adj[u].back()].del) adj[u].pop_back();
        if(adj[u].size()) {
            id = adj[u].back();
            adj[u].pop_back();
            e[id].del = 1;
            path[++cp] = e[id].u ^ e[id].v ^ u;
        } else {
            st[++cntt] = u;
            --cp;
        }
    } while(cp > 0);
    while(cntt) {
        u = st[cntt];
        if(vis[u]) {
            while(1) {
                vis[ss[cnts]] = 0;
                cout << ss[cnts] << ' ';
                if(ss[cnts --] == u) break;
            }
            cout << '\n';
        }
        vis[u] = 1;
        ss[++cnts] = u;
        --cntt;
    }
}

Compilation message

postmen.cpp: In function 'int32_t main()':
postmen.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
postmen.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 33 ms 3712 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 39 ms 3960 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 34 ms 3708 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 39 ms 3960 KB Output is correct
13 Correct 65 ms 9212 KB Output is correct
14 Correct 91 ms 7416 KB Output is correct
15 Correct 62 ms 7024 KB Output is correct
16 Correct 63 ms 9208 KB Output is correct
17 Correct 61 ms 6648 KB Output is correct
18 Correct 65 ms 7416 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 11 ms 1024 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 33 ms 3704 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 38 ms 3960 KB Output is correct
13 Correct 64 ms 9208 KB Output is correct
14 Correct 59 ms 7416 KB Output is correct
15 Correct 61 ms 7160 KB Output is correct
16 Correct 63 ms 9208 KB Output is correct
17 Correct 64 ms 6648 KB Output is correct
18 Correct 67 ms 7416 KB Output is correct
19 Correct 477 ms 44792 KB Output is correct
20 Correct 441 ms 35780 KB Output is correct
21 Correct 467 ms 33896 KB Output is correct
22 Correct 481 ms 44792 KB Output is correct
23 Correct 150 ms 16504 KB Output is correct
24 Correct 486 ms 32504 KB Output is correct
25 Correct 487 ms 41976 KB Output is correct