oj.uz

Submission #983019

# Submission time Handle Problem Language Result Execution time Memory
983019 2024-05-15T07:07:02 Z shenfe1 Swapping Cities (APIO20_swap) C++17
50 / 100
 246 ms 80328 KB 
#include "swap.h"
#include <bits/stdc++.h>
 
#pragma optimize("Ofast")
#pragma target("avx2")
 
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert

const int MAX=1e6+15;
const int B=300;
const int N=104;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=2e9;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;
 
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n;
int mark[MAX];
int cost[MAX];
vector<int> g[MAX];

struct DSU{
  int f[MAX];
  int cur;

  void init(int n,int ver){
    cur=ver;
    for(int i=1;i<=n;i++)f[i]=i;
  }

  int get(int v){
    return (f[v]==v?v:f[v]=get(f[v]));
  }

  void unite(int a,int b,bool is,int C){
    a=get(a);
    b=get(b);
    int x=++cur;
    g[x].pb(a);
    g[x].pb(b);
    // cout<<x<<" "<<a<<"\n";
    // cout<<x<<" "<<b<<"\n";
    mark[x]=is;
    cost[x]=C;
    f[a]=f[b]=x;
  }

  void cycle(int a,int C){
    a=get(a);
    int x=++cur;
    cost[x]=C;
    g[x].pb(a);
    // cout<<x<<" "<<a<<"\n";
    mark[x]=1;
    f[a]=x;
  }
}D;

int up[MAX][20];
int tin[MAX],tout[MAX],timer;
int mn[MAX];
int deg[MAX];

void dfs(int v,int p){
  tin[v]=++timer;
  up[v][0]=p;
  // cout<<v<<" "<<p<<"\n";
  for(int i=1;i<20;i++)up[v][i]=up[up[v][i-1]][i-1];
  if(mark[v]){
    mn[v]=cost[v];
  }
  // cout<<v<<" "<<mn[v]<<"\n";
  for(auto to:g[v]){
    if(to==p)continue;
    mn[to]=min(mn[to],mn[v]);
    // cout<<v<<" -> "<<to<<"\n";
    dfs(to,v);
  }
  tout[v]=timer;
}

void dfs1(int v,int p){
  for(auto to:g[v]){
    if(to==p)continue;
    dfs1(to,v);
    // cout<<v<<" -> "<<to<<"\n";
    mn[v]=min(mn[v],mn[to]);
  }
}

void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {
  D.init(N+M,N);
  vector<pair<int,pii>> e;
  for(int i=0;i<M;i++){
    U[i]++;V[i]++;
    e.pb({W[i],{U[i],V[i]}});
  }
  sort(all(e));
  for(auto x:e){
    int w=x.F;
    int u=x.S.F;
    int v=x.S.S;
    // cerr<<w<<" "<<u<<" "<<v<<"\n";
    if(D.get(u)!=D.get(v)){
      deg[u]++;
      deg[v]++;
      bool is=(deg[u]==3||deg[v]==3);
      D.unite(u,v,is,w);
      // cout<<u<<" "<<v<<" "<<D.get(u)<<" "<<D.get(v)<<"\n";
    }
    else{
      D.cycle(u,w);
      // cout<<D.cur<<" "<<w<<"\n";
    }
  }
  // cerr<<1<<"\n";
  for(int i=1;i<=D.cur;i++){
    if(!mark[i])mn[i]=inf;
    else mn[i]=cost[i];
  }
  // cout<<D.get(1)<<"\n";
  dfs1(D.get(1),D.get(1));
  dfs(D.get(1),D.get(1));
  // for(int i=1;i<=D.cur;i++)cout<<i-1<<" "<<mn[i]<<" "<<mark[i]<<" "<<cost[i]<<"\n";
}

int par(int a,int b){
  return (tin[a]<=tin[b]&&tout[b]<=tout[a]);
}

int lca(int a,int b){
  if(par(a,b))return a;
  if(par(b,a))return b;
  for(int i=19;i>=0;i--){
    if(!par(up[a][i],b)){
      a=up[a][i];
    }
  }
  return up[a][0];
}

