제출 #547034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547034		cig32	Swapping Cities (APIO20_swap)	C++17	17 / 100	2080 ms	24708 KiB

swap

#include "bits/stdc++.h"
using namespace std;
//#define int long long
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
int fastlog(int x) {
  if(x == 0) return -1;
  return 32 - __builtin_clz(x) - 1;
}
void gay(int i) {
  cout << "Case #" << i << ": ";
}
#include "swap.h"
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W);

int getMinimumFuelCapacity(int X, int Y);

int n, m;
vector<pair<int,int> > adj[101010];
struct edge {
  int f, t, w;
};
class cmp {
  public:
  bool operator() (edge x, edge y) {
    return x.w>y.w;
  }
};
vector<edge> mst;
map<pair<int, int>, bool> inmst;
edge e[101010];
int dsu[101010];
int set_of(int u) {
  if(dsu[u]==u) return u;
  return dsu[u]= set_of(dsu[u]);
}
void union_(int u, int v) {
  dsu[set_of(u)] = set_of(v);
}
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  n = N, m = M;
  for(int i=0; i<m; i++) {
    adj[U[i]].push_back({V[i], W[i]});
    adj[V[i]].push_back({U[i], W[i]});
    e[i] = {U[i], V[i], W[i]};
  }
  for(int i=0; i<n; i++) dsu[i] = i;
}
int getMinimumFuelCapacity(int X, int Y) {
  int lb = 1, rb = MOD;
  while(lb < rb) {
    int mid = (lb + rb) >> 1;
    for(int i=0; i<n; i++) dsu[i] = i;
    int deg[n];
    for(int i=0; i<n; i++) deg[i] = 0;
    for(int i=0; i<m; i++) {
      if(e[i].w <= mid) {
        deg[e[i].f]++;
        deg[e[i].t]++;
      }
      if(e[i].w <= mid && set_of(e[i].f) != set_of(e[i].t)) {
        union_(e[i].f, e[i].t);
      }
    }
    int ma = 0;
    for(int i=0; i<n; i++ ){
      if(set_of(X)== set_of(i)) ma = max(ma, deg[i]);
    }
    int cntnodes = 0, cntedges = 0;
    for(int i=0; i<n; i++) {
      if(set_of(X) == set_of(i)) cntnodes++;
    }
    for(int i=0; i<m; i++) {
      if(e[i].w <= mid && set_of(e[i].f) == set_of(X)) cntedges++;
    }
    if(set_of(X) == set_of(Y) && (ma >= 3 || cntnodes != cntedges + 1)) {
      rb = mid;
    } 
    else {
      lb = mid +1 ;
    }
  }
  return (lb == MOD ? -1 : lb);
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 17 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27