제출 #675924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675924		Sam_a17	자매 도시 (APIO20_swap)	C++17	17 / 100	2074 ms	14380 KiB

swap

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 0 / 7
• Subtask 3: 17 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27