Submission #717453

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
717453	2023-04-02T00:08:11 Z	1ne	Swapping Cities (APIO20_swap)	C++14	6 / 100	110 ms	10296 KB

swap

#include "swap.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
int n,m,maxxy = 0;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;
	for (auto x:W){
		maxxy = max(maxxy,x);
	}

}

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

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	2 ms	464 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	29 ms	3792 KB	Output is correct
10	Correct	35 ms	4480 KB	Output is correct
11	Correct	28 ms	4476 KB	Output is correct
12	Correct	41 ms	4660 KB	Output is correct
13	Correct	35 ms	4656 KB	Output is correct
14	Correct	38 ms	4096 KB	Output is correct
15	Correct	110 ms	8576 KB	Output is correct
16	Correct	78 ms	8492 KB	Output is correct
17	Correct	83 ms	8768 KB	Output is correct
18	Correct	90 ms	8760 KB	Output is correct
19	Correct	49 ms	6124 KB	Output is correct
20	Correct	81 ms	9584 KB	Output is correct
21	Correct	83 ms	10012 KB	Output is correct
22	Correct	99 ms	10296 KB	Output is correct
23	Correct	82 ms	10164 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Incorrect	96 ms	7340 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	2 ms	464 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Incorrect	1 ms	212 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	212 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	2 ms	464 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	29 ms	3792 KB	Output is correct
10	Correct	35 ms	4480 KB	Output is correct
11	Correct	28 ms	4476 KB	Output is correct
12	Correct	41 ms	4660 KB	Output is correct
13	Correct	35 ms	4656 KB	Output is correct
14	Correct	38 ms	4096 KB	Output is correct
15	Correct	110 ms	8576 KB	Output is correct
16	Correct	78 ms	8492 KB	Output is correct
17	Correct	83 ms	8768 KB	Output is correct
18	Correct	90 ms	8760 KB	Output is correct
19	Incorrect	96 ms	7340 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	212 KB	Output isn't correct
2	Halted	0 ms	0 KB	-