oj.uz

답안 #1041817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041817 2024-08-02T08:30:44 Z stdfloat 자매 도시 (APIO20_swap) C++17
0 / 100
 2000 ms 10808 KB 
#include <bits/stdc++.h>
#include "swap.h"
// #include "grader.cpp"
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 (w > md || i == p) 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]) {
                cnt += (w <= md);
            }

            tr = (cnt > 2);
        }

        int cnt = 0;
        for (auto [i, w] : E[Y]) {
            cnt += (i != X && w <= md && visX[i]);
        }

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

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

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 183 ms 6492 KB Output is correct
10 Correct 451 ms 7772 KB Output is correct
11 Correct 656 ms 7772 KB Output is correct
12 Correct 687 ms 8028 KB Output is correct
13 Correct 913 ms 8016 KB Output is correct
14 Execution timed out 2058 ms 6572 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2052 ms 10808 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 2 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 2 ms 348 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 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 183 ms 6492 KB Output is correct
11 Correct 451 ms 7772 KB Output is correct
12 Correct 656 ms 7772 KB Output is correct
13 Correct 687 ms 8028 KB Output is correct
14 Correct 913 ms 8016 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 183 ms 6492 KB Output is correct
10 Correct 451 ms 7772 KB Output is correct
11 Correct 656 ms 7772 KB Output is correct
12 Correct 687 ms 8028 KB Output is correct
13 Correct 913 ms 8016 KB Output is correct
14 Execution timed out 2058 ms 6572 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 2 ms 348 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 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 183 ms 6492 KB Output is correct
11 Correct 451 ms 7772 KB Output is correct
12 Correct 656 ms 7772 KB Output is correct
13 Correct 687 ms 8028 KB Output is correct
14 Correct 913 ms 8016 KB Output is correct
15 Execution timed out 2058 ms 6572 KB Time limit exceeded
16 Halted 0 ms 0 KB -