oj.uz

답안 #107747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107747 2019-04-25T15:39:36 Z patrikpavic2 어르신 집배원 (BOI14_postmen) C++17
100 / 100
 437 ms 40960 KB 
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>

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

using namespace std;

typedef pair < int, int > pii;
typedef vector < int > vi;

const int N = 5e5 + 5;

int bio[N], n, m, nod[N],ind[N], rek[N], cur;
vector < pii > v[N];
int tura[N], st[N], tr, ss;

inline bool is( const char &c ) { return c >= '0' && c <= '9'; }

inline int read_int( ) {
    int num;
    char c;
    while( !is( c = getchar_unlocked( ) ) );
    num = c - '0';
    while( is( c = getchar_unlocked( ) ) ) num = num * 10 + c - '0';
    return num;
}

inline void euler(){
    rek[cur++] = 1;
    for(;cur;){
        int x = rek[cur - 1];
        for(;ind[x] < v[x].size() && bio[v[x][ind[x]].Y];++ind[x]);
        if(ind[x] == v[x].size()) --cur, tura[tr++] = x;
        for(;ind[x] < v[x].size();++ind[x]){
            if(bio[v[x][ind[x]].Y]) continue;
            bio[v[x][ind[x]].Y] = 1;
            int nxt = v[x][ind[x]].X;
            rek[cur++] = nxt;
            break;
        }

    }
}

inline void rastavi(){
    memset(bio, 0, sizeof(bio));
    for(int i = 0;i < tr;++i){
        if(bio[tura[i]]){
            while(st[ss - 1] != tura[i]){
                printf("%d ", st[ss - 1]);
                bio[st[ss - 1]]--;
                --ss;
            }
            --ss;
            --bio[tura[i]];
            printf("%d\n", tura[i]);
        }
        st[ss++] = tura[i];
        ++bio[tura[i]];
    }
}

int main(){
    n = read_int(); m = read_int();
    for(int i = 0;i < m;++i){
        int x = read_int();
        int y = read_int();
        v[x].PB({y, i});
        v[y].PB({x, i});
    }
    euler();
    rastavi();
    return 0;
}

Compilation message

postmen.cpp: In function 'void euler()':
postmen.cpp:36:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(;ind[x] < v[x].size() && bio[v[x][ind[x]].Y];++ind[x]);
              ~~~~~~~^~~~~~~~~~~~~
postmen.cpp:37:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(ind[x] == v[x].size()) --cur, tura[tr++] = x;
            ~~~~~~~^~~~~~~~~~~~~~
postmen.cpp:38:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(;ind[x] < v[x].size();++ind[x]){
              ~~~~~~~^~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14080 KB Output is correct
2 Correct 12 ms 14080 KB Output is correct
3 Correct 12 ms 14000 KB Output is correct
4 Correct 19 ms 14208 KB Output is correct
5 Correct 13 ms 14080 KB Output is correct
6 Correct 13 ms 14208 KB Output is correct
7 Correct 20 ms 14592 KB Output is correct
8 Correct 12 ms 14080 KB Output is correct
9 Correct 31 ms 17140 KB Output is correct
10 Correct 13 ms 14208 KB Output is correct
11 Correct 13 ms 14140 KB Output is correct
12 Correct 43 ms 17504 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14080 KB Output is correct
2 Correct 16 ms 14080 KB Output is correct
3 Correct 13 ms 14080 KB Output is correct
4 Correct 13 ms 14208 KB Output is correct
5 Correct 13 ms 14080 KB Output is correct
6 Correct 21 ms 14208 KB Output is correct
7 Correct 15 ms 14592 KB Output is correct
8 Correct 13 ms 14080 KB Output is correct
9 Correct 31 ms 17152 KB Output is correct
10 Correct 15 ms 14208 KB Output is correct
11 Correct 13 ms 14112 KB Output is correct
12 Correct 36 ms 17528 KB Output is correct
13 Correct 59 ms 19320 KB Output is correct
14 Correct 60 ms 18552 KB Output is correct
15 Correct 54 ms 18132 KB Output is correct
16 Correct 56 ms 19320 KB Output is correct
17 Correct 62 ms 18040 KB Output is correct
18 Correct 65 ms 18552 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14080 KB Output is correct
2 Correct 16 ms 14080 KB Output is correct
3 Correct 22 ms 14080 KB Output is correct
4 Correct 12 ms 14208 KB Output is correct
5 Correct 13 ms 14080 KB Output is correct
6 Correct 13 ms 14208 KB Output is correct
7 Correct 18 ms 14592 KB Output is correct
8 Correct 12 ms 14208 KB Output is correct
9 Correct 39 ms 17144 KB Output is correct
10 Correct 13 ms 14208 KB Output is correct
11 Correct 13 ms 14080 KB Output is correct
12 Correct 34 ms 17532 KB Output is correct
13 Correct 68 ms 19296 KB Output is correct
14 Correct 61 ms 18528 KB Output is correct
15 Correct 47 ms 18208 KB Output is correct
16 Correct 71 ms 19320 KB Output is correct
17 Correct 73 ms 18044 KB Output is correct
18 Correct 56 ms 18552 KB Output is correct
19 Correct 396 ms 40956 KB Output is correct
20 Correct 365 ms 37112 KB Output is correct
21 Correct 353 ms 34908 KB Output is correct
22 Correct 412 ms 40960 KB Output is correct
23 Correct 116 ms 28632 KB Output is correct
24 Correct 437 ms 34404 KB Output is correct
25 Correct 401 ms 37040 KB Output is correct