oj.uz

Submission #406082

# Submission time Handle Problem Language Result Execution time Memory
406082 2021-05-17T08:17:47 Z tengiz05 Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 13236 KB 
#include "swap.h"
#include <bits/stdc++.h>
constexpr int N = 1e5;
std::vector<int> e[N];
std::vector<int> U, V, W;
int n, m;
void init(int n, int m, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    ::U = U;
    ::V = V;
    ::W = W;
    ::n = n;
    ::m = m;
}
std::vector<int> p;
std::vector<bool> vis;
bool have;
void dfs(int u, int P) {
    p[u] = P;
    vis[u] = true;
    if (e[u].size() > 2) have = true;
    for (auto v : e[u]) {
        if (!vis[v]) {
            dfs(v, u);
        }
    }
}
bool check(int X, int Y, int mid) {
    for (int i = 0; i < n; i++) e[i].clear();
    for (int i = 0; i < m; i++) {
        if (W[i] <= mid) {
            e[U[i]].emplace_back(V[i]);
            e[V[i]].emplace_back(U[i]);
        }
    }
    p.assign(n, -1);
    vis.assign(n, false);
    have = false;
    dfs(X, -1);
    if (p[Y] == -1)
        return false;
    if (have) {
        return true;
    }
    int y = Y;
    std::vector<int> got;
    y = p[y];
    while (y != -1 && p[y] != -1) {
        got.push_back(y);
        y = p[y];
    }
    y = Y;
    std::vector<bool> bad(n);
    for (auto x : got) {
        bad[x] = true;
        y = x;
    }
    for (int i = 0; i < n; i++) e[i].clear();
    for (int i = 0; i < m; i++) {
        if (W[i] <= mid && !bad[U[i]] && !bad[V[i]] && !(U[i] == X && V[i] == Y || U[i] == Y && V[i] == X)) {
            e[U[i]].emplace_back(V[i]);
            e[V[i]].emplace_back(U[i]);
        }
    }
    p.assign(n, -1);
    vis.assign(n, false);
    dfs(X, -1);
    if (p[Y] != -1)
        return true;
    return false;
}
int getMinimumFuelCapacity(int X, int Y) {
    int l = -1, r = 1e9 + 2;
    while (l + 1 < r) {
        int mid = (l + r) / 2;
        if (check(X, Y, mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    if (r == 1e9 + 2) r = -1;
    return r;
}

Compilation message

swap.cpp: In function 'bool check(int, int, int)':
swap.cpp:59:68: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   59 |         if (W[i] <= mid && !bad[U[i]] && !bad[V[i]] && !(U[i] == X && V[i] == Y || U[i] == Y && V[i] == X)) {

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2556 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 6 ms 2636 KB Output is correct
5 Correct 9 ms 2736 KB Output is correct
6 Correct 13 ms 2736 KB Output is correct
7 Correct 13 ms 2636 KB Output is correct
8 Correct 12 ms 2748 KB Output is correct
9 Correct 573 ms 11320 KB Output is correct
10 Correct 1995 ms 12536 KB Output is correct
11 Execution timed out 2090 ms 13236 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2556 KB Output is correct
3 Execution timed out 2082 ms 10840 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2556 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 6 ms 2636 KB Output is correct
5 Correct 9 ms 2736 KB Output is correct
6 Correct 13 ms 2736 KB Output is correct
7 Correct 13 ms 2636 KB Output is correct
8 Correct 12 ms 2748 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 6 ms 2700 KB Output is correct
11 Correct 9 ms 2708 KB Output is correct
12 Correct 8 ms 2636 KB Output is correct
13 Correct 7 ms 2636 KB Output is correct
14 Correct 7 ms 2636 KB Output is correct
15 Correct 9 ms 2636 KB Output is correct
16 Correct 9 ms 2724 KB Output is correct
17 Correct 8 ms 2636 KB Output is correct
18 Correct 7 ms 2636 KB Output is correct
19 Correct 6 ms 2636 KB Output is correct
20 Correct 9 ms 2636 KB Output is correct
21 Correct 8 ms 2636 KB Output is correct
22 Correct 5 ms 2636 KB Output is correct
23 Correct 6 ms 2636 KB Output is correct
24 Correct 11 ms 2712 KB Output is correct
25 Incorrect 10 ms 2636 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2556 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 6 ms 2636 KB Output is correct
6 Correct 9 ms 2736 KB Output is correct
7 Correct 13 ms 2736 KB Output is correct
8 Correct 13 ms 2636 KB Output is correct
9 Correct 12 ms 2748 KB Output is correct
10 Correct 573 ms 11320 KB Output is correct
11 Correct 1995 ms 12536 KB Output is correct
12 Execution timed out 2090 ms 13236 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2556 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 6 ms 2636 KB Output is correct
5 Correct 9 ms 2736 KB Output is correct
6 Correct 13 ms 2736 KB Output is correct
7 Correct 13 ms 2636 KB Output is correct
8 Correct 12 ms 2748 KB Output is correct
9 Correct 573 ms 11320 KB Output is correct
10 Correct 1995 ms 12536 KB Output is correct
11 Execution timed out 2090 ms 13236 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2556 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 6 ms 2636 KB Output is correct
6 Correct 9 ms 2736 KB Output is correct
7 Correct 13 ms 2736 KB Output is correct
8 Correct 13 ms 2636 KB Output is correct
9 Correct 12 ms 2748 KB Output is correct
10 Correct 573 ms 11320 KB Output is correct
11 Correct 1995 ms 12536 KB Output is correct
12 Execution timed out 2090 ms 13236 KB Time limit exceeded
13 Halted 0 ms 0 KB -