oj.uz

Submission #522551

# Submission time Handle Problem Language Result Execution time Memory
522551 2022-02-05T06:52:30 Z PCTprobability Swapping Cities (APIO20_swap) C++14
100 / 100
 315 ms 44908 KB 
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//typedef string::const_iterator State;
//class ParseError {};
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.000000001);
const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=0;while(x){x/=2;y++;}return y;}
 
void cincout() {
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
class UnionFind{
  public:
  vector<ll> time,par,d;
  vector<ll> three,roop;
  ll now;
  //par は親なら自分のサイズ、そうじゃないなら自分の親を入れる
  UnionFind(){
  }
  UnionFind(ll n){
    time.resize(n);
    par.resize(n);
    three.resize(n);
    roop.resize(n);
    d.resize(n);
    now=0;
    for(int i=0;i<n;i++){
      par[i]=1;
      time[i]=inf;
      three[i]=inf;
      roop[i]=inf;
    }
  }
  ll root(ll x,ll ti){
    if(time[x]<=ti) return root(par[x],ti);
    else return x;
  }
  void merge(ll a,ll b){
    d[a]++;
    d[b]++;
    ll x=root(a,now);
    ll y=root(b,now);
    if(d[a]>=3) chmin(three[x],now);
    if(d[b]>=3) chmin(three[y],now);
    if(x==y){
      chmin(roop[x],now);
      now++;
      return;
    }
    if(par[x]<par[y]) swap(x,y);
    if(three[x]>inf/2&&three[y]<inf/2) three[x]=now;
    if(roop[x]>inf/2&&roop[y]<inf/2) roop[x]=now;
    par[x]+=par[y];
    par[y]=x;
    time[y]=now;
    now++;
  }
  bool issame(ll a,ll b,ll ti){
    a=root(a,ti);
    b=root(b,ti);
    return a==b;
  }
};
vector<int> u,v,w;
int n,m;
UnionFind uf;
vector<vector<ll>> d;
int getMinimumFuelCapacity(int X,int Y){
  int x=X,y=Y;
  ll ok=-1,ng=m;
  while(abs(ok-ng)>1){
    ll t=(ok+ng)/2;
    //d[t] 以下の辺だけで行けるか？
    if(uf.issame(x,y,t)==false){
      //行けない
      ok=t;
    }
    else{
      ll v=uf.root(x,t);
      if(uf.roop[v]<=t||uf.three[v]<=t){
        //行ける
        ng=t;
      }
      else{
        //行けない
        ok=t;
      }
    }
  }
  if(ng>=m){
    return -1;
  }
  else{
    return d[ng][0];
  }
}
void init(int N,int M,vector<int> U,vector<int> V,vector<int> W){
  n=N;
  m=M;
  u=U;
  v=V;
  w=W;
  vector<vector<ll>> di;
  for(int i=0;i<m;i++){
    di.pb({w[i],u[i],v[i]});
  }
  sor(di);
  UnionFind ut(n);
  for(int i=0;i<m;i++){
    ut.merge(di[i][1],di[i][2]);
  }
  d=di;
  uf=ut;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 55 ms 17732 KB Output is correct
10 Correct 88 ms 21616 KB Output is correct
11 Correct 87 ms 21364 KB Output is correct
12 Correct 73 ms 22500 KB Output is correct
13 Correct 71 ms 22512 KB Output is correct
14 Correct 69 ms 17892 KB Output is correct
15 Correct 281 ms 23384 KB Output is correct
16 Correct 206 ms 22824 KB Output is correct
17 Correct 205 ms 24052 KB Output is correct
18 Correct 143 ms 24136 KB Output is correct
19 Correct 96 ms 6284 KB Output is correct
20 Correct 243 ms 23380 KB Output is correct
21 Correct 206 ms 22568 KB Output is correct
22 Correct 248 ms 24048 KB Output is correct
23 Correct 141 ms 24072 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 160 ms 22896 KB Output is correct
4 Correct 182 ms 23916 KB Output is correct
5 Correct 155 ms 23184 KB Output is correct
6 Correct 156 ms 23896 KB Output is correct
7 Correct 155 ms 23632 KB Output is correct
8 Correct 176 ms 22660 KB Output is correct
9 Correct 193 ms 23444 KB Output is correct
10 Correct 148 ms 22428 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 2 ms 580 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 588 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 55 ms 17732 KB Output is correct
11 Correct 88 ms 21616 KB Output is correct
12 Correct 87 ms 21364 KB Output is correct
13 Correct 73 ms 22500 KB Output is correct
14 Correct 71 ms 22512 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 2 ms 580 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 9 ms 3208 KB Output is correct
35 Correct 76 ms 22560 KB Output is correct
36 Correct 73 ms 22572 KB Output is correct
37 Correct 68 ms 22584 KB Output is correct
38 Correct 71 ms 22240 KB Output is correct
39 Correct 77 ms 22100 KB Output is correct
40 Correct 69 ms 20280 KB Output is correct
41 Correct 91 ms 22492 KB Output is correct
42 Correct 77 ms 22684 KB Output is correct
43 Correct 67 ms 22624 KB Output is correct
44 Correct 79 ms 22640 KB Output is correct
45 Correct 126 ms 27780 KB Output is correct
46 Correct 78 ms 22704 KB Output is correct
47 Correct 74 ms 22624 KB Output is correct
48 Correct 84 ms 23984 KB Output is correct
49 Correct 133 ms 23364 KB Output is correct
50 Correct 74 ms 18384 KB Output is correct
51 Correct 94 ms 23924 KB Output is correct
52 Correct 168 ms 31600 KB Output is correct
53 Correct 142 ms 34224 KB Output is correct
54 Correct 196 ms 37148 KB Output is correct
55 Correct 82 ms 22640 KB Output is correct
56 Correct 172 ms 33180 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 55 ms 17732 KB Output is correct
10 Correct 88 ms 21616 KB Output is correct
11 Correct 87 ms 21364 KB Output is correct
12 Correct 73 ms 22500 KB Output is correct
13 Correct 71 ms 22512 KB Output is correct
14 Correct 69 ms 17892 KB Output is correct
15 Correct 281 ms 23384 KB Output is correct
16 Correct 206 ms 22824 KB Output is correct
17 Correct 205 ms 24052 KB Output is correct
18 Correct 143 ms 24136 KB Output is correct
19 Correct 160 ms 22896 KB Output is correct
20 Correct 182 ms 23916 KB Output is correct
21 Correct 155 ms 23184 KB Output is correct
22 Correct 156 ms 23896 KB Output is correct
23 Correct 155 ms 23632 KB Output is correct
24 Correct 176 ms 22660 KB Output is correct
25 Correct 193 ms 23444 KB Output is correct
26 Correct 148 ms 22428 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 9 ms 3208 KB Output is correct
37 Correct 76 ms 22560 KB Output is correct
38 Correct 73 ms 22572 KB Output is correct
39 Correct 68 ms 22584 KB Output is correct
40 Correct 71 ms 22240 KB Output is correct
41 Correct 77 ms 22100 KB Output is correct
42 Correct 69 ms 20280 KB Output is correct
43 Correct 91 ms 22492 KB Output is correct
44 Correct 77 ms 22684 KB Output is correct
45 Correct 67 ms 22624 KB Output is correct
46 Correct 79 ms 22640 KB Output is correct
47 Correct 18 ms 3584 KB Output is correct
48 Correct 228 ms 28324 KB Output is correct
49 Correct 221 ms 28296 KB Output is correct
50 Correct 217 ms 28132 KB Output is correct
51 Correct 214 ms 28116 KB Output is correct
52 Correct 205 ms 26612 KB Output is correct
53 Correct 190 ms 20212 KB Output is correct
54 Correct 210 ms 28532 KB Output is correct
55 Correct 198 ms 28244 KB Output is correct
56 Correct 159 ms 28268 KB Output is correct
57 Correct 203 ms 28508 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 55 ms 17732 KB Output is correct
11 Correct 88 ms 21616 KB Output is correct
12 Correct 87 ms 21364 KB Output is correct
13 Correct 73 ms 22500 KB Output is correct
14 Correct 71 ms 22512 KB Output is correct
15 Correct 69 ms 17892 KB Output is correct
16 Correct 281 ms 23384 KB Output is correct
17 Correct 206 ms 22824 KB Output is correct
18 Correct 205 ms 24052 KB Output is correct
19 Correct 143 ms 24136 KB Output is correct
20 Correct 160 ms 22896 KB Output is correct
21 Correct 182 ms 23916 KB Output is correct
22 Correct 155 ms 23184 KB Output is correct
23 Correct 156 ms 23896 KB Output is correct
24 Correct 155 ms 23632 KB Output is correct
25 Correct 176 ms 22660 KB Output is correct
26 Correct 193 ms 23444 KB Output is correct
27 Correct 148 ms 22428 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 9 ms 3208 KB Output is correct
38 Correct 76 ms 22560 KB Output is correct
39 Correct 73 ms 22572 KB Output is correct
40 Correct 68 ms 22584 KB Output is correct
41 Correct 71 ms 22240 KB Output is correct
42 Correct 77 ms 22100 KB Output is correct
43 Correct 69 ms 20280 KB Output is correct
44 Correct 91 ms 22492 KB Output is correct
45 Correct 77 ms 22684 KB Output is correct
46 Correct 67 ms 22624 KB Output is correct
47 Correct 79 ms 22640 KB Output is correct
48 Correct 18 ms 3584 KB Output is correct
49 Correct 228 ms 28324 KB Output is correct
50 Correct 221 ms 28296 KB Output is correct
51 Correct 217 ms 28132 KB Output is correct
52 Correct 214 ms 28116 KB Output is correct
53 Correct 205 ms 26612 KB Output is correct
54 Correct 190 ms 20212 KB Output is correct
55 Correct 210 ms 28532 KB Output is correct
56 Correct 198 ms 28244 KB Output is correct
57 Correct 159 ms 28268 KB Output is correct
58 Correct 203 ms 28508 KB Output is correct
59 Correct 96 ms 6284 KB Output is correct
60 Correct 243 ms 23380 KB Output is correct
61 Correct 206 ms 22568 KB Output is correct
62 Correct 248 ms 24048 KB Output is correct
63 Correct 141 ms 24072 KB Output is correct
64 Correct 1 ms 460 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 1 ms 460 KB Output is correct
67 Correct 1 ms 460 KB Output is correct
68 Correct 1 ms 460 KB Output is correct
69 Correct 1 ms 588 KB Output is correct
70 Correct 2 ms 580 KB Output is correct
71 Correct 2 ms 588 KB Output is correct
72 Correct 1 ms 460 KB Output is correct
73 Correct 2 ms 588 KB Output is correct
74 Correct 126 ms 27780 KB Output is correct
75 Correct 78 ms 22704 KB Output is correct
76 Correct 74 ms 22624 KB Output is correct
77 Correct 84 ms 23984 KB Output is correct
78 Correct 133 ms 23364 KB Output is correct
79 Correct 74 ms 18384 KB Output is correct
80 Correct 94 ms 23924 KB Output is correct
81 Correct 168 ms 31600 KB Output is correct
82 Correct 142 ms 34224 KB Output is correct
83 Correct 196 ms 37148 KB Output is correct
84 Correct 82 ms 22640 KB Output is correct
85 Correct 172 ms 33180 KB Output is correct
86 Correct 58 ms 11928 KB Output is correct
87 Correct 220 ms 28232 KB Output is correct
88 Correct 204 ms 28284 KB Output is correct
89 Correct 183 ms 28572 KB Output is correct
90 Correct 243 ms 30808 KB Output is correct
91 Correct 227 ms 29104 KB Output is correct
92 Correct 204 ms 29408 KB Output is correct
93 Correct 280 ms 38192 KB Output is correct
94 Correct 291 ms 41340 KB Output is correct
95 Correct 315 ms 44908 KB Output is correct
96 Correct 149 ms 28228 KB Output is correct
97 Correct 223 ms 34496 KB Output is correct