oj.uz

Submission #675924

# Submission time Handle Problem Language Result Execution time Memory
675924 2022-12-28T11:44:24 Z Sam_a17 Swapping Cities (APIO20_swap) C++17
17 / 100
 2000 ms 14380 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;
int a[N], n, mx, m, sz[N], p[N], deg[N], mx_edge[N], new_node;
bool exist[N];
set<pair<int, int>> st;
bool flag1 = true;

// dsu
int find(int a) {
  // dbg(a)
  if(a != p[a]) {
    return 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) {
    // dbg("here")
    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;
  mx_edge[new_node] = curr;
  exist[new_node] = (exist[a] || exist[b] || is_possible);

  new_node++;
  return 1;
}

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++) {
    edges.push_back({W[i], {U[i], V[i]}});
  }

  new_node = n;
  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);
  }
}

int getMinimumFuelCapacity(int X, int Y) {
  vector<int> p1, p2;
  int x = X;
  while(true) {
    p1.push_back(x);
    if(x == p[x]) break;
    x = p[x];
  }

  x = Y;
  set<int> si;
  map<int, int> mp;
  int it = 0;
  while(true) {
    p2.push_back(x);
    si.insert(x);
    mp[x] = it++;
    if(x == p[x]) break;
    x = p[x];
  }


  int ft = -1, sc = -1;
  for(int i = 0; i < sz(p1); i++) {
    if(mp.find(p1[i]) != mp.end()) {
      ft = i, sc = mp[p1[i]];
      break;
    }
  }
  
  while(ft < sz(p1) && sc < sz(p2)) {
    if(exist[p1[ft]]) {
      return mx_edge[p1[ft]];
    }
    ft++;
  }
  
  return -1;
}

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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4160 KB Output is correct
3 Correct 3 ms 4284 KB Output is correct
4 Correct 3 ms 4156 KB Output is correct
5 Correct 3 ms 4296 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 40 ms 8320 KB Output is correct
10 Correct 45 ms 9152 KB Output is correct
11 Correct 44 ms 9116 KB Output is correct
12 Correct 47 ms 9280 KB Output is correct
13 Correct 83 ms 11576 KB Output is correct
14 Correct 96 ms 8512 KB Output is correct
15 Correct 661 ms 10748 KB Output is correct
16 Correct 678 ms 10588 KB Output is correct
17 Correct 667 ms 10836 KB Output is correct
18 Execution timed out 2003 ms 14380 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4160 KB Output is correct
3 Execution timed out 2074 ms 10444 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4160 KB Output is correct
3 Correct 3 ms 4284 KB Output is correct
4 Correct 3 ms 4156 KB Output is correct
5 Correct 3 ms 4296 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 3 ms 4296 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 ms 4308 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 3 ms 4276 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 3 ms 4308 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 3 ms 4308 KB Output is correct
24 Correct 3 ms 4308 KB Output is correct
25 Correct 3 ms 4372 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 4 ms 4308 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4160 KB Output is correct
4 Correct 3 ms 4284 KB Output is correct
5 Correct 3 ms 4156 KB Output is correct
6 Correct 3 ms 4296 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 40 ms 8320 KB Output is correct
11 Correct 45 ms 9152 KB Output is correct
12 Correct 44 ms 9116 KB Output is correct
13 Correct 47 ms 9280 KB Output is correct
14 Correct 83 ms 11576 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 ms 4296 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 3 ms 4308 KB Output is correct
20 Correct 3 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 3 ms 4308 KB Output is correct
24 Correct 3 ms 4276 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 3 ms 4308 KB Output is correct
29 Correct 3 ms 4308 KB Output is correct
30 Correct 3 ms 4372 KB Output is correct
31 Correct 3 ms 4308 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 8 ms 5268 KB Output is correct
35 Correct 44 ms 10676 KB Output is correct
36 Correct 47 ms 10560 KB Output is correct
37 Correct 43 ms 10552 KB Output is correct
38 Correct 43 ms 10420 KB Output is correct
39 Correct 43 ms 10396 KB Output is correct
40 Correct 42 ms 9916 KB Output is correct
41 Correct 46 ms 10808 KB Output is correct
42 Correct 44 ms 10540 KB Output is correct
43 Correct 90 ms 12552 KB Output is correct
44 Correct 49 ms 10852 KB Output is correct
45 Execution timed out 2060 ms 13468 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4160 KB Output is correct
3 Correct 3 ms 4284 KB Output is correct
4 Correct 3 ms 4156 KB Output is correct
5 Correct 3 ms 4296 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 40 ms 8320 KB Output is correct
10 Correct 45 ms 9152 KB Output is correct
11 Correct 44 ms 9116 KB Output is correct
12 Correct 47 ms 9280 KB Output is correct
13 Correct 83 ms 11576 KB Output is correct
14 Correct 96 ms 8512 KB Output is correct
15 Correct 661 ms 10748 KB Output is correct
16 Correct 678 ms 10588 KB Output is correct
17 Correct 667 ms 10836 KB Output is correct
18 Execution timed out 2003 ms 14380 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4160 KB Output is correct
4 Correct 3 ms 4284 KB Output is correct
5 Correct 3 ms 4156 KB Output is correct
6 Correct 3 ms 4296 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 40 ms 8320 KB Output is correct
11 Correct 45 ms 9152 KB Output is correct
12 Correct 44 ms 9116 KB Output is correct
13 Correct 47 ms 9280 KB Output is correct
14 Correct 83 ms 11576 KB Output is correct
15 Correct 96 ms 8512 KB Output is correct
16 Correct 661 ms 10748 KB Output is correct
17 Correct 678 ms 10588 KB Output is correct
18 Correct 667 ms 10836 KB Output is correct
19 Execution timed out 2003 ms 14380 KB Time limit exceeded
20 Halted 0 ms 0 KB -