oj.uz

Submission #1041780

# Submission time Handle Problem Language Result Execution time Memory
1041780 2024-08-02T08:10:06 Z stdfloat Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 10800 KB 
#include <bits/stdc++.h>
#include "swap.h"
using namespace std;

using ll = long long;

#define ff  first
#define ss  second
#define pii pair<int, int>

int n;

vector<vector<pii>> E;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    E.assign(n, {});
    for (int i = 0; i < M; i++) {
        E[U[i]].push_back({V[i], W[i]});
        E[V[i]].push_back({U[i], W[i]});
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    int l = 0, r = (int)1e9 + 1;
    while (l < r) {
        int md = (l + r) >> 1;

        queue<int> q;
        vector<bool> visX(n);
        vector<int> p(n, -1);
        q.push(X); visX[X] = true;
        while (!q.empty()) {
            int x = q.front(); q.pop();

            for (auto [i, w] : E[x]) {
                if (w <= md && !visX[i]) {
                    p[i] = x;
                    q.push(i);
                    visX[i] = true;
                }
            }
        }

        if (!visX[Y]) {
            l = md + 1;
            continue;
        }

        bool tr = false;
        vector<bool> visY(n);
        queue<pii> q1;
        q1.push({Y, -1}); visY[Y] = true;
        while (!q1.empty() && !tr) {
            auto [x, p] = q1.front(); q1.pop();
        
            for (auto [i, w] : E[x]) {
                if (i == p || w > md) continue;

                if (visY[i]) {
                    if (visX[i]) {
                        tr = true;
                        break;
                    }
                }
                else {
                    visY[i] = true;
                    q1.push({i, x});
                }
            }
        }

        int x = Y;
        while (x != X && !tr) {
            x = p[x];

            int cnt = 0;
            for (auto [i, w] : E[x]) {
                if ((cnt += (w <= md)) > 2) break;
            }

            tr = (cnt > 2);
        }

        if (!tr) l = md + 1;
        else r = md;
    }

    return (l == (int)1e9 + 1 ? -1 : l);
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 161 ms 6592 KB Output is correct
10 Correct 455 ms 7764 KB Output is correct
11 Correct 639 ms 7772 KB Output is correct
12 Correct 607 ms 8020 KB Output is correct
13 Correct 858 ms 8024 KB Output is correct
14 Execution timed out 2075 ms 6484 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2047 ms 10800 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Incorrect 2 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 161 ms 6592 KB Output is correct
11 Correct 455 ms 7764 KB Output is correct
12 Correct 639 ms 7772 KB Output is correct
13 Correct 607 ms 8020 KB Output is correct
14 Correct 858 ms 8024 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Incorrect 2 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 161 ms 6592 KB Output is correct
10 Correct 455 ms 7764 KB Output is correct
11 Correct 639 ms 7772 KB Output is correct
12 Correct 607 ms 8020 KB Output is correct
13 Correct 858 ms 8024 KB Output is correct
14 Execution timed out 2075 ms 6484 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 161 ms 6592 KB Output is correct
11 Correct 455 ms 7764 KB Output is correct
12 Correct 639 ms 7772 KB Output is correct
13 Correct 607 ms 8020 KB Output is correct
14 Correct 858 ms 8024 KB Output is correct
15 Execution timed out 2075 ms 6484 KB Time limit exceeded
16 Halted 0 ms 0 KB -