oj.uz

Submission #915685

# Submission time Handle Problem Language Result Execution time Memory
915685 2024-01-24T14:34:31 Z duckindog Swapping Cities (APIO20_swap) C++14
43 / 100
 1171 ms 27768 KB 
#include<bits/stdc++.h>

using namespace std;

//#define LOCAL

#ifndef LOCAL
#include "swap.h"
#endif // LOCAL

const int N = 1e5 + 10;

int n, m;
vector<pair<int, int>> ad[N];

vector<int> co;
bool sub1 = 1, sub2 = 1;
int maxw = 0;

int par[N];
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  n = N; m = M;
  for (int i = 0; i < m; ++i) {
    int u = U[i], v = V[i], w = W[i];
    co.push_back(w);
    ad[u].push_back({v, w});
    ad[v].push_back({u, w});
    maxw = max(maxw, w);
    if (ad[u].size() > 2 || ad[v].size() > 2) sub1 = 0;
    if (u) {
      sub2 = 0;
      par[v] = w;
    }
  }
  if (m != n - 1) sub2 = 0;

  if (sub2) {
    using pii = pair<int, int>;
    sort(ad[0].begin(), ad[0].end(), [&] (pii a, pii b) {
      return make_pair(a.second, a.first) < make_pair(b.second, b.first);
    });
  }

  sort(co.begin(), co.end());
  co.resize(unique(co.begin(), co.end()) - co.begin());

}

bool dd[N];
int special;
bool dfs1(int u, int pre, int cw) {
  if (u == special) return 1;
  bool ret = 0;
  for (auto duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre || w > cw) continue;
    if (!dd[v]) {
      dd[v] = 1;
      ret |= dfs1(v, u, cw);
    }
  }
  return ret;
}

bool dfs2(int u, int pre, int cw) {
  int cnt = pre != -1;
  bool ret = 0;
  map<int, int> d;
  for (auto duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre || w > cw) continue;
    if (dd[v] && !d[v]) return 1;
    if (!dd[v]) {
      dd[v] = d[v] = 1;
      cnt += 1;
      ret |= dfs2(v, u, cw);
    }
  }

  return (cnt > 2 || ret);
}

int getMinimumFuelCapacity(int X, int Y) {
  if (sub1 && m == n - 1) return -1;
  if (sub1 && m == n) return maxw;

  if (sub2) {
    int it = 0;
    while (ad[0][it].first == X || ad[0][it].first == Y) it += 1;
    return max({ad[0][it].second, par[X], par[Y]});
  }

  int l = 0, r = co.size() - 1;
  int answer = -1;
  special = Y;
  while (l <= r) {
    int mid = l + r >> 1;

    bool ret = 1;
    memset(dd, 0, sizeof dd); ret &= dfs1(X, -1, co[mid]);
    memset(dd, 0, sizeof dd); ret &= dfs2(X, -1, co[mid]);

    if (ret) r = mid - 1, answer = co[mid];
    else l = mid + 1;
  }

  return answer;
}

#ifdef LOCAL
int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if (fopen("duck.inp", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }

  int n, m; cin >> n >> m;
  vector<int> 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;
  for (int i = 1; i <= q; ++i) {
    int X, Y; cin >> X >> Y;
    cout << getMinimumFuelCapacity(X, Y) << '\n';
  }


}
#endif // LOCAL

Compilation message

