oj.uz

Submission #107734

# Submission time Handle Problem Language Result Execution time Memory
107734 2019-04-25T15:05:49 Z patrikpavic2 Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 52764 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];
stack < 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]]){
            if(st.empty()){
                printf("PUSI KURAC EULER\n");
                return;
            }
            while(st.top() != tura[i]){
                printf("%d ", st.top());
                bio[st.top()]--;
                st.pop();
                if(st.empty()){
                    printf("PUSI KURAC EULER\n");
                    return;
                }
            }
            st.pop();
            bio[tura[i]]--;
            printf("%d\n", tura[i]);
        }
        st.P(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:80: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:82: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 13 ms 14000 KB Output is correct
2 Correct 13 ms 14080 KB Output is correct
3 Correct 12 ms 14004 KB Output is correct
4 Correct 18 ms 14336 KB Output is correct
5 Correct 13 ms 14080 KB Output is correct
6 Correct 15 ms 14336 KB Output is correct
7 Correct 20 ms 15104 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 60 ms 19968 KB Output is correct
10 Correct 16 ms 14208 KB Output is correct
11 Correct 14 ms 14208 KB Output is correct
12 Correct 68 ms 20316 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 13 ms 14080 KB Output is correct
4 Correct 15 ms 14296 KB Output is correct
5 Correct 15 ms 14080 KB Output is correct
6 Correct 15 ms 14356 KB Output is correct
7 Correct 20 ms 15072 KB Output is correct
8 Correct 16 ms 14212 KB Output is correct
9 Correct 63 ms 19968 KB Output is correct
10 Correct 14 ms 14256 KB Output is correct
11 Correct 14 ms 14208 KB Output is correct
12 Correct 69 ms 20340 KB Output is correct
13 Correct 95 ms 21752 KB Output is correct
14 Correct 91 ms 19700 KB Output is correct
15 Correct 86 ms 21100 KB Output is correct
16 Correct 102 ms 21748 KB Output is correct
17 Correct 102 ms 18168 KB Output is correct
18 Correct 94 ms 20340 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14080 KB Output is correct
2 Correct 12 ms 14080 KB Output is correct
3 Correct 13 ms 14080 KB Output is correct
4 Correct 15 ms 14208 KB Output is correct
5 Correct 13 ms 14100 KB Output is correct
6 Correct 14 ms 14336 KB Output is correct
7 Correct 19 ms 15104 KB Output is correct
8 Correct 15 ms 14208 KB Output is correct
9 Correct 58 ms 20068 KB Output is correct
10 Correct 15 ms 14260 KB Output is correct
11 Correct 15 ms 14208 KB Output is correct
12 Correct 72 ms 20444 KB Output is correct
13 Correct 80 ms 21724 KB Output is correct
14 Correct 85 ms 19676 KB Output is correct
15 Correct 87 ms 21200 KB Output is correct
16 Correct 91 ms 21748 KB Output is correct
17 Correct 96 ms 18140 KB Output is correct
18 Correct 96 ms 20444 KB Output is correct
19 Execution timed out 546 ms 52764 KB Time limit exceeded
20 Halted 0 ms 0 KB -