oj.uz

답안 #1041876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041876 2024-08-02T08:58:58 Z stdfloat 자매 도시 (APIO20_swap) C++17
0 / 100
 2000 ms 13208 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;

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

            for (auto [i, w] : E[x]) {
                if (i == pr || w > md) continue;
                if (visX[i]) {
                    if (i == X) {
                        tr = true;
                        break;
                    }
                }
                else {
                    p[i] = x;
                    q.push({i, x});
                    visX[i] = true;
                }
            }
        }

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

        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 (i == Y || 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);
        }

        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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 448 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 189 ms 7780 KB Output is correct
10 Correct 494 ms 9040 KB Output is correct
11 Correct 689 ms 8912 KB Output is correct
12 Correct 646 ms 9556 KB Output is correct
13 Correct 890 ms 9652 KB Output is correct
14 Execution timed out 2055 ms 7764 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 2077 ms 13208 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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 448 KB Output is correct
8 Correct 4 ms 348 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 512 KB Output is correct
12 Correct 4 ms 600 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 508 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 448 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 189 ms 7780 KB Output is correct
11 Correct 494 ms 9040 KB Output is correct
12 Correct 689 ms 8912 KB Output is correct
13 Correct 646 ms 9556 KB Output is correct
14 Correct 890 ms 9652 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 4 ms 600 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 508 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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 448 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 189 ms 7780 KB Output is correct
10 Correct 494 ms 9040 KB Output is correct
11 Correct 689 ms 8912 KB Output is correct
12 Correct 646 ms 9556 KB Output is correct
13 Correct 890 ms 9652 KB Output is correct
14 Execution timed out 2055 ms 7764 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 448 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 189 ms 7780 KB Output is correct
11 Correct 494 ms 9040 KB Output is correct
12 Correct 689 ms 8912 KB Output is correct
13 Correct 646 ms 9556 KB Output is correct
14 Correct 890 ms 9652 KB Output is correct
15 Execution timed out 2055 ms 7764 KB Time limit exceeded
16 Halted 0 ms 0 KB -