oj.uz

답안 #445711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445711 2021-07-19T10:46:19 Z MohammadAghil 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 466 ms 67684 KB 
#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,l,r) for(int i = (l); i < r; i++)
#define per(i,r,l) for(int i = (r); i >= l; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define ss second 
 
const ll mod = 1e9 + 7,maxlg = 22, maxn = 5e5 + 5, inf = 1e9 + 5, p = 9973;

bool vis[maxn];
int ptr[maxn];
vector<pair<int, int>> adj[maxn];
vector<int> tour;

void dfs(int r){
    while(ptr[r] != sz(adj[r])){
        int id = adj[r][ptr[r]].ss, c = adj[r][ptr[r]].ff;
        ptr[r]++;
        if(!vis[id]){
            vis[id] = 1;
            dfs(c);
        }
    }
    tour.pb(r);
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);   
    int n, m; cin >> n >> m;
    rep(i,0,m){
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].pb({v, i});
        adj[v].pb({u, i});
    }
    dfs(0);
    vector<int> st;
    vector<bool> in_st(n);
    rep(i,0,sz(tour)){
        if(in_st[tour[i]]){
            cout << tour[i] + 1 << ' ';
            while(st.back() != tour[i]){
                cout << st.back() + 1 << ' ';
                in_st[st.back()] = 0;
                st.pop_back();
            }
            cout << '\n';
        }else{
            st.pb(tour[i]);
            in_st[tour[i]] = 1;
        }
    }
    return 0;
}

Subtask #1
38.0 / 38.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 12364 KB Output is correct
7 Correct 13 ms 13388 KB Output is correct
8 Correct 8 ms 12196 KB Output is correct
9 Correct 44 ms 19692 KB Output is correct
10 Correct 9 ms 12152 KB Output is correct
11 Correct 8 ms 12236 KB Output is correct
12 Correct 49 ms 20064 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12040 KB Output is correct
2 Correct 7 ms 12040 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 12364 KB Output is correct
7 Correct 13 ms 13388 KB Output is correct
8 Correct 8 ms 12184 KB Output is correct
9 Correct 44 ms 19772 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 49 ms 19960 KB Output is correct
13 Correct 68 ms 21820 KB Output is correct
14 Correct 60 ms 19036 KB Output is correct
15 Correct 59 ms 21048 KB Output is correct
16 Correct 65 ms 21828 KB Output is correct
17 Correct 74 ms 16832 KB Output is correct
18 Correct 63 ms 20016 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 9 ms 12236 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 9 ms 12364 KB Output is correct
7 Correct 14 ms 13388 KB Output is correct
8 Correct 8 ms 12240 KB Output is correct
9 Correct 44 ms 19644 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 49 ms 20088 KB Output is correct
13 Correct 69 ms 21824 KB Output is correct
14 Correct 66 ms 19204 KB Output is correct
15 Correct 66 ms 21092 KB Output is correct
16 Correct 66 ms 21868 KB Output is correct
17 Correct 63 ms 16832 KB Output is correct
18 Correct 67 ms 20064 KB Output is correct
19 Correct 466 ms 67628 KB Output is correct
20 Correct 430 ms 54064 KB Output is correct
21 Correct 392 ms 62120 KB Output is correct
22 Correct 466 ms 67684 KB Output is correct
23 Correct 203 ms 52548 KB Output is correct
24 Correct 459 ms 41520 KB Output is correct
25 Correct 466 ms 58808 KB Output is correct