oj.uz

Submission #88749

# Submission time Handle Problem Language Result Execution time Memory
88749 2018-12-08T11:52:41 Z popovicirobert Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 55544 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];
int ord[MAXN + 1], sz;

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[sz++] = nod;
}

int stk[MAXN + 1];

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 sz1 = 0;
    for(i = 0; i < sz; i++) {
        if(vis1[ord[i]] == 0) {
            vis1[ord[i]] = 1;
            stk[++sz1] = ord[i];
        }
        else {
            while(stk[sz1] != ord[i]) {
                printf("%d " ,stk[sz1]);
                vis1[stk[sz1]] = 0;
                sz1--;
            }
            printf("%d\n" ,ord[i]);
        }
    }
    //cout << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:52: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 15 ms 12032 KB Output is correct
2 Correct 15 ms 12032 KB Output is correct
3 Correct 14 ms 12160 KB Output is correct
4 Correct 14 ms 12288 KB Output is correct
5 Correct 13 ms 12208 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 18 ms 12264 KB Output is correct
9 Correct 38 ms 17864 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 45 ms 18040 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 12 ms 12136 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 38 ms 17792 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 48 ms 18040 KB Output is correct
13 Correct 90 ms 20728 KB Output is correct
14 Correct 66 ms 18168 KB Output is correct
15 Correct 69 ms 19420 KB Output is correct
16 Correct 85 ms 20704 KB Output is correct
17 Correct 81 ms 16608 KB Output is correct
18 Correct 74 ms 18808 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 15 ms 12160 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 18 ms 13028 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 43 ms 17844 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 49 ms 18040 KB Output is correct
13 Correct 89 ms 20728 KB Output is correct
14 Correct 82 ms 18172 KB Output is correct
15 Correct 66 ms 19312 KB Output is correct
16 Correct 99 ms 20728 KB Output is correct
17 Correct 80 ms 16632 KB Output is correct
18 Correct 73 ms 18752 KB Output is correct
19 Execution timed out 518 ms 55544 KB Time limit exceeded
20 Halted 0 ms 0 KB -