oj.uz

Submission #88746

# Submission time Handle Problem Language Result Execution time Memory
88746 2018-12-08T11:45:22 Z popovicirobert Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 55700 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 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);
    scanf("%d%d" ,&n,&m);
    for(i = 1; i <= m; i++) {
        int x, y;
        scanf("%d%d" ,&x,&y);
        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]) {
                cout << stk.back() << " ";
                vis1[stk.back()] = 0;
                stk.pop_back();
            }
            cout << ord[i] << "\n";
        }
    }
    //cout << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d" ,&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
postmen.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d" ,&x,&y);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12160 KB Output is correct
2 Correct 12 ms 12008 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 23 ms 13056 KB Output is correct
8 Correct 17 ms 12288 KB Output is correct
9 Correct 69 ms 17904 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 56 ms 18268 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12136 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 21 ms 13056 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 55 ms 17928 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 14 ms 12320 KB Output is correct
12 Correct 66 ms 18164 KB Output is correct
13 Correct 106 ms 20852 KB Output is correct
14 Correct 97 ms 18384 KB Output is correct
15 Correct 90 ms 19440 KB Output is correct
16 Correct 102 ms 20852 KB Output is correct
17 Correct 101 ms 16836 KB Output is correct
18 Correct 100 ms 18936 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 12 ms 12160 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 54 ms 17968 KB Output is correct
10 Correct 19 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 65 ms 18148 KB Output is correct
13 Correct 113 ms 20828 KB Output is correct
14 Correct 92 ms 18396 KB Output is correct
15 Correct 90 ms 19440 KB Output is correct
16 Correct 99 ms 20828 KB Output is correct
17 Correct 114 ms 16724 KB Output is correct
18 Correct 91 ms 18956 KB Output is correct
19 Execution timed out 614 ms 55700 KB Time limit exceeded
20 Halted 0 ms 0 KB -