oj.uz

Submission #674714

# Submission time Handle Problem Language Result Execution time Memory
674714 2022-12-26T00:38:27 Z Vahe Swapping Cities (APIO20_swap) C++17
7 / 100
 147 ms 8784 KB 
#include "swap.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int n, m;
vector<int> u_, v_, w, ver, var, par, P, p, her, sizes;

int get(int u)
{
    if (u == par[u]) return u;
    return par[u] = get(par[u]);
}

void union_chains(int u, int v, int w)
{
    int a = get(u), b = get(v);
    if (a == b)
    {
        P[a] = min(P[a], w);
        return;
    }
    if (sizes[a] < sizes[b]) swap(a, b), swap(u, v);
    sizes[a] += sizes[b];
    p[v] = u;
    her[v] = w;
    if (u == ver[a] && v == ver[b]) ver[a] = var[b];
    else if (u == ver[a] && v == var[b]) ver[a] = ver[b];
    else if (u == var[a] && v == ver[b]) var[a] = var[b];
    else if (u == var[a] && v == var[b]) var[a] = ver[b];
    else ver[a] = -1, var[a] = -1, P[a] = min(P[a], w);
}

int go(int u, int w)
{
    if (p[u] == u || her[u] > w) return u;
    return go(p[u], w);
}

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N, m = M;
    vector<pair<int, pair<int, int>>> kox;
    for (int i = 0; i < m; i++) kox.push_back({ W[i], {U[i], V[i]} });
    sort(kox.begin(), kox.end());
    ver = var = par = sizes = P = her = p = vector<int>(n);
    for (int i = 0; i < n; i++) ver[i] = var[i] = par[i] = p[i] = i, sizes[i] = 1, her[i] = P[i] = INT_MAX;
    for (int i = 0; i < m; i++)
    {
        int u = kox[i].second.first, v = kox[i].second.second;
        union_chains(u, v, kox[i].first);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    long long l = 0, r = 2e9;
    while (l + 1 < r)
    {
        int mij = l + (r - l) / 2;
        int a = go(X, mij), b = go(Y, mij);
        if (a == b && P[get(a)] <= mij) r = mij;
        else l = mij;
    }
    return r == 2e9 ? -1 : r;
}

Subtask #1
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 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 32 ms 5124 KB Output is correct
10 Correct 39 ms 6284 KB Output is correct
11 Correct 37 ms 6132 KB Output is correct
12 Correct 39 ms 6460 KB Output is correct
13 Correct 38 ms 6508 KB Output is correct
14 Correct 38 ms 5692 KB Output is correct
15 Correct 112 ms 8572 KB Output is correct
16 Correct 111 ms 8704 KB Output is correct
17 Correct 142 ms 8780 KB Output is correct
18 Correct 111 ms 8784 KB Output is correct
19 Incorrect 62 ms 3900 KB Output isn't correct
20 Halted 0 ms 0 KB -

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 145 ms 8120 KB Output is correct
4 Correct 130 ms 8164 KB Output is correct
5 Correct 147 ms 8380 KB Output is correct
6 Correct 144 ms 8136 KB Output is correct
7 Correct 140 ms 8272 KB Output is correct
8 Correct 137 ms 8220 KB Output is correct
9 Correct 141 ms 8148 KB Output is correct
10 Correct 140 ms 8116 KB Output is correct

Subtask #3
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 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 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 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 32 ms 5124 KB Output is correct
10 Correct 39 ms 6284 KB Output is correct
11 Correct 37 ms 6132 KB Output is correct
12 Correct 39 ms 6460 KB Output is correct
13 Correct 38 ms 6508 KB Output is correct
14 Correct 38 ms 5692 KB Output is correct
15 Correct 112 ms 8572 KB Output is correct
16 Correct 111 ms 8704 KB Output is correct
17 Correct 142 ms 8780 KB Output is correct
18 Correct 111 ms 8784 KB Output is correct
19 Correct 145 ms 8120 KB Output is correct
20 Correct 130 ms 8164 KB Output is correct
21 Correct 147 ms 8380 KB Output is correct
22 Correct 144 ms 8136 KB Output is correct
23 Correct 140 ms 8272 KB Output is correct
24 Correct 137 ms 8220 KB Output is correct
25 Correct 141 ms 8148 KB Output is correct
26 Correct 140 ms 8116 KB Output is correct
27 Incorrect 1 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -