oj.uz

Submission #828110

# Submission time Handle Problem Language Result Execution time Memory
828110 2023-08-17T05:11:58 Z SUNWOOOOOOOO Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 10028 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
using tint = array <int, 3>;
const int mxN = 100005, INF = 2e9;
tint edge[mxN];
int n, m, deg[mxN];

struct dsu {
    array <int, 3> G[mxN]; // node, is cycle, is deg3
    void init(){
        for (int i = 0; i < n; i++) G[i] = {i, 0, 0};
    }
    int find(int x){
        if (G[x][0] != x) return G[x][0] = find(G[x][0]);
        return G[x][0];
    }
    void uni(int x, int y){
        x = find(x), y = find(y);
        if (x != y){
            G[y][0] = x;
            G[x][1] |= G[y][1];
            G[x][2] |= G[y][2];
        }
        else {
            G[x][1] = 1;
        }
    }
} dsu;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N, m = M;
    for (int i = 0; i < m; i++) edge[i] = {W[i], U[i], V[i]};
    sort(edge, edge + m);
}

int getMinimumFuelCapacity(int X, int Y) {
    int low = 0, high = m - 1, mid, ans = -1;
    while (low <= high){
        dsu.init();
        memset(deg, 0, sizeof deg);
        
        mid = (low + high) / 2;
        for (int i = 0; i <= mid; i++){
            if (++deg[edge[i][1]] >= 3) dsu.G[edge[i][1]][2] = 1;
            if (++deg[edge[i][2]] >= 3) dsu.G[edge[i][2]][2] = 1;
        }
        for (int i = 0; i <= mid; i++){
            dsu.uni(edge[i][1], edge[i][2]);
        }

        X = dsu.find(X), Y = dsu.find(Y);
        if (X == Y && (dsu.G[X][1] || dsu.G[X][2])){
            ans = mid;
            high = mid - 1;
        }
        else low = mid + 1;
    }
    if (ans != -1) return edge[ans][0];
    else return -1;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 708 KB Output is correct
9 Correct 69 ms 5036 KB Output is correct
10 Correct 142 ms 6108 KB Output is correct
11 Correct 174 ms 6028 KB Output is correct
12 Correct 177 ms 6320 KB Output is correct
13 Correct 142 ms 6628 KB Output is correct
14 Execution timed out 2082 ms 5524 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Execution timed out 2072 ms 10028 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 708 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Incorrect 1 ms 708 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 708 KB Output is correct
10 Correct 69 ms 5036 KB Output is correct
11 Correct 142 ms 6108 KB Output is correct
12 Correct 174 ms 6028 KB Output is correct
13 Correct 177 ms 6320 KB Output is correct
14 Correct 142 ms 6628 KB Output is correct
15 Incorrect 1 ms 708 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 708 KB Output is correct
9 Correct 69 ms 5036 KB Output is correct
10 Correct 142 ms 6108 KB Output is correct
11 Correct 174 ms 6028 KB Output is correct
12 Correct 177 ms 6320 KB Output is correct
13 Correct 142 ms 6628 KB Output is correct
14 Execution timed out 2082 ms 5524 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 708 KB Output is correct
10 Correct 69 ms 5036 KB Output is correct
11 Correct 142 ms 6108 KB Output is correct
12 Correct 174 ms 6028 KB Output is correct
13 Correct 177 ms 6320 KB Output is correct
14 Correct 142 ms 6628 KB Output is correct
15 Execution timed out 2082 ms 5524 KB Time limit exceeded
16 Halted 0 ms 0 KB -