oj.uz

Submission #107735

# Submission time Handle Problem Language Result Execution time Memory
107735 2019-04-25T15:07:51 Z patrikpavic2 Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 52792 KB 
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>
#include <set>
#include <vector>
#include <iostream>
#include <queue>
#include <map>

#define X first
#define Y second
#define PB push_back
#define P push

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef vector < int > vi;
typedef set < int > si;

const int N = 5e5 + 500;
const int M = 1e6 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int OFF = (1 << 18);
const int LOG = 20;
const double EPS = 1e-9;
const double PI = 3.1415926535;

int bio[N], n, m, nod[N];
vector < pii > v[N];
vector < int > st;
vi tura;

void euler(int x){
    for(;!v[x].empty();){
        if(bio[v[x].back().Y]){
            v[x].pop_back();continue;
        }
        bio[v[x].back().Y] = 1;
        int nxt = v[x].back().X;
        v[x].pop_back();
        euler(nxt);
    }
    tura.PB(x);
}

void rastavi(){
    memset(bio, 0, sizeof(bio));
    for(int i = 0;i < tura.size();i++){
        if(bio[tura[i]]){
            while(st.back() != tura[i]){
                printf("%d ", st.back());
                bio[st.back()]--;
                st.pop_back();
            }
            st.pop_back();
            bio[tura[i]]--;
            printf("%d\n", tura[i]);
        }
        st.PB(tura[i]);
        bio[tura[i]]++;
    }
}

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 0;i < m;i++){
        int x, y; scanf("%d%d", &x, &y);
        v[x].PB({y, i});
        v[y].PB({x, i});
    }
    euler(1);
    rastavi();
    return 0;
}

Compilation message

postmen.cpp: In function 'void rastavi()':
postmen.cpp:55:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < tura.size();i++){
                   ~~^~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:72: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:74:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x, y; scanf("%d%d", &x, &y);
                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14080 KB Output is correct
2 Correct 18 ms 14080 KB Output is correct
3 Correct 14 ms 14080 KB Output is correct
4 Correct 14 ms 14208 KB Output is correct
5 Correct 13 ms 14080 KB Output is correct
6 Correct 14 ms 14336 KB Output is correct
7 Correct 27 ms 15140 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 54 ms 19976 KB Output is correct
10 Correct 14 ms 14208 KB Output is correct
11 Correct 14 ms 14208 KB Output is correct
12 Correct 60 ms 20340 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14080 KB Output is correct
2 Correct 13 ms 14080 KB Output is correct
3 Correct 15 ms 14056 KB Output is correct
4 Correct 16 ms 14208 KB Output is correct
5 Correct 15 ms 14044 KB Output is correct
6 Correct 15 ms 14336 KB Output is correct
7 Correct 25 ms 15104 KB Output is correct
8 Correct 14 ms 14208 KB Output is correct
9 Correct 54 ms 20092 KB Output is correct
10 Correct 14 ms 14208 KB Output is correct
11 Correct 14 ms 14208 KB Output is correct
12 Correct 66 ms 20316 KB Output is correct
13 Correct 93 ms 21824 KB Output is correct
14 Correct 94 ms 19944 KB Output is correct
15 Correct 75 ms 21124 KB Output is correct
16 Correct 101 ms 21784 KB Output is correct
17 Correct 104 ms 18164 KB Output is correct
18 Correct 104 ms 20428 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14080 KB Output is correct
2 Correct 12 ms 14080 KB Output is correct
3 Correct 15 ms 14080 KB Output is correct
4 Correct 15 ms 14208 KB Output is correct
5 Correct 14 ms 14080 KB Output is correct
6 Correct 18 ms 14336 KB Output is correct
7 Correct 20 ms 15104 KB Output is correct
8 Correct 18 ms 14208 KB Output is correct
9 Correct 55 ms 20068 KB Output is correct
10 Correct 16 ms 14208 KB Output is correct
11 Correct 14 ms 14208 KB Output is correct
12 Correct 62 ms 20340 KB Output is correct
13 Correct 102 ms 21748 KB Output is correct
14 Correct 99 ms 19932 KB Output is correct
15 Correct 81 ms 21108 KB Output is correct
16 Correct 97 ms 21748 KB Output is correct
17 Correct 91 ms 18200 KB Output is correct
18 Correct 91 ms 20468 KB Output is correct
19 Execution timed out 542 ms 52792 KB Time limit exceeded
20 Halted 0 ms 0 KB -