Submission #407270

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
407270	2021-05-18T16:55:25 Z	proma	Swapping Cities (APIO20_swap)	C++17	6 / 100	103 ms	10156 KB

swap

#include <bits/stdc++.h>

using namespace std;

int n, m, max_weight;

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 ++) {
        max_weight = max(max_weight, W[i]);
    }
}

int getMinimumFuelCapacity (int X, int Y) {
    if (n == m) {
        return max_weight;
    }
    else {
        return -1;
    }
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	30 ms	2116 KB	Output is correct
10	Correct	34 ms	2452 KB	Output is correct
11	Correct	34 ms	2500 KB	Output is correct
12	Correct	36 ms	2628 KB	Output is correct
13	Correct	35 ms	2620 KB	Output is correct
14	Correct	34 ms	2244 KB	Output is correct
15	Correct	94 ms	4308 KB	Output is correct
16	Correct	97 ms	4276 KB	Output is correct
17	Correct	98 ms	4384 KB	Output is correct
18	Correct	99 ms	4396 KB	Output is correct
19	Correct	59 ms	3968 KB	Output is correct
20	Correct	98 ms	9620 KB	Output is correct
21	Correct	99 ms	9980 KB	Output is correct
22	Correct	103 ms	10136 KB	Output is correct
23	Correct	101 ms	10156 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Incorrect	88 ms	4132 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	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	30 ms	2116 KB	Output is correct
10	Correct	34 ms	2452 KB	Output is correct
11	Correct	34 ms	2500 KB	Output is correct
12	Correct	36 ms	2628 KB	Output is correct
13	Correct	35 ms	2620 KB	Output is correct
14	Correct	34 ms	2244 KB	Output is correct
15	Correct	94 ms	4308 KB	Output is correct
16	Correct	97 ms	4276 KB	Output is correct
17	Correct	98 ms	4384 KB	Output is correct
18	Correct	99 ms	4396 KB	Output is correct
19	Incorrect	88 ms	4132 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct