oj.uz

답안 #675931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675931 2022-12-28T12:03:18 Z Sam_a17 자매 도시 (APIO20_swap) C++17
100 / 100
 711 ms 52552 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e5 + 10, LOG = 22;
int a[N], n, mx, m, sz[N], p[N], deg[N], mx_edge[N], new_node;
vector<int> adj[N];
int up[N][LOG], in[N], depths[N];
bool exist[N];
set<pair<int, int>> st;
bool flag1 = true;

// dsu
int find(int a) {
  // dbg(a)
  if(a != p[a]) {
    p[a] = find(p[a]);
  }
  return p[a];
}

int same(int a, int b) {
  if(find(a) == find(b)) {
    return 1;
  }
  return 0;
}

int merge(int a, int b, int curr) {
  deg[a]++, deg[b]++;
  bool is_possible = false;
  if(deg[a] >= 3 || deg[b] >= 3) is_possible = true; 
  a = find(a), b = find(b);
  if(a == b) {
    if(!exist[a]) {
      mx_edge[a] = curr;
      exist[a] = true;
    }
    return 0;
  }

  if(sz[b] > sz[a]) {
    swap(a, b);
  }

  sz[new_node] = sz[a] + sz[b];
  p[b] = new_node, p[a] = new_node;
  
  //
  adj[new_node].push_back(a);
  adj[new_node].push_back(b);
  in[a]++, in[b]++;

  up[b][0] = new_node, up[a][0] = new_node;
  mx_edge[new_node] = curr;
  exist[new_node] = (exist[a] || exist[b] || is_possible);

  new_node++;
  return 1;
}

void dfs(int node, int parent) {
  depths[node] = depths[parent] + 1;
  for(auto i: adj[node]) {
    dfs(i, node);
  }
}

int lca(int a, int b) {
  if(a == b) {
    return a;
  }

  if(depths[a] > depths[b]) {
    swap(a, b);
  }

  int delta = depths[b] - depths[a];
  for(int i = 0; i < LOG; i++) {
    if(delta & (1 << i)) {
      b = up[b][i];
    }
  }

  if(a == b) {
    return a;
  }

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

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  n = N, m = M;
  vector<pair<int, pair<int, int>>> edges;
  for(int i = 0; i < M; i++) {
    U[i]++, V[i]++;
    edges.push_back({W[i], {U[i], V[i]}});
  }

  new_node = n + 1;
  sort(all(edges));

  for(int i = 0; i < ::N; i++) {
    p[i] = i, sz[i] = 1;
  }

  for(int i = 0; i < M; i++) {
    merge(edges[i].second.first, edges[i].second.second, edges[i].first);
  }

  for(int i = 1; i < LOG; i++) {
    for(int j = 1; j < new_node; j++) {
      up[j][i] = up[up[j][i - 1]][i - 1];
    }
  }

  for(int i = 1; i < new_node; i++) {
    if(!in[i]) {
      dfs(i, 0);
    }
  }
}

int getMinimumFuelCapacity(int X, int Y) {
  X++,Y++;

  int lc = lca(X, Y);
  int ina = 0, inb = N - 10, answ = -1;
  while(ina <= inb) {
    int mid = (ina + inb) / 2;
    int curr = lc;
    for(int i = 0; i < LOG; i++) {
      if(mid & (1 << i)) {
        curr = up[curr][i];  
      } 
    }

    if(!curr) {
      inb = mid - 1;
      continue;
    }

    if(exist[curr]) {
      answ = mid;
      inb = mid - 1;
    } else {
      ina = mid + 1;
    }
  }
  
  if(answ == -1) {
    return answ;
  }

  int curr = lc;
  for(int i = 0; i < LOG; i++) {
    if(answ & (1 << i)) {
      curr = up[curr][i];  
    } 
  }
  return mx_edge[curr];
}

Compilation message

swap.cpp: In function 'void setIO(std::string)':
swap.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
swap.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 16084 KB Output is correct
5 Correct 9 ms 16232 KB Output is correct
6 Correct 9 ms 16212 KB Output is correct
7 Correct 11 ms 16180 KB Output is correct
8 Correct 11 ms 16248 KB Output is correct
9 Correct 90 ms 36656 KB Output is correct
10 Correct 114 ms 41252 KB Output is correct
11 Correct 112 ms 40820 KB Output is correct
12 Correct 119 ms 42288 KB Output is correct
13 Correct 117 ms 43592 KB Output is correct
14 Correct 122 ms 36768 KB Output is correct
15 Correct 361 ms 43020 KB Output is correct
16 Correct 371 ms 42304 KB Output is correct
17 Correct 394 ms 43808 KB Output is correct
18 Correct 677 ms 45124 KB Output is correct
19 Correct 199 ms 23492 KB Output is correct
20 Correct 351 ms 43340 KB Output is correct
21 Correct 377 ms 42688 KB Output is correct
22 Correct 377 ms 44280 KB Output is correct
23 Correct 693 ms 45568 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 659 ms 45200 KB Output is correct
4 Correct 655 ms 47204 KB Output is correct
5 Correct 674 ms 46428 KB Output is correct
6 Correct 668 ms 47104 KB Output is correct
7 Correct 703 ms 46908 KB Output is correct
8 Correct 693 ms 45928 KB Output is correct
9 Correct 711 ms 46504 KB Output is correct
10 Correct 697 ms 45448 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 16084 KB Output is correct
5 Correct 9 ms 16232 KB Output is correct
6 Correct 9 ms 16212 KB Output is correct
7 Correct 11 ms 16180 KB Output is correct
8 Correct 11 ms 16248 KB Output is correct
9 Correct 8 ms 15956 KB Output is correct
10 Correct 10 ms 16280 KB Output is correct
11 Correct 10 ms 16284 KB Output is correct
12 Correct 9 ms 16212 KB Output is correct
13 Correct 9 ms 16212 KB Output is correct
14 Correct 9 ms 16156 KB Output is correct
15 Correct 9 ms 16284 KB Output is correct
16 Correct 9 ms 16212 KB Output is correct
17 Correct 9 ms 16184 KB Output is correct
18 Correct 9 ms 16212 KB Output is correct
19 Correct 8 ms 16212 KB Output is correct
20 Correct 11 ms 16280 KB Output is correct
21 Correct 11 ms 16212 KB Output is correct
22 Correct 9 ms 16144 KB Output is correct
23 Correct 9 ms 16104 KB Output is correct
24 Correct 10 ms 16212 KB Output is correct
25 Correct 9 ms 16212 KB Output is correct
26 Correct 9 ms 16212 KB Output is correct
27 Correct 9 ms 16212 KB Output is correct
28 Correct 9 ms 16212 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 9 ms 16232 KB Output is correct
7 Correct 9 ms 16212 KB Output is correct
8 Correct 11 ms 16180 KB Output is correct
9 Correct 11 ms 16248 KB Output is correct
10 Correct 90 ms 36656 KB Output is correct
11 Correct 114 ms 41252 KB Output is correct
12 Correct 112 ms 40820 KB Output is correct
13 Correct 119 ms 42288 KB Output is correct
14 Correct 117 ms 43592 KB Output is correct
15 Correct 10 ms 16280 KB Output is correct
16 Correct 10 ms 16284 KB Output is correct
17 Correct 9 ms 16212 KB Output is correct
18 Correct 9 ms 16212 KB Output is correct
19 Correct 9 ms 16156 KB Output is correct
20 Correct 9 ms 16284 KB Output is correct
21 Correct 9 ms 16212 KB Output is correct
22 Correct 9 ms 16184 KB Output is correct
23 Correct 9 ms 16212 KB Output is correct
24 Correct 8 ms 16212 KB Output is correct
25 Correct 11 ms 16280 KB Output is correct
26 Correct 11 ms 16212 KB Output is correct
27 Correct 9 ms 16144 KB Output is correct
28 Correct 9 ms 16104 KB Output is correct
29 Correct 10 ms 16212 KB Output is correct
30 Correct 9 ms 16212 KB Output is correct
31 Correct 9 ms 16212 KB Output is correct
32 Correct 9 ms 16212 KB Output is correct
33 Correct 9 ms 16212 KB Output is correct
34 Correct 17 ms 19604 KB Output is correct
35 Correct 115 ms 42276 KB Output is correct
36 Correct 117 ms 42304 KB Output is correct
37 Correct 113 ms 42200 KB Output is correct
38 Correct 114 ms 41896 KB Output is correct
39 Correct 116 ms 41784 KB Output is correct
40 Correct 109 ms 39616 KB Output is correct
41 Correct 127 ms 42328 KB Output is correct
42 Correct 114 ms 42244 KB Output is correct
43 Correct 111 ms 43976 KB Output is correct
44 Correct 117 ms 42332 KB Output is correct
45 Correct 120 ms 39744 KB Output is correct
46 Correct 115 ms 44052 KB Output is correct
47 Correct 119 ms 44020 KB Output is correct
48 Correct 118 ms 44744 KB Output is correct
49 Correct 67 ms 24644 KB Output is correct
50 Correct 56 ms 24320 KB Output is correct
51 Correct 100 ms 38244 KB Output is correct
52 Correct 150 ms 47844 KB Output is correct
53 Correct 152 ms 49148 KB Output is correct
54 Correct 161 ms 49720 KB Output is correct
55 Correct 113 ms 45716 KB Output is correct
56 Correct 151 ms 49260 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 16084 KB Output is correct
5 Correct 9 ms 16232 KB Output is correct
6 Correct 9 ms 16212 KB Output is correct
7 Correct 11 ms 16180 KB Output is correct
8 Correct 11 ms 16248 KB Output is correct
9 Correct 90 ms 36656 KB Output is correct
10 Correct 114 ms 41252 KB Output is correct
11 Correct 112 ms 40820 KB Output is correct
12 Correct 119 ms 42288 KB Output is correct
13 Correct 117 ms 43592 KB Output is correct
14 Correct 122 ms 36768 KB Output is correct
15 Correct 361 ms 43020 KB Output is correct
16 Correct 371 ms 42304 KB Output is correct
17 Correct 394 ms 43808 KB Output is correct
18 Correct 677 ms 45124 KB Output is correct
19 Correct 659 ms 45200 KB Output is correct
20 Correct 655 ms 47204 KB Output is correct
21 Correct 674 ms 46428 KB Output is correct
22 Correct 668 ms 47104 KB Output is correct
23 Correct 703 ms 46908 KB Output is correct
24 Correct 693 ms 45928 KB Output is correct
25 Correct 711 ms 46504 KB Output is correct
26 Correct 697 ms 45448 KB Output is correct
27 Correct 10 ms 16280 KB Output is correct
28 Correct 10 ms 16284 KB Output is correct
29 Correct 9 ms 16212 KB Output is correct
30 Correct 9 ms 16212 KB Output is correct
31 Correct 9 ms 16156 KB Output is correct
32 Correct 9 ms 16284 KB Output is correct
33 Correct 9 ms 16212 KB Output is correct
34 Correct 9 ms 16184 KB Output is correct
35 Correct 9 ms 16212 KB Output is correct
36 Correct 17 ms 19604 KB Output is correct
37 Correct 115 ms 42276 KB Output is correct
38 Correct 117 ms 42304 KB Output is correct
39 Correct 113 ms 42200 KB Output is correct
40 Correct 114 ms 41896 KB Output is correct
41 Correct 116 ms 41784 KB Output is correct
42 Correct 109 ms 39616 KB Output is correct
43 Correct 127 ms 42328 KB Output is correct
44 Correct 114 ms 42244 KB Output is correct
45 Correct 111 ms 43976 KB Output is correct
46 Correct 117 ms 42332 KB Output is correct
47 Correct 41 ms 19860 KB Output is correct
48 Correct 395 ms 48024 KB Output is correct
49 Correct 392 ms 48020 KB Output is correct
50 Correct 386 ms 47932 KB Output is correct
51 Correct 384 ms 47756 KB Output is correct
52 Correct 364 ms 46148 KB Output is correct
53 Correct 350 ms 39828 KB Output is correct
54 Correct 378 ms 48640 KB Output is correct
55 Correct 386 ms 48004 KB Output is correct
56 Correct 630 ms 49312 KB Output is correct
57 Correct 436 ms 48708 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 9 ms 16232 KB Output is correct
7 Correct 9 ms 16212 KB Output is correct
8 Correct 11 ms 16180 KB Output is correct
9 Correct 11 ms 16248 KB Output is correct
10 Correct 90 ms 36656 KB Output is correct
11 Correct 114 ms 41252 KB Output is correct
12 Correct 112 ms 40820 KB Output is correct
13 Correct 119 ms 42288 KB Output is correct
14 Correct 117 ms 43592 KB Output is correct
15 Correct 122 ms 36768 KB Output is correct
16 Correct 361 ms 43020 KB Output is correct
17 Correct 371 ms 42304 KB Output is correct
18 Correct 394 ms 43808 KB Output is correct
19 Correct 677 ms 45124 KB Output is correct
20 Correct 659 ms 45200 KB Output is correct
21 Correct 655 ms 47204 KB Output is correct
22 Correct 674 ms 46428 KB Output is correct
23 Correct 668 ms 47104 KB Output is correct
24 Correct 703 ms 46908 KB Output is correct
25 Correct 693 ms 45928 KB Output is correct
26 Correct 711 ms 46504 KB Output is correct
27 Correct 697 ms 45448 KB Output is correct
28 Correct 10 ms 16280 KB Output is correct
29 Correct 10 ms 16284 KB Output is correct
30 Correct 9 ms 16212 KB Output is correct
31 Correct 9 ms 16212 KB Output is correct
32 Correct 9 ms 16156 KB Output is correct
33 Correct 9 ms 16284 KB Output is correct
34 Correct 9 ms 16212 KB Output is correct
35 Correct 9 ms 16184 KB Output is correct
36 Correct 9 ms 16212 KB Output is correct
37 Correct 17 ms 19604 KB Output is correct
38 Correct 115 ms 42276 KB Output is correct
39 Correct 117 ms 42304 KB Output is correct
40 Correct 113 ms 42200 KB Output is correct
41 Correct 114 ms 41896 KB Output is correct
42 Correct 116 ms 41784 KB Output is correct
43 Correct 109 ms 39616 KB Output is correct
44 Correct 127 ms 42328 KB Output is correct
45 Correct 114 ms 42244 KB Output is correct
46 Correct 111 ms 43976 KB Output is correct
47 Correct 117 ms 42332 KB Output is correct
48 Correct 41 ms 19860 KB Output is correct
49 Correct 395 ms 48024 KB Output is correct
50 Correct 392 ms 48020 KB Output is correct
51 Correct 386 ms 47932 KB Output is correct
52 Correct 384 ms 47756 KB Output is correct
53 Correct 364 ms 46148 KB Output is correct
54 Correct 350 ms 39828 KB Output is correct
55 Correct 378 ms 48640 KB Output is correct
56 Correct 386 ms 48004 KB Output is correct
57 Correct 630 ms 49312 KB Output is correct
58 Correct 436 ms 48708 KB Output is correct
59 Correct 199 ms 23492 KB Output is correct
60 Correct 351 ms 43340 KB Output is correct
61 Correct 377 ms 42688 KB Output is correct
62 Correct 377 ms 44280 KB Output is correct
63 Correct 693 ms 45568 KB Output is correct
64 Correct 8 ms 16212 KB Output is correct
65 Correct 11 ms 16280 KB Output is correct
66 Correct 11 ms 16212 KB Output is correct
67 Correct 9 ms 16144 KB Output is correct
68 Correct 9 ms 16104 KB Output is correct
69 Correct 10 ms 16212 KB Output is correct
70 Correct 9 ms 16212 KB Output is correct
71 Correct 9 ms 16212 KB Output is correct
72 Correct 9 ms 16212 KB Output is correct
73 Correct 9 ms 16212 KB Output is correct
74 Correct 120 ms 39744 KB Output is correct
75 Correct 115 ms 44052 KB Output is correct
76 Correct 119 ms 44020 KB Output is correct
77 Correct 118 ms 44744 KB Output is correct
78 Correct 67 ms 24644 KB Output is correct
79 Correct 56 ms 24320 KB Output is correct
80 Correct 100 ms 38244 KB Output is correct
81 Correct 150 ms 47844 KB Output is correct
82 Correct 152 ms 49148 KB Output is correct
83 Correct 161 ms 49720 KB Output is correct
84 Correct 113 ms 45716 KB Output is correct
85 Correct 151 ms 49260 KB Output is correct
86 Correct 116 ms 27096 KB Output is correct
87 Correct 448 ms 47924 KB Output is correct
88 Correct 387 ms 47916 KB Output is correct
89 Correct 502 ms 46948 KB Output is correct
90 Correct 285 ms 28756 KB Output is correct
91 Correct 301 ms 30292 KB Output is correct
92 Correct 450 ms 41792 KB Output is correct
93 Correct 414 ms 51004 KB Output is correct
94 Correct 520 ms 51896 KB Output is correct
95 Correct 435 ms 52552 KB Output is correct
96 Correct 633 ms 49444 KB Output is correct
97 Correct 534 ms 50900 KB Output is correct