oj.uz

답안 #743726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743726 2023-05-17T19:14:03 Z grogu 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 412 ms 88376 KB 
#include "bits/stdc++.h"
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define here cerr<<"---------------------------\n"
#define ceri(a,l,r) {for(ll i = l;i<=r;i++) cerr<<a[i]<< " ";cerr<<endl;}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;

#define maxn 500005
vector<pll> g[maxn];
ll n,m;
bool vis[maxn];
vector<ll> ans;
ll it[maxn];
bool vis2[maxn];
void euler(ll u){
    vis2[u] = 1;
    while(it[u]<sz(g[u])){
      	pll p = g[u][it[u]];
        ll s = p.fi;
        ll j = p.sc;
        it[u]++;
        if(vis[j]) continue;
        vis[j] =1;
        euler(s);
    }
    ans.pb(u);
}
void tc(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> m;
    for(ll i = 1;i<=m;i++){
        ll x,y; cin >> x >> y;
        g[x].pb({y,i});
        g[y].pb({x,i});
    }
    for(ll i = 1;i<=n;i++) if(!vis2[i]) euler(i);
    fill(vis,vis+maxn,0);
    vector<ll> v;
    vector<ll> w;
    for(ll x : ans){
        if(vis[x]==1){
            while(v.back()!=x){
                w.pb(v.back());
                v.popb();
            }
            w.pb(x);
            for(ll y : w){
                vis[y] = 0;
                cout<<y<< " ";
            }
            cout<<endl;
            w.clear();
            vis[x] = 1;
        }else vis[x] = 1,v.pb(x);
    }
}
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12460 KB Output is correct
4 Correct 7 ms 12884 KB Output is correct
5 Correct 6 ms 12724 KB Output is correct
6 Correct 8 ms 13116 KB Output is correct
7 Correct 11 ms 14548 KB Output is correct
8 Correct 7 ms 12756 KB Output is correct
9 Correct 34 ms 23300 KB Output is correct
10 Correct 8 ms 12856 KB Output is correct
11 Correct 8 ms 12884 KB Output is correct
12 Correct 46 ms 23824 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 7 ms 12500 KB Output is correct
3 Correct 6 ms 12456 KB Output is correct
4 Correct 8 ms 12924 KB Output is correct
5 Correct 7 ms 12724 KB Output is correct
6 Correct 9 ms 13088 KB Output is correct
7 Correct 11 ms 14548 KB Output is correct
8 Correct 8 ms 12864 KB Output is correct
9 Correct 38 ms 23236 KB Output is correct
10 Correct 8 ms 12756 KB Output is correct
11 Correct 10 ms 12852 KB Output is correct
12 Correct 42 ms 23932 KB Output is correct
13 Correct 69 ms 27552 KB Output is correct
14 Correct 66 ms 23732 KB Output is correct
15 Correct 58 ms 25588 KB Output is correct
16 Correct 66 ms 27584 KB Output is correct
17 Correct 61 ms 21056 KB Output is correct
18 Correct 55 ms 24564 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12460 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 8 ms 12884 KB Output is correct
5 Correct 7 ms 12628 KB Output is correct
6 Correct 8 ms 13140 KB Output is correct
7 Correct 11 ms 14548 KB Output is correct
8 Correct 8 ms 12884 KB Output is correct
9 Correct 36 ms 23244 KB Output is correct
10 Correct 8 ms 12756 KB Output is correct
11 Correct 7 ms 12884 KB Output is correct
12 Correct 40 ms 23936 KB Output is correct
13 Correct 57 ms 27552 KB Output is correct
14 Correct 56 ms 23668 KB Output is correct
15 Correct 55 ms 25568 KB Output is correct
16 Correct 57 ms 27524 KB Output is correct
17 Correct 61 ms 21068 KB Output is correct
18 Correct 54 ms 24560 KB Output is correct
19 Correct 380 ms 87844 KB Output is correct
20 Correct 363 ms 69052 KB Output is correct
21 Correct 342 ms 77356 KB Output is correct
22 Correct 384 ms 88376 KB Output is correct
23 Correct 152 ms 63448 KB Output is correct
24 Correct 412 ms 55228 KB Output is correct
25 Correct 390 ms 73560 KB Output is correct