oj.uz

Submission #744996

# Submission time Handle Problem Language Result Execution time Memory
744996 2023-05-19T09:41:31 Z arush_agu Swapping Cities (APIO20_swap) C++17
50 / 100
 2000 ms 27060 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

int n, m;
vl u, v, w;
vvll adj;

bool sub1 = 0;
int mx_w;

bool sub2 = 0;
vll w_sort;

struct DSU {
  int nn;
  vi par, sz;

  void init(int nnn) {
    nn = nnn;
    par = vi(nn, -1); sz = vi(nn, 1);
  }

  int find(int x) {
    if (par[x] == -1) return x;
    return par[x] = find(par[x]);
  }

  void merge(int x, int y) {
    x = find(x); y = find(y);
    if (x == y) return;
    if (sz[x] < sz[y]) swap(x, y);
    par[y] = x;
    sz[x] += sz[y];
  }
} dsu;

void init(int nn, int mm, vi uu, vi vv, vi ww) {
  n = nn, m = mm;
  for (int &x : uu) u.push_back(x);
  for (int &x : vv) v.push_back(x);
  for (int &x : ww) w.push_back(x);
  adj = vvll(n);
  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]});
  }

  dsu.init(n);

  sub1 = 1;
  for (int i=0; i<m; i++) if (adj[i].size() > 2) {
    sub1 = 0; break;
  }
  if (sub1) mx_w = *max_element(all(w));

  sub2 = 1;
  if (m != n - 1) sub2 = 0;
  for (int i=0; i<m; i++) if (u[i] != 0) {
    sub2 = 0;
    break;
  }
  if (sub2) {
    w_sort = vll(m); for (int i=0; i<m; i++) w_sort[i] = {w[i], v[i]};
    sort(all(w_sort));
  }
}

int getMinimumFuelCapacity(int x, int y) {
  if (sub1) {
    if (m == n - 1) return -1;
    assert(m == n);
    return mx_w;
  }

  if (sub2) {
    if (x > y) swap(x, y);
    if (x == 0) {
      if (y == w_sort[0].second || y == w_sort[1].second)
        return w_sort[2].first;
      return max(adj[y][0].second, w_sort[1].first);
    }

    if (adj[x][0].second > adj[y][0].second) swap(x, y);
    if (w_sort[0].first == adj[x][0].second && w_sort[1].first == adj[y][0].second) return w_sort[2].first;
    return adj[y][0].second;
  }

  auto check = [&](int mid) {
    for (int i=0; i<n; i++) dsu.par[i] = -1, dsu.sz[i] = 1;
    vi deg(n);
    for (int i=0; i<m; i++) if (w[i] <= mid) {
      dsu.merge(u[i], v[i]);
      deg[u[i]]++, deg[v[i]]++;
    }

    if (dsu.find(x) != dsu.find(y)) return 0;

    int cnt = 0;
    int cnt_1deg = 0, cnt_2deg = 0;
    for (int i=0; i<n; i++) if (dsu.find(x) == dsu.find(i)) {
      cnt++;
      if (deg[i] == 1) cnt_1deg++;
      if (deg[i] == 2) cnt_2deg++;
    }

    if (cnt_1deg == 2 && cnt_2deg == cnt - 2) return 0;
    return 1;
  };

  ll l = 1, r = INF, ans = INF;
  while (l <= r) {
    ll mid = (l + r) / 2;
    if (check(mid)) {
      ans = mid;
      r = mid - 1;
    } else l = mid + 1;
  }
  return ans;
}

