oj.uz

Submission #543916

# Submission time Handle Problem Language Result Execution time Memory
543916 2022-03-31T15:24:51 Z Olympia Senior Postmen (BOI14_postmen) C++17
38 / 100
 500 ms 16800 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <stack>
#include <cstdlib>
#include <queue>
#include <cstdio>
#include <limits.h>

using namespace std;

vector<pair<int,int>> adj[(int)5e5];
bool hasVisited[(int)5e5];
bool okay[(int)5e5];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M;
    scanf("%d%d", &N, &M);
    for (int i = 0; i < M; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        u--, v--;
        adj[u].push_back({v, i}), adj[v].push_back({u, i});
    }
    for (int i = 0; i < M; i++) {
        okay[i] = true;
    }
    stack<pair<int,int>> nodes;
    for (int i = 0; i < N; i++) {
        nodes.push({i, -1});
        while (!nodes.empty()) {
            int cur = nodes.top().first;
            int prev = nodes.top().second;
            okay[prev] = false;
            hasVisited[cur] = true;
            bool upd = false;
            for (pair<int,int> &pr: adj[cur]) {
                int j = pr.first;
                if (pr.second == prev) {
                    continue;
                }
                if (!okay[pr.second]) {
                    continue;
                }
                okay[pr.second] = false;
                if (hasVisited[j]) {
                    while (!nodes.empty() && nodes.top().first != j) {
                        hasVisited[nodes.top().first] = false;
                        printf("%d ", nodes.top().first + 1);
                        //okay[nodes.top().second] = false;
                        nodes.pop();
                    }
                    //okay[pr.second] = false;
                    printf("%d\n", j + 1);
                } else {
                    nodes.push({j, pr.second});
                }
                upd = true;
                break;
            }
            if (!upd) {
                nodes.pop();
            }
        }
    }
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d%d", &N, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~
postmen.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12080 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 7 ms 12136 KB Output is correct
5 Correct 7 ms 12012 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 12 ms 12632 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 62 ms 14436 KB Output is correct
10 Correct 8 ms 12116 KB Output is correct
11 Correct 10 ms 12116 KB Output is correct
12 Correct 53 ms 14852 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11956 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 9 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 20 ms 12144 KB Output is correct
7 Correct 12 ms 12608 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 58 ms 14556 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 43 ms 14796 KB Output is correct
13 Correct 84 ms 16800 KB Output is correct
14 Correct 53 ms 15652 KB Output is correct
15 Execution timed out 808 ms 15324 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12024 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 8 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 14 ms 12628 KB Output is correct
8 Correct 9 ms 12116 KB Output is correct
9 Correct 66 ms 14516 KB Output is correct
10 Correct 7 ms 12164 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 44 ms 14836 KB Output is correct
13 Correct 88 ms 16676 KB Output is correct
14 Correct 59 ms 15568 KB Output is correct
15 Execution timed out 806 ms 15356 KB Time limit exceeded
16 Halted 0 ms 0 KB -