oj.uz

Submission #879439

# Submission time Handle Problem Language Result Execution time Memory
879439 2023-11-27T12:25:06 Z Camillus Swapping Cities (APIO20_swap) C++17
6 / 100
 76 ms 10224 KB 
/// @author Camillus
#include "swap.h"
#include "bits/stdc++.h"
using namespace std;

int mx = -1;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vector<int> E(M);
    iota(E.begin(), E.end(), 0);

    sort(E.begin(), E.end(), [&W](int i, int j) -> bool {
        return W[i] < W[j];
    });

    if (M == N)
    mx = *max_element(W.begin(), W.end());
}

int getMinimumFuelCapacity(int X, int Y) {
    return mx;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 0 ms 440 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 27 ms 4044 KB Output is correct
10 Correct 34 ms 4948 KB Output is correct
11 Correct 28 ms 4956 KB Output is correct
12 Correct 41 ms 5056 KB Output is correct
13 Correct 30 ms 5200 KB Output is correct
14 Correct 28 ms 4420 KB Output is correct
15 Correct 71 ms 8996 KB Output is correct
16 Correct 71 ms 8712 KB Output is correct
17 Correct 74 ms 9040 KB Output is correct
18 Correct 72 ms 9176 KB Output is correct
19 Correct 42 ms 6204 KB Output is correct
20 Correct 71 ms 9636 KB Output is correct
21 Correct 74 ms 10140 KB Output is correct
22 Correct 76 ms 10160 KB Output is correct
23 Correct 76 ms 10224 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 69 ms 8272 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory 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 0 ms 440 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 432 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 432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory 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 0 ms 440 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 27 ms 4044 KB Output is correct
10 Correct 34 ms 4948 KB Output is correct
11 Correct 28 ms 4956 KB Output is correct
12 Correct 41 ms 5056 KB Output is correct
13 Correct 30 ms 5200 KB Output is correct
14 Correct 28 ms 4420 KB Output is correct
15 Correct 71 ms 8996 KB Output is correct
16 Correct 71 ms 8712 KB Output is correct
17 Correct 74 ms 9040 KB Output is correct
18 Correct 72 ms 9176 KB Output is correct
19 Incorrect 69 ms 8272 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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