int getMinimumFuelCapacity(int X, int Y) {
  X++;
  Y++;
  // cout<<mn[X]<<" "<<mn[Y]<<" "<<cost[lca(X,Y)]<<"\n";
  if(max(min(mn[X],mn[Y]),cost[lca(X,Y)])==inf)return -1;
  return max(min(mn[X],mn[Y]),cost[lca(X,Y)]);
}

Compilation message

swap.cpp:4: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    4 | #pragma optimize("Ofast")
      | 
swap.cpp:5: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    5 | #pragma target("avx2")
      |

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25176 KB Output is correct
2 Correct 12 ms 25180 KB Output is correct
3 Correct 12 ms 25220 KB Output is correct
4 Correct 13 ms 25336 KB Output is correct
5 Correct 15 ms 25692 KB Output is correct
6 Correct 12 ms 25436 KB Output is correct
7 Correct 13 ms 25444 KB Output is correct
8 Correct 14 ms 25436 KB Output is correct
9 Correct 98 ms 47560 KB Output is correct
10 Correct 127 ms 52820 KB Output is correct
11 Correct 114 ms 52116 KB Output is correct
12 Correct 129 ms 53812 KB Output is correct
13 Correct 103 ms 57796 KB Output is correct
14 Correct 114 ms 47888 KB Output is correct
15 Correct 191 ms 56880 KB Output is correct
16 Correct 192 ms 55888 KB Output is correct
17 Correct 209 ms 57796 KB Output is correct
18 Correct 228 ms 61628 KB Output is correct
19 Correct 81 ms 34436 KB Output is correct
20 Correct 204 ms 57020 KB Output is correct
21 Correct 196 ms 56212 KB Output is correct
22 Correct 236 ms 58060 KB Output is correct
23 Correct 217 ms 62004 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25176 KB Output is correct
2 Correct 12 ms 25180 KB Output is correct
3 Correct 240 ms 63500 KB Output is correct
4 Correct 199 ms 64916 KB Output is correct
5 Correct 226 ms 64216 KB Output is correct
6 Correct 202 ms 64980 KB Output is correct
7 Correct 201 ms 64708 KB Output is correct
8 Correct 223 ms 63192 KB Output is correct
9 Correct 226 ms 64200 KB Output is correct
10 Correct 246 ms 62888 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25176 KB Output is correct
2 Correct 12 ms 25180 KB Output is correct
3 Correct 12 ms 25220 KB Output is correct
4 Correct 13 ms 25336 KB Output is correct
5 Correct 15 ms 25692 KB Output is correct
6 Correct 12 ms 25436 KB Output is correct
7 Correct 13 ms 25444 KB Output is correct
8 Correct 14 ms 25436 KB Output is correct
9 Correct 13 ms 25180 KB Output is correct
10 Correct 16 ms 25432 KB Output is correct
11 Correct 12 ms 25432 KB Output is correct
12 Correct 12 ms 25436 KB Output is correct
13 Correct 18 ms 25612 KB Output is correct
14 Correct 12 ms 25436 KB Output is correct
15 Correct 12 ms 25436 KB Output is correct
16 Correct 11 ms 25296 KB Output is correct
17 Correct 11 ms 25432 KB Output is correct
18 Correct 14 ms 25432 KB Output is correct
19 Correct 12 ms 25436 KB Output is correct
20 Correct 12 ms 25272 KB Output is correct
21 Correct 13 ms 25436 KB Output is correct
22 Correct 13 ms 25436 KB Output is correct
23 Correct 13 ms 24156 KB Output is correct
24 Correct 12 ms 24412 KB Output is correct
25 Correct 12 ms 24468 KB Output is correct
26 Correct 13 ms 24408 KB Output is correct
27 Correct 13 ms 25436 KB Output is correct
28 Correct 13 ms 25700 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 25180 KB Output is correct
2 Correct 12 ms 25176 KB Output is correct
3 Correct 12 ms 25180 KB Output is correct
4 Correct 12 ms 25220 KB Output is correct
5 Correct 13 ms 25336 KB Output is correct
6 Correct 15 ms 25692 KB Output is correct
7 Correct 12 ms 25436 KB Output is correct
8 Correct 13 ms 25444 KB Output is correct
9 Correct 14 ms 25436 KB Output is correct
10 Correct 98 ms 47560 KB Output is correct
11 Correct 127 ms 52820 KB Output is correct
12 Correct 114 ms 52116 KB Output is correct
13 Correct 129 ms 53812 KB Output is correct
14 Correct 103 ms 57796 KB Output is correct
15 Correct 16 ms 25432 KB Output is correct
16 Correct 12 ms 25432 KB Output is correct
17 Correct 12 ms 25436 KB Output is correct
18 Correct 18 ms 25612 KB Output is correct
19 Correct 12 ms 25436 KB Output is correct
20 Correct 12 ms 25436 KB Output is correct
21 Correct 11 ms 25296 KB Output is correct
22 Correct 11 ms 25432 KB Output is correct
23 Correct 14 ms 25432 KB Output is correct
24 Correct 12 ms 25436 KB Output is correct
25 Correct 12 ms 25272 KB Output is correct
26 Correct 13 ms 25436 KB Output is correct
27 Correct 13 ms 25436 KB Output is correct
28 Correct 13 ms 24156 KB Output is correct
29 Correct 12 ms 24412 KB Output is correct
30 Correct 12 ms 24468 KB Output is correct
31 Correct 13 ms 24408 KB Output is correct
32 Correct 13 ms 25436 KB Output is correct
33 Correct 13 ms 25700 KB Output is correct
34 Correct 22 ms 28956 KB Output is correct
35 Correct 128 ms 53472 KB Output is correct
36 Correct 145 ms 53452 KB Output is correct
37 Correct 125 ms 53616 KB Output is correct
38 Correct 120 ms 53064 KB Output is correct
39 Correct 136 ms 53044 KB Output is correct
40 Correct 110 ms 50624 KB Output is correct
41 Correct 145 ms 53736 KB Output is correct
42 Correct 136 ms 53444 KB Output is correct
43 Correct 114 ms 58820 KB Output is correct
44 Correct 133 ms 53960 KB Output is correct
45 Correct 156 ms 67896 KB Output is correct
46 Correct 126 ms 53440 KB Output is correct
47 Correct 140 ms 53700 KB Output is correct
48 Correct 128 ms 58308 KB Output is correct
49 Correct 128 ms 66752 KB Output is correct
50 Correct 93 ms 57540 KB Output is correct
51 Correct 130 ms 62304 KB Output is correct
52 Correct 166 ms 70332 KB Output is correct
53 Correct 209 ms 73296 KB Output is correct
54 Correct 206 ms 80328 KB Output is correct
55 Correct 101 ms 58324 KB Output is correct
56 Correct 184 ms 75452 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25176 KB Output is correct
2 Correct 12 ms 25180 KB Output is correct
3 Correct 12 ms 25220 KB Output is correct
4 Correct 13 ms 25336 KB Output is correct
5 Correct 15 ms 25692 KB Output is correct
6 Correct 12 ms 25436 KB Output is correct
7 Correct 13 ms 25444 KB Output is correct
8 Correct 14 ms 25436 KB Output is correct
9 Correct 98 ms 47560 KB Output is correct
10 Correct 127 ms 52820 KB Output is correct
11 Correct 114 ms 52116 KB Output is correct
12 Correct 129 ms 53812 KB Output is correct
13 Correct 103 ms 57796 KB Output is correct
14 Correct 114 ms 47888 KB Output is correct
15 Correct 191 ms 56880 KB Output is correct
16 Correct 192 ms 55888 KB Output is correct
17 Correct 209 ms 57796 KB Output is correct
18 Correct 228 ms 61628 KB Output is correct
19 Correct 240 ms 63500 KB Output is correct
20 Correct 199 ms 64916 KB Output is correct
21 Correct 226 ms 64216 KB Output is correct
22 Correct 202 ms 64980 KB Output is correct
23 Correct 201 ms 64708 KB Output is correct
24 Correct 223 ms 63192 KB Output is correct
25 Correct 226 ms 64200 KB Output is correct
26 Correct 246 ms 62888 KB Output is correct
27 Correct 16 ms 25432 KB Output is correct
28 Correct 12 ms 25432 KB Output is correct
29 Correct 12 ms 25436 KB Output is correct
30 Correct 18 ms 25612 KB Output is correct
31 Correct 12 ms 25436 KB Output is correct
32 Correct 12 ms 25436 KB Output is correct
33 Correct 11 ms 25296 KB Output is correct
34 Correct 11 ms 25432 KB Output is correct
35 Correct 14 ms 25432 KB Output is correct
36 Correct 22 ms 28956 KB Output is correct
37 Correct 128 ms 53472 KB Output is correct
38 Correct 145 ms 53452 KB Output is correct
39 Correct 125 ms 53616 KB Output is correct
40 Correct 120 ms 53064 KB Output is correct
41 Correct 136 ms 53044 KB Output is correct
42 Correct 110 ms 50624 KB Output is correct
43 Correct 145 ms 53736 KB Output is correct
44 Correct 136 ms 53444 KB Output is correct
45 Correct 114 ms 58820 KB Output is correct
46 Correct 133 ms 53960 KB Output is correct
47 Correct 28 ms 29060 KB Output is correct
48 Incorrect 204 ms 57460 KB Output isn't correct
49 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 25180 KB Output is correct
2 Correct 12 ms 25176 KB Output is correct
3 Correct 12 ms 25180 KB Output is correct
4 Correct 12 ms 25220 KB Output is correct
5 Correct 13 ms 25336 KB Output is correct
6 Correct 15 ms 25692 KB Output is correct
7 Correct 12 ms 25436 KB Output is correct
8 Correct 13 ms 25444 KB Output is correct
9 Correct 14 ms 25436 KB Output is correct
10 Correct 98 ms 47560 KB Output is correct
11 Correct 127 ms 52820 KB Output is correct
12 Correct 114 ms 52116 KB Output is correct
13 Correct 129 ms 53812 KB Output is correct
14 Correct 103 ms 57796 KB Output is correct
15 Correct 114 ms 47888 KB Output is correct
16 Correct 191 ms 56880 KB Output is correct
17 Correct 192 ms 55888 KB Output is correct
18 Correct 209 ms 57796 KB Output is correct
19 Correct 228 ms 61628 KB Output is correct
20 Correct 240 ms 63500 KB Output is correct
21 Correct 199 ms 64916 KB Output is correct
22 Correct 226 ms 64216 KB Output is correct
23 Correct 202 ms 64980 KB Output is correct
24 Correct 201 ms 64708 KB Output is correct
25 Correct 223 ms 63192 KB Output is correct
26 Correct 226 ms 64200 KB Output is correct
27 Correct 246 ms 62888 KB Output is correct
28 Correct 16 ms 25432 KB Output is correct
29 Correct 12 ms 25432 KB Output is correct
30 Correct 12 ms 25436 KB Output is correct
31 Correct 18 ms 25612 KB Output is correct
32 Correct 12 ms 25436 KB Output is correct
33 Correct 12 ms 25436 KB Output is correct
34 Correct 11 ms 25296 KB Output is correct
35 Correct 11 ms 25432 KB Output is correct
36 Correct 14 ms 25432 KB Output is correct
37 Correct 22 ms 28956 KB Output is correct
38 Correct 128 ms 53472 KB Output is correct
39 Correct 145 ms 53452 KB Output is correct
40 Correct 125 ms 53616 KB Output is correct
41 Correct 120 ms 53064 KB Output is correct
42 Correct 136 ms 53044 KB Output is correct
43 Correct 110 ms 50624 KB Output is correct
44 Correct 145 ms 53736 KB Output is correct
45 Correct 136 ms 53444 KB Output is correct
46 Correct 114 ms 58820 KB Output is correct
47 Correct 133 ms 53960 KB Output is correct
48 Correct 28 ms 29060 KB Output is correct
49 Incorrect 204 ms 57460 KB Output isn't correct
50 Halted 0 ms 0 KB -