#ifdef DEBUG
void solve() {
  int n, m; cin >> n >> m;
  vi u(m), v(m), w(m);
  for (int i=0; i<m; i++) {
    cin >> u[i] >> v[i] >> w[i];
  }

  init(n, m, u, v, w);

  int q; cin >> q;
  while (q--) {
    int x, y; cin >> x >> y;
    cout << getMinimumFuelCapacity(x, y) << "\n";
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  /* cin >> test_cases; */

  while (test_cases--)
    solve();

  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
  return 0;
}
#endif

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 44 ms 10572 KB Output is correct
10 Correct 55 ms 12808 KB Output is correct
11 Correct 55 ms 12548 KB Output is correct
12 Correct 62 ms 13364 KB Output is correct
13 Correct 66 ms 13368 KB Output is correct
14 Correct 49 ms 10688 KB Output is correct
15 Correct 109 ms 14644 KB Output is correct
16 Correct 100 ms 14376 KB Output is correct
17 Correct 105 ms 15140 KB Output is correct
18 Correct 106 ms 15040 KB Output is correct
19 Correct 51 ms 5812 KB Output is correct
20 Correct 103 ms 16008 KB Output is correct
21 Correct 103 ms 15660 KB Output is correct
22 Correct 107 ms 16576 KB Output is correct
23 Correct 115 ms 16552 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 106 ms 16676 KB Output is correct
4 Correct 108 ms 17184 KB Output is correct
5 Correct 110 ms 17124 KB Output is correct
6 Correct 105 ms 17068 KB Output is correct
7 Correct 110 ms 17164 KB Output is correct
8 Correct 108 ms 16520 KB Output is correct
9 Correct 110 ms 17044 KB Output is correct
10 Correct 105 ms 16412 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 5 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 6 ms 468 KB Output is correct
27 Correct 5 ms 436 KB Output is correct
28 Correct 5 ms 532 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 44 ms 10572 KB Output is correct
11 Correct 55 ms 12808 KB Output is correct
12 Correct 55 ms 12548 KB Output is correct
13 Correct 62 ms 13364 KB Output is correct
14 Correct 66 ms 13368 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 5 ms 468 KB Output is correct
30 Correct 5 ms 468 KB Output is correct
31 Correct 6 ms 468 KB Output is correct
32 Correct 5 ms 436 KB Output is correct
33 Correct 5 ms 532 KB Output is correct
34 Correct 21 ms 2004 KB Output is correct
35 Correct 680 ms 13336 KB Output is correct
36 Correct 692 ms 15160 KB Output is correct
37 Correct 678 ms 15156 KB Output is correct
38 Correct 664 ms 14976 KB Output is correct
39 Correct 659 ms 14860 KB Output is correct
40 Correct 637 ms 13752 KB Output is correct
41 Correct 720 ms 15408 KB Output is correct
42 Correct 697 ms 15180 KB Output is correct
43 Correct 593 ms 15148 KB Output is correct
44 Correct 651 ms 15432 KB Output is correct
45 Correct 652 ms 20296 KB Output is correct
46 Correct 684 ms 15140 KB Output is correct
47 Correct 694 ms 15156 KB Output is correct
48 Correct 680 ms 16440 KB Output is correct
49 Correct 107 ms 20168 KB Output is correct
50 Correct 118 ms 15068 KB Output is correct
51 Correct 467 ms 17668 KB Output is correct
52 Correct 854 ms 22740 KB Output is correct
53 Correct 723 ms 24796 KB Output is correct
54 Correct 964 ms 27060 KB Output is correct
55 Correct 664 ms 15176 KB Output is correct
56 Correct 930 ms 24052 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 44 ms 10572 KB Output is correct
10 Correct 55 ms 12808 KB Output is correct
11 Correct 55 ms 12548 KB Output is correct
12 Correct 62 ms 13364 KB Output is correct
13 Correct 66 ms 13368 KB Output is correct
14 Correct 49 ms 10688 KB Output is correct
15 Correct 109 ms 14644 KB Output is correct
16 Correct 100 ms 14376 KB Output is correct
17 Correct 105 ms 15140 KB Output is correct
18 Correct 106 ms 15040 KB Output is correct
19 Correct 106 ms 16676 KB Output is correct
20 Correct 108 ms 17184 KB Output is correct
21 Correct 110 ms 17124 KB Output is correct
22 Correct 105 ms 17068 KB Output is correct
23 Correct 110 ms 17164 KB Output is correct
24 Correct 108 ms 16520 KB Output is correct
25 Correct 110 ms 17044 KB Output is correct
26 Correct 105 ms 16412 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 5 ms 340 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 21 ms 2004 KB Output is correct
37 Correct 680 ms 13336 KB Output is correct
38 Correct 692 ms 15160 KB Output is correct
39 Correct 678 ms 15156 KB Output is correct
40 Correct 664 ms 14976 KB Output is correct
41 Correct 659 ms 14860 KB Output is correct
42 Correct 637 ms 13752 KB Output is correct
43 Correct 720 ms 15408 KB Output is correct
44 Correct 697 ms 15180 KB Output is correct
45 Correct 593 ms 15148 KB Output is correct
46 Correct 651 ms 15432 KB Output is correct
47 Execution timed out 2053 ms 2516 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 44 ms 10572 KB Output is correct
11 Correct 55 ms 12808 KB Output is correct
12 Correct 55 ms 12548 KB Output is correct
13 Correct 62 ms 13364 KB Output is correct
14 Correct 66 ms 13368 KB Output is correct
15 Correct 49 ms 10688 KB Output is correct
16 Correct 109 ms 14644 KB Output is correct
17 Correct 100 ms 14376 KB Output is correct
18 Correct 105 ms 15140 KB Output is correct
19 Correct 106 ms 15040 KB Output is correct
20 Correct 106 ms 16676 KB Output is correct
21 Correct 108 ms 17184 KB Output is correct
22 Correct 110 ms 17124 KB Output is correct
23 Correct 105 ms 17068 KB Output is correct
24 Correct 110 ms 17164 KB Output is correct
25 Correct 108 ms 16520 KB Output is correct
26 Correct 110 ms 17044 KB Output is correct
27 Correct 105 ms 16412 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 5 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 21 ms 2004 KB Output is correct
38 Correct 680 ms 13336 KB Output is correct
39 Correct 692 ms 15160 KB Output is correct
40 Correct 678 ms 15156 KB Output is correct
41 Correct 664 ms 14976 KB Output is correct
42 Correct 659 ms 14860 KB Output is correct
43 Correct 637 ms 13752 KB Output is correct
44 Correct 720 ms 15408 KB Output is correct
45 Correct 697 ms 15180 KB Output is correct
46 Correct 593 ms 15148 KB Output is correct
47 Correct 651 ms 15432 KB Output is correct
48 Execution timed out 2053 ms 2516 KB Time limit exceeded
49 Halted 0 ms 0 KB -