oj.uz

답안 #812795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
812795 2023-08-07T11:05:18 Z blackyuki 수천개의 섬 (IOI22_islands) C++17
100 / 100
 151 ms 25272 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
const ll inf=1001001001001;

#include "islands.h"

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
  vvp g(N),rg(N);
  rep(i,M){
    g[U[i]].pb(V[i],i);
    rg[V[i]].pb(U[i],i);
  }
  vi cnt(N);rep(i,N)cnt[i]=g[i].size();
  vb dead(N,false);
  queue<ll> que;
  auto f=[&](ll i){
    que.push(i);
    while(!que.empty()){
      ll t=que.front();que.pop();
      for(auto x:rg[t])if(!dead[x.fi]){
        cnt[x.fi]--;
        if(cnt[x.fi]==0){
          dead[x.fi]=true;que.push(x.fi);
        }
      }
    }
  };
  auto loop=[&](ll s,vp v){
    vi ver;
    ver.pb(s);
    for(auto x:v)ver.pb(x.fi);
    ll i=0;
    while(ver[i]!=ver.back())i++;
    vi res;
    rep(j,i)res.pb(v[j].se);
    REP(j,i,v.size())res.pb(v[j].se);
    for(ll j=i-1;j>=0;j--)res.pb(v[j].se);
    return res;
  };
  auto rloop=[&](ll s,vp v){
    vi ver;
    ver.pb(s);
    for(auto x:v)ver.pb(x.fi);
    ll i=0;
    while(ver[i]!=ver.back())i++;
    vi res;
    rep(j,i)res.pb(v[j].se);
    for(ll j=v.size()-1;j>=i;j--)res.pb(v[j].se);
    for(ll j=i-1;j>=0;j--)res.pb(v[j].se);
    return res;
  };
  rep(i,N)if(!dead[i]&&cnt[i]==0){
    dead[i]=true;f(i);
  }
  if(dead[0])return false;
  ll cur=0;
  vi ans;
  while(true){
    vp nex;
    for(auto x:g[cur])if(!dead[x.fi])nex.pb(x);
    if(nex.size()==0)return false;
    if(nex.size()>1){
      vb seen1(N,false),seen2(N,false);
      vp a1,a2;
      {
        a1.pb(nex[0]);
        seen1[cur]=true;
        ll i=nex[0].fi;
        while(!seen1[i]){
          seen1[i]=true;
          ll j=0;while(dead[g[i][j].fi])j++;
          a1.pb(g[i][j]);
          i=g[i][j].fi;
        }
      }
      {
        a2.pb(nex[1]);
        seen2[cur]=true;
        ll i=nex[1].fi;
        while(!seen1[i]&&!seen2[i]){
          seen2[i]=true;
          ll j=0;while(dead[g[i][j].fi])j++;
          a2.pb(g[i][j]);
          i=g[i][j].fi;
        }
        if(!seen2[i]){
          vi ver;
          vp prev(N,P(-1,-1));
          ver.pb(cur);
          for(auto x:a1)ver.pb(x.fi);
          ll l=0;
          while(ver[l]!=ver.back())l++;
          REP(i,l,ver.size()-1)prev[ver[i]]=P(ver[i+1],a1[i].se);
          if(prev[a2.back().fi]!=P(-1,-1)){
            rep(i,ver.size()-l-1){
              a2.pb(prev[a2.back().fi]);
            }
          }
          else{
            ll idx=0;
            while(a1[idx].fi!=a2.back().fi)idx++;
            REP(i,idx+1,a1.size())a2.pb(a1[i]);
          }
          vi r1=loop(cur,a1),r2=rloop(cur,a2);
          vector<int> res;
          for(ll x:ans)res.pb(x);
          for(ll x:r1)res.pb(x);
          for(ll x:r2)res.pb(x);
          reverse(all(ans));
          for(ll x:ans)res.pb(x);
          return res;
        }
        else{
          vi r1=loop(cur,a1),r2=loop(cur,a2),r3=rloop(cur,a1),r4=rloop(cur,a2);
          vector<int> res;
          for(ll x:ans)res.pb(x);
          for(ll x:r1)res.pb(x);
          for(ll x:r2)res.pb(x);
          for(ll x:r3)res.pb(x);
          for(ll x:r4)res.pb(x);
          reverse(all(ans));
          for(ll x:ans)res.pb(x);
          return res;
        }
      }
    }
    dead[cur]=true;f(cur);
    cur=nex[0].fi;ans.pb(nex[0].se);
  }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 29 ms 12768 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 25 ms 9740 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 16 ms 6316 KB Output is correct
18 Correct 13 ms 5952 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 24 ms 9812 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 27 ms 10156 KB Output is correct
4 Correct 28 ms 11432 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 28 ms 11988 KB Output is correct
21 Correct 29 ms 11832 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 31 ms 11832 KB Output is correct
28 Correct 30 ms 12028 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 34 ms 13900 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 28 ms 11952 KB Output is correct
33 Correct 26 ms 11272 KB Output is correct
34 Correct 16 ms 6484 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 25 ms 10148 KB Output is correct
37 Correct 30 ms 13368 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 24 ms 10344 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 33 ms 13772 KB Output is correct
42 Correct 30 ms 12096 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 13 ms 5808 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 29 ms 12768 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 25 ms 9740 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 16 ms 6316 KB Output is correct
31 Correct 13 ms 5952 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 24 ms 9812 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 13 ms 5456 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 28 ms 9400 KB Output is correct
44 Correct 30 ms 9396 KB Output is correct
45 Correct 30 ms 10300 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 76 ms 22172 KB Output is correct
51 Correct 63 ms 18688 KB Output is correct
52 Correct 77 ms 18704 KB Output is correct
53 Correct 66 ms 20276 KB Output is correct
54 Correct 67 ms 18616 KB Output is correct
55 Correct 67 ms 18636 KB Output is correct
56 Correct 67 ms 20288 KB Output is correct
57 Correct 47 ms 17448 KB Output is correct
58 Correct 72 ms 20084 KB Output is correct
59 Correct 71 ms 19144 KB Output is correct
60 Correct 68 ms 18892 KB Output is correct
61 Correct 69 ms 19120 KB Output is correct
62 Correct 11 ms 4948 KB Output is correct
63 Correct 63 ms 18636 KB Output is correct
64 Correct 18 ms 7380 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 78 ms 20936 KB Output is correct
68 Correct 31 ms 13972 KB Output is correct
69 Correct 46 ms 12756 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 45 ms 13036 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 85 ms 17420 KB Output is correct
74 Correct 74 ms 23712 KB Output is correct
75 Correct 3 ms 1108 KB Output is correct
76 Correct 31 ms 10304 KB Output is correct
77 Correct 54 ms 13652 KB Output is correct
78 Correct 99 ms 19020 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 118 ms 25272 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 27 ms 10736 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 38 ms 9400 KB Output is correct
86 Correct 2 ms 468 KB Output is correct
87 Correct 3 ms 4692 KB Output is correct
88 Correct 2 ms 724 KB Output is correct
89 Correct 76 ms 18772 KB Output is correct
90 Correct 151 ms 19148 KB Output is correct
91 Correct 128 ms 24588 KB Output is correct
92 Correct 0 ms 212 KB Output is correct