Submission #979492

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
979492	2024-05-11T06:36:53 Z	ducksaysquack	Swapping Cities (APIO20_swap)	C++17	6 / 100	70 ms	6060 KB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
bool yes = true;
int k = 0;
void init(int n, int m, vector<int> u, vector<int> v, vector<int> w) {
	yes = n == m;
    for(int i=0;i<m;i++) k = max(k, w[i]);
}
int getMinimumFuelCapacity(int x, int y) {
	return yes? k:-1;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	18 ms	2136 KB	Output is correct
10	Correct	22 ms	2652 KB	Output is correct
11	Correct	22 ms	2584 KB	Output is correct
12	Correct	23 ms	2652 KB	Output is correct
13	Correct	23 ms	2640 KB	Output is correct
14	Correct	25 ms	2392 KB	Output is correct
15	Correct	70 ms	4320 KB	Output is correct
16	Correct	61 ms	4300 KB	Output is correct
17	Correct	63 ms	4540 KB	Output is correct
18	Correct	63 ms	4376 KB	Output is correct
19	Correct	45 ms	4108 KB	Output is correct
20	Correct	64 ms	5604 KB	Output is correct
21	Correct	63 ms	5648 KB	Output is correct
22	Correct	65 ms	5816 KB	Output is correct
23	Correct	67 ms	6060 KB	Output is correct

Subtask #2

0 / 7.0

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

Subtask #3

0 / 17.0

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

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	18 ms	2136 KB	Output is correct
10	Correct	22 ms	2652 KB	Output is correct
11	Correct	22 ms	2584 KB	Output is correct
12	Correct	23 ms	2652 KB	Output is correct
13	Correct	23 ms	2640 KB	Output is correct
14	Correct	25 ms	2392 KB	Output is correct
15	Correct	70 ms	4320 KB	Output is correct
16	Correct	61 ms	4300 KB	Output is correct
17	Correct	63 ms	4540 KB	Output is correct
18	Correct	63 ms	4376 KB	Output is correct
19	Incorrect	62 ms	4336 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	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-