oj.uz

Submission #260025

# Submission time Handle Problem Language Result Execution time Memory
260025 2020-08-09T01:38:08 Z anonymous Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 43360 KB 
#include <iostream>
#include <vector>
#include <utility>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define MAXN 500005
using namespace std;
int N, M, del[MAXN], inStack[MAXN];
vector <pair<int,int> > adj[MAXN];
vector <int> S,S2;

void dfs(int u) { //Hierholzer
    while (adj[u].size()) {
        int v = adj[u].back().first, id = adj[u].back().second;
        adj[u].pop_back();
        if (!del[id]) {
            del[id] = true;
            dfs(v);
        }
    }
    S.push_back(u);
}

int main() {
    //freopen("seniorin.txt","r",stdin);
    scanf("%d %d",&N,&M);
    for (int i=1; i<=M; i++) {
        int u,v;
        scanf("%d %d",&u,&v);
        adj[u].push_back({v,i});
        adj[v].push_back({u,i});
    }
    dfs(1);
    for (int i=0; i<S.size(); i++) {
        if (inStack[S[i]]) {
            while (S2.size() && S2.back() != S[i]) {
                printf("%d ",S2.back());
                inStack[S2.back()]--;
                S2.pop_back();
            }
            printf("%d\n",S[i]);
        } else {
            inStack[S[i]]++;
            S2.push_back(S[i]);
        }
    }
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:35:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<S.size(); i++) {
                   ~^~~~~~~~~
postmen.cpp:27: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:30:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 11 ms 12288 KB Output is correct
5 Correct 9 ms 12288 KB Output is correct
6 Correct 10 ms 12288 KB Output is correct
7 Correct 15 ms 12928 KB Output is correct
8 Correct 11 ms 12160 KB Output is correct
9 Correct 50 ms 16124 KB Output is correct
10 Correct 11 ms 12160 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 55 ms 16500 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 10 ms 12160 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 10 ms 12288 KB Output is correct
7 Correct 15 ms 12928 KB Output is correct
8 Correct 10 ms 12160 KB Output is correct
9 Correct 50 ms 16124 KB Output is correct
10 Correct 10 ms 12160 KB Output is correct
11 Correct 10 ms 12184 KB Output is correct
12 Correct 55 ms 16500 KB Output is correct
13 Correct 80 ms 18420 KB Output is correct
14 Correct 76 ms 17524 KB Output is correct
15 Correct 68 ms 17516 KB Output is correct
16 Correct 79 ms 18372 KB Output is correct
17 Correct 81 ms 16628 KB Output is correct
18 Correct 78 ms 17524 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12032 KB Output is correct
2 Correct 8 ms 12160 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 11 ms 12288 KB Output is correct
5 Correct 10 ms 12160 KB Output is correct
6 Correct 10 ms 12232 KB Output is correct
7 Correct 15 ms 12928 KB Output is correct
8 Correct 9 ms 12160 KB Output is correct
9 Correct 50 ms 16124 KB Output is correct
10 Correct 11 ms 12416 KB Output is correct
11 Correct 11 ms 12160 KB Output is correct
12 Correct 55 ms 16500 KB Output is correct
13 Correct 82 ms 18420 KB Output is correct
14 Correct 85 ms 17524 KB Output is correct
15 Correct 71 ms 17516 KB Output is correct
16 Correct 82 ms 18292 KB Output is correct
17 Correct 74 ms 16628 KB Output is correct
18 Correct 72 ms 17524 KB Output is correct
19 Execution timed out 522 ms 43360 KB Time limit exceeded
20 Halted 0 ms 0 KB -