oj.uz

Submission #227749

# Submission time Handle Problem Language Result Execution time Memory
227749 2020-04-28T16:30:53 Z Shafin666 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 65268 KB 
#include <bits/stdc++.h>
#define pb push_back
#define nyan "(=^･ω･^=)"
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
const int maxn = 1e6+10;
vector<int> adj[maxn], euler;
int del[maxn], l[maxn], r[maxn];
int pre[maxn], curr[maxn];
 
int main() 
{
    int n, m;
    scanf("%d %d", &n, &m);
 
    for(int i = 1; i <= m; i++) {
        scanf("%d %d", &l[i], &r[i]);
 
        adj[l[i]].pb(i);
        adj[r[i]].pb(i);
    }
    for(int i = 1; i <= n; i++) adj[i].pb(0);
 
    stack<int> s;
 
    s.push(1) ;
    while(!s.empty()) {
        int u = s.top();
        s.pop();
 
        while(curr[u] < (int) adj[u].size() - 1) {
            while(del[adj[u][curr[u]]]) curr[u]++;
            int e = adj[u][curr[u]++];
            if(e == 0) break;
 
            s.push(u);
 
            u = l[e] ^ r[e] ^ u;
            del[e] = 1;
        }
        euler.pb(u);
    }
    memset(pre, -1, sizeof pre);
 
    int j = 0;
    while(j < (int) euler.size()) {
        s.push(euler[j]);
 
        if(pre[euler[j]] != -1) {
            s.pop();
 
            while(1) {
                int here = s.top();
                printf("%d ", here);
                
                if(pre[here] == pre[euler[j]]) break;
                pre[here] = -1;
                s.pop();
            }
            printf("\n");
        }
        else pre[euler[j]] = j;
        j++;
    }
    return 0;   
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:17: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:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &l[i], &r[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 27776 KB Output is correct
2 Correct 19 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 20 ms 27904 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 21 ms 27904 KB Output is correct
7 Correct 26 ms 28536 KB Output is correct
8 Correct 19 ms 27904 KB Output is correct
9 Correct 59 ms 31728 KB Output is correct
10 Correct 20 ms 28032 KB Output is correct
11 Correct 20 ms 28032 KB Output is correct
12 Correct 69 ms 32160 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 18 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 21 ms 27904 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 21 ms 27904 KB Output is correct
7 Correct 27 ms 28416 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 57 ms 31728 KB Output is correct
10 Correct 21 ms 27904 KB Output is correct
11 Correct 20 ms 27904 KB Output is correct
12 Correct 65 ms 32196 KB Output is correct
13 Correct 88 ms 34988 KB Output is correct
14 Correct 87 ms 34804 KB Output is correct
15 Correct 92 ms 33824 KB Output is correct
16 Correct 91 ms 34988 KB Output is correct
17 Correct 95 ms 34144 KB Output is correct
18 Correct 89 ms 34980 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 19 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 20 ms 27904 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 21 ms 28032 KB Output is correct
7 Correct 25 ms 28416 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 57 ms 31728 KB Output is correct
10 Correct 21 ms 27904 KB Output is correct
11 Correct 20 ms 27904 KB Output is correct
12 Correct 65 ms 32196 KB Output is correct
13 Correct 90 ms 34988 KB Output is correct
14 Correct 86 ms 34932 KB Output is correct
15 Correct 79 ms 33696 KB Output is correct
16 Correct 89 ms 34988 KB Output is correct
17 Correct 95 ms 34144 KB Output is correct
18 Correct 88 ms 34980 KB Output is correct
19 Execution timed out 612 ms 65268 KB Time limit exceeded
20 Halted 0 ms 0 KB -