oj.uz

Submission #88748

# Submission time Handle Problem Language Result Execution time Memory
88748 2018-12-08T11:49:47 Z popovicirobert Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 55776 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

const int MAXBUF = (1 << 17);

char buf[MAXBUF];
int pbuf = MAXBUF;

inline int getnr() {
    char ch = fgetc(stdin);
    while(!isdigit(ch)) {
        ch = fgetc(stdin);
    }
    int nr = 0;
    while(isdigit(ch)) {
        nr = nr * 10 + ch - '0';
        ch = fgetc(stdin);
    }
    return nr;
}

const int MAXN = (int) 5e5;

vector <int> g[MAXN + 1];
pair <int, int> edges[MAXN + 1];
bool vis[MAXN + 1], vis1[MAXN + 1];
vector <int> ord;

void dfs(int nod) {
    while(g[nod].size()) {
        auto it = g[nod].back();
        g[nod].pop_back();
        if(vis[it] == 0) {
            vis[it] = 1;
            dfs(edges[it].first ^ edges[it].second ^ nod);
        }
    }
    ord.push_back(nod);
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n, m;
    //ios::sync_with_stdio(false);
    //cin.tie(0), cout.tie(0);
    n = getnr();
    m = getnr();
    for(i = 1; i <= m; i++) {
        int x, y;
        x = getnr();
        y = getnr();
        edges[i] = {x, y};
        g[x].push_back(i);
        g[y].push_back(i);
    }
    dfs(1);
    int sz = ord.size();
    vector <int> stk;
    for(i = 0; i < sz; i++) {
        if(vis1[ord[i]] == 0) {
            vis1[ord[i]] = 1;
            stk.push_back(ord[i]);
        }
        else {
            while(stk.back() != ord[i]) {
                printf("%d " ,stk.back());
                vis1[stk.back()] = 0;
                stk.pop_back();
            }
            printf("%d\n" ,ord[i]);
        }
    }
    //cout << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:50:12: warning: variable 'n' set but not used [-Wunused-but-set-variable]
     int i, n, m;
            ^

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12160 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 14 ms 12160 KB Output is correct
4 Correct 13 ms 12416 KB Output is correct
5 Correct 15 ms 12208 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 17 ms 13056 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 39 ms 18032 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 47 ms 18144 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 42 ms 18020 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 47 ms 18180 KB Output is correct
13 Correct 86 ms 20852 KB Output is correct
14 Correct 64 ms 18468 KB Output is correct
15 Correct 78 ms 19516 KB Output is correct
16 Correct 83 ms 20852 KB Output is correct
17 Correct 74 ms 16624 KB Output is correct
18 Correct 74 ms 18948 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 21 ms 13056 KB Output is correct
8 Correct 17 ms 12288 KB Output is correct
9 Correct 50 ms 17976 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 53 ms 18164 KB Output is correct
13 Correct 80 ms 20828 KB Output is correct
14 Correct 73 ms 18380 KB Output is correct
15 Correct 78 ms 19436 KB Output is correct
16 Correct 88 ms 20828 KB Output is correct
17 Correct 76 ms 16692 KB Output is correct
18 Correct 80 ms 18940 KB Output is correct
19 Execution timed out 541 ms 55776 KB Time limit exceeded
20 Halted 0 ms 0 KB -