swap.cpp: In function 'bool dfs2(int, int, int)':
swap.cpp:74:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   74 |       dd[v] = d[v] = 1;
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:97:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   97 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 31 ms 7884 KB Output is correct
10 Correct 37 ms 8712 KB Output is correct
11 Correct 36 ms 8700 KB Output is correct
12 Correct 40 ms 9044 KB Output is correct
13 Correct 42 ms 8912 KB Output is correct
14 Correct 37 ms 8028 KB Output is correct
15 Correct 77 ms 10412 KB Output is correct
16 Correct 103 ms 10376 KB Output is correct
17 Correct 90 ms 10664 KB Output is correct
18 Correct 81 ms 10724 KB Output is correct
19 Correct 41 ms 7508 KB Output is correct
20 Correct 76 ms 11752 KB Output is correct
21 Correct 95 ms 11656 KB Output is correct
22 Correct 85 ms 12080 KB Output is correct
23 Correct 91 ms 12072 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Incorrect 81 ms 11232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3160 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 3 ms 3160 KB Output is correct
15 Correct 2 ms 3160 KB Output is correct
16 Correct 3 ms 3164 KB Output is correct
17 Correct 3 ms 3164 KB Output is correct
18 Correct 3 ms 3160 KB Output is correct
19 Correct 3 ms 3160 KB Output is correct
20 Correct 2 ms 3164 KB Output is correct
21 Correct 3 ms 3164 KB Output is correct
22 Correct 3 ms 3248 KB Output is correct
23 Correct 3 ms 3164 KB Output is correct
24 Correct 4 ms 3164 KB Output is correct
25 Correct 5 ms 3164 KB Output is correct
26 Correct 3 ms 3420 KB Output is correct
27 Correct 3 ms 3164 KB Output is correct
28 Correct 5 ms 3164 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 31 ms 7884 KB Output is correct
11 Correct 37 ms 8712 KB Output is correct
12 Correct 36 ms 8700 KB Output is correct
13 Correct 40 ms 9044 KB Output is correct
14 Correct 42 ms 8912 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 2 ms 3160 KB Output is correct
18 Correct 2 ms 3164 KB Output is correct
19 Correct 3 ms 3160 KB Output is correct
20 Correct 2 ms 3160 KB Output is correct
21 Correct 3 ms 3164 KB Output is correct
22 Correct 3 ms 3164 KB Output is correct
23 Correct 3 ms 3160 KB Output is correct
24 Correct 3 ms 3160 KB Output is correct
25 Correct 2 ms 3164 KB Output is correct
26 Correct 3 ms 3164 KB Output is correct
27 Correct 3 ms 3248 KB Output is correct
28 Correct 3 ms 3164 KB Output is correct
29 Correct 4 ms 3164 KB Output is correct
30 Correct 5 ms 3164 KB Output is correct
31 Correct 3 ms 3420 KB Output is correct
32 Correct 3 ms 3164 KB Output is correct
33 Correct 5 ms 3164 KB Output is correct
34 Correct 12 ms 3928 KB Output is correct
35 Correct 235 ms 24176 KB Output is correct
36 Correct 164 ms 17204 KB Output is correct
37 Correct 148 ms 10908 KB Output is correct
38 Correct 275 ms 9280 KB Output is correct
39 Correct 186 ms 8904 KB Output is correct
40 Correct 255 ms 8652 KB Output is correct
41 Correct 328 ms 19012 KB Output is correct
42 Correct 253 ms 21668 KB Output is correct
43 Correct 462 ms 21912 KB Output is correct
44 Correct 364 ms 9416 KB Output is correct
45 Correct 769 ms 16444 KB Output is correct
46 Correct 325 ms 19172 KB Output is correct
47 Correct 421 ms 9304 KB Output is correct
48 Correct 401 ms 9672 KB Output is correct
49 Correct 97 ms 12256 KB Output is correct
50 Correct 128 ms 9680 KB Output is correct
51 Correct 378 ms 14308 KB Output is correct
52 Correct 759 ms 21516 KB Output is correct
53 Correct 194 ms 13552 KB Output is correct
54 Correct 1010 ms 27768 KB Output is correct
55 Correct 333 ms 16948 KB Output is correct
56 Correct 1171 ms 19208 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 31 ms 7884 KB Output is correct
10 Correct 37 ms 8712 KB Output is correct
11 Correct 36 ms 8700 KB Output is correct
12 Correct 40 ms 9044 KB Output is correct
13 Correct 42 ms 8912 KB Output is correct
14 Correct 37 ms 8028 KB Output is correct
15 Correct 77 ms 10412 KB Output is correct
16 Correct 103 ms 10376 KB Output is correct
17 Correct 90 ms 10664 KB Output is correct
18 Correct 81 ms 10724 KB Output is correct
19 Incorrect 81 ms 11232 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 31 ms 7884 KB Output is correct
11 Correct 37 ms 8712 KB Output is correct
12 Correct 36 ms 8700 KB Output is correct
13 Correct 40 ms 9044 KB Output is correct
14 Correct 42 ms 8912 KB Output is correct
15 Correct 37 ms 8028 KB Output is correct
16 Correct 77 ms 10412 KB Output is correct
17 Correct 103 ms 10376 KB Output is correct
18 Correct 90 ms 10664 KB Output is correct
19 Correct 81 ms 10724 KB Output is correct
20 Incorrect 81 ms 11232 KB Output isn't correct
21 Halted 0 ms 0 KB -