oj.uz

Submission #915564

# Submission time Handle Problem Language Result Execution time Memory
915564 2024-01-24T07:30:00 Z duckindog Swapping Cities (APIO20_swap) C++14
37 / 100
 2000 ms 31388 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;
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});

  }
  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) {

  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:56:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   56 |       dd[v] = d[v] = 1;
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:71:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2652 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 2904 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 3 ms 3160 KB Output is correct
9 Correct 124 ms 25180 KB Output is correct
10 Correct 342 ms 28184 KB Output is correct
11 Correct 349 ms 28772 KB Output is correct
12 Correct 365 ms 28212 KB Output is correct
13 Correct 765 ms 30364 KB Output is correct
14 Execution timed out 2017 ms 25520 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Execution timed out 2011 ms 18688 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2652 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 2904 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 3 ms 3160 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 3 ms 2820 KB Output is correct
11 Correct 3 ms 2908 KB Output is correct
12 Correct 2 ms 2844 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 3 ms 2908 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 3 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 3 ms 3064 KB Output is correct
26 Correct 3 ms 3164 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 4 ms 3068 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 3 ms 3160 KB Output is correct
10 Correct 124 ms 25180 KB Output is correct
11 Correct 342 ms 28184 KB Output is correct
12 Correct 349 ms 28772 KB Output is correct
13 Correct 365 ms 28212 KB Output is correct
14 Correct 765 ms 30364 KB Output is correct
15 Correct 3 ms 2820 KB Output is correct
16 Correct 3 ms 2908 KB Output is correct
17 Correct 2 ms 2844 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct
30 Correct 3 ms 3064 KB Output is correct
31 Correct 3 ms 3164 KB Output is correct
32 Correct 3 ms 2908 KB Output is correct
33 Correct 4 ms 3068 KB Output is correct
34 Correct 14 ms 4268 KB Output is correct
35 Correct 209 ms 25804 KB Output is correct
36 Correct 140 ms 18608 KB Output is correct
37 Correct 179 ms 12340 KB Output is correct
38 Correct 272 ms 10604 KB Output is correct
39 Correct 192 ms 10184 KB Output is correct
40 Correct 257 ms 9676 KB Output is correct
41 Correct 189 ms 20788 KB Output is correct
42 Correct 226 ms 23104 KB Output is correct
43 Correct 505 ms 23544 KB Output is correct
44 Correct 287 ms 11212 KB Output is correct
45 Correct 719 ms 19080 KB Output is correct
46 Correct 306 ms 20868 KB Output is correct
47 Correct 320 ms 10640 KB Output is correct
48 Correct 380 ms 11208 KB Output is correct
49 Correct 99 ms 14536 KB Output is correct
50 Correct 128 ms 11724 KB Output is correct
51 Correct 406 ms 16804 KB Output is correct
52 Correct 536 ms 24416 KB Output is correct
53 Correct 189 ms 16904 KB Output is correct
54 Correct 1000 ms 31388 KB Output is correct
55 Correct 320 ms 18224 KB Output is correct
56 Correct 821 ms 22144 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2652 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 2904 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 3 ms 3160 KB Output is correct
9 Correct 124 ms 25180 KB Output is correct
10 Correct 342 ms 28184 KB Output is correct
11 Correct 349 ms 28772 KB Output is correct
12 Correct 365 ms 28212 KB Output is correct
13 Correct 765 ms 30364 KB Output is correct
14 Execution timed out 2017 ms 25520 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 3 ms 3160 KB Output is correct
10 Correct 124 ms 25180 KB Output is correct
11 Correct 342 ms 28184 KB Output is correct
12 Correct 349 ms 28772 KB Output is correct
13 Correct 365 ms 28212 KB Output is correct
14 Correct 765 ms 30364 KB Output is correct
15 Execution timed out 2017 ms 25520 KB Time limit exceeded
16 Halted 0 ms 0 KB -