oj.uz

답안 #466235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466235 2021-08-18T11:31:34 Z AmirElarbi 어르신 집배원 (BOI14_postmen) C++17
100 / 100
 481 ms 58740 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;
struct edge { int fi, se; };
ve<edge> 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()){
        edge 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 12072 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 12164 KB Output is correct
6 Correct 9 ms 12364 KB Output is correct
7 Correct 13 ms 13268 KB Output is correct
8 Correct 8 ms 12236 KB Output is correct
9 Correct 41 ms 19152 KB Output is correct
10 Correct 8 ms 12236 KB Output is correct
11 Correct 8 ms 12236 KB Output is correct
12 Correct 46 ms 19524 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 12064 KB Output is correct
3 Correct 7 ms 12072 KB Output is correct
4 Correct 8 ms 12320 KB Output is correct
5 Correct 9 ms 12156 KB Output is correct
6 Correct 9 ms 12364 KB Output is correct
7 Correct 13 ms 13260 KB Output is correct
8 Correct 9 ms 12236 KB Output is correct
9 Correct 42 ms 19232 KB Output is correct
10 Correct 8 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 47 ms 19444 KB Output is correct
13 Correct 76 ms 21060 KB Output is correct
14 Correct 72 ms 18304 KB Output is correct
15 Correct 58 ms 20280 KB Output is correct
16 Correct 64 ms 21020 KB Output is correct
17 Correct 71 ms 16256 KB Output is correct
18 Correct 66 ms 19436 KB Output is correct

Subtask #3
45.0 / 45.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 12440 KB Output is correct
7 Correct 13 ms 13308 KB Output is correct
8 Correct 8 ms 12236 KB Output is correct
9 Correct 42 ms 19204 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 48 ms 19452 KB Output is correct
13 Correct 61 ms 20956 KB Output is correct
14 Correct 65 ms 18244 KB Output is correct
15 Correct 68 ms 20264 KB Output is correct
16 Correct 63 ms 20952 KB Output is correct
17 Correct 80 ms 16240 KB Output is correct
18 Correct 62 ms 19432 KB Output is correct
19 Correct 432 ms 57620 KB Output is correct
20 Correct 430 ms 43852 KB Output is correct
21 Correct 406 ms 54540 KB Output is correct
22 Correct 437 ms 58740 KB Output is correct
23 Correct 200 ms 47916 KB Output is correct
24 Correct 468 ms 34584 KB Output is correct
25 Correct 481 ms 50848 KB Output is correct