oj.uz

답안 #39990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39990 2018-01-25T06:23:29 Z Waschbar 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 59560 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define fox(k, x) for (int k=0; k<x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
 
int n, m, a, b, t, d, p[500005], s[500005];
bool u[500005], u2[500005];
vector<pii> v[500005];
vector<int> ans;
void dfs(int N){
    if (u[N]){
        t=-1;
        ans=vector<int>();
        while(t!=N){
            t=s[--d];
            u[t]=0;
            printf("%i", t);
            if (t!=N) printf(" ");
        }
        printf("\n");
    }
    int k=v[N].size();
    for(; p[N]<k; ++p[N]){
        if (!u2[v[N][p[N]].y]){
            u2[v[N][p[N]].y]=u[N]=1;
            s[d++]=N;
            dfs(v[N][p[N]].x);
        }
    }
}
int main(){
    scan(n); scan(m);
    fox(l, m){
        scan(a); scan(b);
        v[a].pb(mp(b, l));
        v[b].pb(mp(a, l));
    }
    dfs(1);
    return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 13 ms 12464 KB Output is correct
7 Correct 16 ms 13312 KB Output is correct
8 Correct 15 ms 12340 KB Output is correct
9 Correct 43 ms 19192 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 16 ms 12340 KB Output is correct
12 Correct 47 ms 19576 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 15 ms 12160 KB Output is correct
4 Correct 12 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 12 ms 12416 KB Output is correct
7 Correct 15 ms 13312 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 50 ms 19212 KB Output is correct
10 Correct 16 ms 12244 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 57 ms 19576 KB Output is correct
13 Correct 76 ms 21476 KB Output is correct
14 Correct 84 ms 18340 KB Output is correct
15 Correct 68 ms 20332 KB Output is correct
16 Correct 86 ms 21440 KB Output is correct
17 Correct 103 ms 16504 KB Output is correct
18 Correct 77 ms 19576 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 20 ms 13288 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 47 ms 19168 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 48 ms 19572 KB Output is correct
13 Correct 83 ms 21472 KB Output is correct
14 Correct 84 ms 18336 KB Output is correct
15 Correct 79 ms 20252 KB Output is correct
16 Correct 76 ms 21508 KB Output is correct
17 Correct 68 ms 16376 KB Output is correct
18 Correct 80 ms 19640 KB Output is correct
19 Correct 496 ms 59560 KB Output is correct
20 Correct 494 ms 43872 KB Output is correct
21 Correct 452 ms 53360 KB Output is correct
22 Execution timed out 506 ms 59508 KB Time limit exceeded
23 Halted 0 ms 0 KB -