oj.uz

답안 #466238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466238 2021-08-18T11:35:01 Z AmirElarbi 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 488 ms 57616 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e7
#define unsigned u
#define eps 1e-18
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAX_A 100005
#define V 450
using namespace std;
const int maxn = 5e5 + 5;
vii adj[maxn];
bool vis[maxn], tv[maxn];
int parent[maxn];
void dfs(int u){
    if(tv[u]){
        while(tv[u]){
            cout << u+1 << " ";
            tv[u] = 0;
            u = parent[u];
        }
        cout << "\n";
    }
    while(!adj[u].empty()){
        ii x =adj[u].back();
        adj[u].pop_back();
        if(!vis[x.se]){
            vis[x.se] = 1;
            tv[u] = 1;
            parent[u] = x.fi;
            dfs(x.fi);
        }
    }
}
int main(){
    optimise;
    int n,m,a,b;
    cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        cin >> a >>b;
        a--,b--;
        adj[a].pb({b,i});
        adj[b].pb({a,i});
    }
    dfs(0);
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12052 KB Output is correct
2 Correct 7 ms 12108 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 8 ms 12236 KB Output is correct
5 Correct 7 ms 12052 KB Output is correct
6 Correct 8 ms 12364 KB Output is correct
7 Correct 12 ms 13308 KB Output is correct
8 Correct 8 ms 12236 KB Output is correct
9 Correct 43 ms 19176 KB Output is correct
10 Correct 8 ms 12236 KB Output is correct
11 Correct 8 ms 12224 KB Output is correct
12 Correct 47 ms 19552 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 8 ms 12236 KB Output is correct
5 Correct 7 ms 12108 KB Output is correct
6 Correct 9 ms 12492 KB Output is correct
7 Correct 14 ms 13204 KB Output is correct
8 Correct 8 ms 12148 KB Output is correct
9 Correct 41 ms 19136 KB Output is correct
10 Correct 11 ms 12168 KB Output is correct
11 Correct 8 ms 12236 KB Output is correct
12 Correct 47 ms 19656 KB Output is correct
13 Correct 59 ms 21012 KB Output is correct
14 Correct 60 ms 18248 KB Output is correct
15 Correct 66 ms 20248 KB Output is correct
16 Correct 61 ms 20960 KB Output is correct
17 Correct 65 ms 16196 KB Output is correct
18 Correct 85 ms 19528 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11952 KB Output is correct
2 Correct 6 ms 11980 KB Output is correct
3 Correct 8 ms 11980 KB Output is correct
4 Correct 9 ms 12236 KB Output is correct
5 Correct 10 ms 12108 KB Output is correct
6 Correct 10 ms 12364 KB Output is correct
7 Correct 14 ms 13296 KB Output is correct
8 Correct 11 ms 12176 KB Output is correct
9 Correct 46 ms 19228 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 10 ms 12236 KB Output is correct
12 Correct 52 ms 19484 KB Output is correct
13 Correct 65 ms 20968 KB Output is correct
14 Correct 69 ms 18296 KB Output is correct
15 Correct 80 ms 20280 KB Output is correct
16 Correct 74 ms 21032 KB Output is correct
17 Correct 65 ms 16220 KB Output is correct
18 Correct 77 ms 19500 KB Output is correct
19 Correct 449 ms 57616 KB Output is correct
20 Correct 428 ms 43940 KB Output is correct
21 Correct 421 ms 53372 KB Output is correct
22 Correct 461 ms 57460 KB Output is correct
23 Correct 198 ms 46700 KB Output is correct
24 Correct 488 ms 33428 KB Output is correct
25 Correct 477 ms 49616 KB Output is correct