oj.uz

Submission #97099

# Submission time Handle Problem Language Result Execution time Memory
97099 2019-02-13T20:49:46 Z dalgerok Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 55176 KB 
#include<bits/stdc++.h>
using namespace std;


const int N = 5e5 + 5;


int n, m, x[N], y[N], a[3 * N], sz;
vector < int > g[N];
bool used[N];
vector < int > q;


void dfs(int v){
    while(!g[v].empty()){
        int num = g[v].back();
        g[v].pop_back();
        if(used[num]){
            continue;
        }
        used[num] = true;
        int to = (x[num] ^ v ^ y[num]);
        dfs(to);
    }
    a[++sz] = v;
}

inline void read(int &x){
    x = 0;
    char c = getchar();
    while(c < '0' || c > '9'){
        c = getchar();
    }
    while('0' <= c && c <= '9'){
        x = x * 10 + c - '0';
        c = getchar();
    }
}
inline void print(int x){
    int len = 0;
    while(x % 10 == 0){
        len += 1;
        x /= 10;
    }
    int y = 0;
    while(x){
        y = y * 10 + x % 10;
        x /= 10;
    }
    while(y){
        putchar('0' + y % 10);
        y /= 10;
    }
    while(len--){
        putchar('0');
    }
}

int main(){
    read(n);
    read(m);
    for(int i = 1; i <= m; i++){
        read(x[i]);
        read(y[i]);
        g[x[i]].push_back(i);
        g[y[i]].push_back(i);
    }
    dfs(1);
    memset(used, 0, sizeof(used));
    vector < int > s;
    for(int i = 1; i <= sz; i++){
        int it = a[i];
        if(!used[it]){
            used[it] = true;
            s.push_back(it);
        }
        else{
            while(s.back() != it){
                print(s.back());
                putchar(' ');
                used[s.back()] = false;
                s.pop_back();
            }
            print(it);
            putchar('\n');
        }
    }
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12544 KB Output is correct
2 Correct 12 ms 12520 KB Output is correct
3 Correct 13 ms 12544 KB Output is correct
4 Correct 16 ms 12800 KB Output is correct
5 Correct 13 ms 12672 KB Output is correct
6 Correct 13 ms 12828 KB Output is correct
7 Correct 18 ms 13568 KB Output is correct
8 Correct 16 ms 12672 KB Output is correct
9 Correct 37 ms 18296 KB Output is correct
10 Correct 13 ms 12800 KB Output is correct
11 Correct 14 ms 12800 KB Output is correct
12 Correct 44 ms 18448 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12544 KB Output is correct
2 Correct 13 ms 12544 KB Output is correct
3 Correct 12 ms 12544 KB Output is correct
4 Correct 22 ms 12792 KB Output is correct
5 Correct 12 ms 12672 KB Output is correct
6 Correct 13 ms 12776 KB Output is correct
7 Correct 17 ms 13568 KB Output is correct
8 Correct 15 ms 12776 KB Output is correct
9 Correct 36 ms 18168 KB Output is correct
10 Correct 13 ms 12672 KB Output is correct
11 Correct 15 ms 12800 KB Output is correct
12 Correct 46 ms 18424 KB Output is correct
13 Correct 83 ms 21112 KB Output is correct
14 Correct 96 ms 18548 KB Output is correct
15 Correct 66 ms 19672 KB Output is correct
16 Correct 82 ms 21088 KB Output is correct
17 Correct 65 ms 16888 KB Output is correct
18 Correct 83 ms 19296 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12520 KB Output is correct
2 Correct 13 ms 12544 KB Output is correct
3 Correct 11 ms 12544 KB Output is correct
4 Correct 14 ms 12800 KB Output is correct
5 Correct 14 ms 12672 KB Output is correct
6 Correct 14 ms 12832 KB Output is correct
7 Correct 18 ms 13544 KB Output is correct
8 Correct 16 ms 12672 KB Output is correct
9 Correct 37 ms 18168 KB Output is correct
10 Correct 15 ms 12672 KB Output is correct
11 Correct 12 ms 12800 KB Output is correct
12 Correct 46 ms 18512 KB Output is correct
13 Correct 87 ms 21204 KB Output is correct
14 Correct 78 ms 18552 KB Output is correct
15 Correct 66 ms 19688 KB Output is correct
16 Correct 91 ms 21084 KB Output is correct
17 Correct 84 ms 16936 KB Output is correct
18 Correct 71 ms 19192 KB Output is correct
19 Execution timed out 544 ms 55176 KB Time limit exceeded
20 Halted 0 ms 0 KB -