Submission #964091

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
964091	2024-04-16T10:06:30 Z	efedmrlr	Swapping Cities (APIO20_swap)	C++17	6 / 100	66 ms	10184 KB

swap

#include "swap.h"

#include <vector>
int mx = 0;
int n, m;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
            
  n = N; m = M;
  for(int i = 0; i < n ; i++) mx = std::max(mx, W[i]);
}

int getMinimumFuelCapacity(int X, int Y) {
  return m == n - 1 ? -1 : mx;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	16 ms	2124 KB	Output is correct
10	Correct	20 ms	2580 KB	Output is correct
11	Correct	19 ms	2652 KB	Output is correct
12	Correct	20 ms	2636 KB	Output is correct
13	Correct	20 ms	2652 KB	Output is correct
14	Correct	20 ms	2380 KB	Output is correct
15	Correct	59 ms	4316 KB	Output is correct
16	Correct	57 ms	4268 KB	Output is correct
17	Correct	58 ms	4524 KB	Output is correct
18	Correct	66 ms	4556 KB	Output is correct
19	Correct	35 ms	4120 KB	Output is correct
20	Correct	55 ms	9684 KB	Output is correct
21	Correct	58 ms	10000 KB	Output is correct
22	Correct	60 ms	10184 KB	Output is correct
23	Correct	58 ms	10168 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	54 ms	4208 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	344 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	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	0 ms	348 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	348 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	344 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	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	16 ms	2124 KB	Output is correct
10	Correct	20 ms	2580 KB	Output is correct
11	Correct	19 ms	2652 KB	Output is correct
12	Correct	20 ms	2636 KB	Output is correct
13	Correct	20 ms	2652 KB	Output is correct
14	Correct	20 ms	2380 KB	Output is correct
15	Correct	59 ms	4316 KB	Output is correct
16	Correct	57 ms	4268 KB	Output is correct
17	Correct	58 ms	4524 KB	Output is correct
18	Correct	66 ms	4556 KB	Output is correct
19	Incorrect	54 ms	4208 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	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-