Submission #730095

#	Time	Username	Problem	Language	Result	Execution time	Memory
730095		Sam_a17	Reconstruction Project (JOI22_reconstruction)	C++17	7 / 100	5032 ms	10520 KiB

reconstruction

#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(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
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(deque <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 << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// 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 != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "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 = 5e2 + 10;
vector<pair<int, long long>> adj[N];
int p[N], sz[N], n, m, q, comp;


// dsu
void init() {
  comp = n;
  for(int i = 1; i <= n; i++) {
    p[i] = i, sz[i] = 1;
  }
}

int find(int 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) {
  a = find(a), b = find(b);
  if(a == b) {
    return 0;
  }
  if(sz[b] > sz[a]) {
    swap(a, b);
  }
  comp--;
  p[b] = a, sz[a] += sz[b];
  return 1;
}

void solve_() {
  cin >> n >> m;

  vector<pair<int, pair<int, int>>> edges;
  for(int i = 1; i <= m; i++) {
    int x, y, z; cin >> x >> y >> z;
    edges.push_back({z, {x, y}});
    adj[x].push_back({y, z});
    adj[y].push_back({x, z});
  }

  sort(all(edges));

  cin >> q;
  while(q--) {
    int x; cin >> x;
    auto it = lower_bound(all(edges), make_pair(x, make_pair(0, 0)));
    int l = 0, r = m - 1;
    if(it != edges.end()) {
      r = it - edges.begin();
    }

    if(it != edges.begin()) {
      it = prev(it);
      l = it - edges.begin();
    }

    init();
    long long answ = 0;
    while(comp != 1) {
      if(l >= 0 && r <= m - 1) {
        int first = abs(edges[l].first - x);
        int second = abs(edges[r].first - x);
        if(first > second) {
          if(merge(edges[r].second.first, edges[r].second.second)) {
            answ += second;
          }
          r++;
        } else {
          if(merge(edges[l].second.first, edges[l].second.second)) {
            answ += first;
          }
          l--;
        }
      } else if(l >= 0) {
        int first = abs(edges[l].first - x);
        if(merge(edges[l].second.first, edges[l].second.second)) {
          answ += first;
        }
        l--;
      } else if(r <= m - 1) {
        int second = abs(edges[r].first - x);
        if(merge(edges[r].second.first, edges[r].second.second)) {
          answ += second;
        }
        r++;
      }
    }

    cout << answ << '\n';
  }


}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
} 

Compilation message (stderr)

reconstruction.cpp: In function 'void setIO(std::string)':
reconstruction.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
reconstruction.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23