oj.uz

Submission #915684

# Submission time Handle Problem Language Result Execution time Memory
915684 2024-01-24T14:31:22 Z duckindog Swapping Cities (APIO20_swap) C++14
43 / 100
 1093 ms 31708 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 (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:72:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   72 |       dd[v] = d[v] = 1;
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:95:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |     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 3064 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 1 ms 3124 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 32 ms 9488 KB Output is correct
10 Correct 42 ms 10736 KB Output is correct
11 Correct 39 ms 10700 KB Output is correct
12 Correct 40 ms 10956 KB Output is correct
13 Correct 40 ms 10956 KB Output is correct
14 Correct 37 ms 9812 KB Output is correct
15 Correct 86 ms 14744 KB Output is correct
16 Correct 82 ms 14760 KB Output is correct
17 Correct 85 ms 15084 KB Output is correct
18 Correct 85 ms 15156 KB Output is correct
19 Correct 50 ms 9492 KB Output is correct
20 Correct 84 ms 16004 KB Output is correct
21 Correct 88 ms 16260 KB Output is correct
22 Correct 87 ms 16564 KB Output is correct
23 Correct 86 ms 16432 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 3064 KB Output is correct
3 Incorrect 91 ms 16148 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 3064 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 1 ms 3124 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 1 ms 3160 KB Output is correct
10 Correct 3 ms 3296 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 3 ms 3384 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 3 ms 3164 KB Output is correct
19 Correct 3 ms 3164 KB Output is correct
20 Correct 3 ms 3420 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 5 ms 3672 KB Output is correct
25 Correct 4 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 4 ms 3420 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 3064 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 1 ms 3124 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 32 ms 9488 KB Output is correct
11 Correct 42 ms 10736 KB Output is correct
12 Correct 39 ms 10700 KB Output is correct
13 Correct 40 ms 10956 KB Output is correct
14 Correct 40 ms 10956 KB Output is correct
15 Correct 3 ms 3296 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 2 ms 3164 KB Output is correct
19 Correct 2 ms 3164 KB Output is correct
20 Correct 2 ms 3164 KB Output is correct
21 Correct 3 ms 3384 KB Output is correct
22 Correct 4 ms 3420 KB Output is correct
23 Correct 3 ms 3164 KB Output is correct
24 Correct 3 ms 3164 KB Output is correct
25 Correct 3 ms 3420 KB Output is correct
26 Correct 3 ms 3164 KB Output is correct
27 Correct 3 ms 3164 KB Output is correct
28 Correct 3 ms 3160 KB Output is correct
29 Correct 5 ms 3672 KB Output is correct
30 Correct 4 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 4 ms 3420 KB Output is correct
34 Correct 11 ms 4184 KB Output is correct
35 Correct 219 ms 26160 KB Output is correct
36 Correct 133 ms 18992 KB Output is correct
37 Correct 152 ms 12860 KB Output is correct
38 Correct 274 ms 10992 KB Output is correct
39 Correct 179 ms 10636 KB Output is correct
40 Correct 256 ms 10184 KB Output is correct
41 Correct 206 ms 21300 KB Output is correct
42 Correct 229 ms 23600 KB Output is correct
43 Correct 445 ms 23860 KB Output is correct
44 Correct 299 ms 11720 KB Output is correct
45 Correct 822 ms 19720 KB Output is correct
46 Correct 287 ms 21184 KB Output is correct
47 Correct 347 ms 11060 KB Output is correct
48 Correct 388 ms 11724 KB Output is correct
49 Correct 95 ms 14876 KB Output is correct
50 Correct 126 ms 12076 KB Output is correct
51 Correct 383 ms 17120 KB Output is correct
52 Correct 641 ms 25072 KB Output is correct
53 Correct 205 ms 17352 KB Output is correct
54 Correct 999 ms 31708 KB Output is correct
55 Correct 347 ms 18656 KB Output is correct
56 Correct 1093 ms 22756 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 3064 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 1 ms 3124 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 32 ms 9488 KB Output is correct
10 Correct 42 ms 10736 KB Output is correct
11 Correct 39 ms 10700 KB Output is correct
12 Correct 40 ms 10956 KB Output is correct
13 Correct 40 ms 10956 KB Output is correct
14 Correct 37 ms 9812 KB Output is correct
15 Correct 86 ms 14744 KB Output is correct
16 Correct 82 ms 14760 KB Output is correct
17 Correct 85 ms 15084 KB Output is correct
18 Correct 85 ms 15156 KB Output is correct
19 Incorrect 91 ms 16148 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 3160 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 3064 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 1 ms 3124 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 32 ms 9488 KB Output is correct
11 Correct 42 ms 10736 KB Output is correct
12 Correct 39 ms 10700 KB Output is correct
13 Correct 40 ms 10956 KB Output is correct
14 Correct 40 ms 10956 KB Output is correct
15 Correct 37 ms 9812 KB Output is correct
16 Correct 86 ms 14744 KB Output is correct
17 Correct 82 ms 14760 KB Output is correct
18 Correct 85 ms 15084 KB Output is correct
19 Correct 85 ms 15156 KB Output is correct
20 Incorrect 91 ms 16148 KB Output isn't correct
21 Halted 0 ms 0 KB -