Submission #965939

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
965939	2024-04-19T08:19:54 Z	Darren0724	Swapping Cities (APIO20_swap)	C++17	6 / 100	72 ms	12220 KB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int N=200005;
int n,m,mx;
vector<int> u,v,w;
vector<int> deg(N);
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	n=N,m=M;
	u=U,v=V,w=W;
	mx=*max_element(w.begin(),w.end());
	/*for(int i=0;i<M;i++){
		deg[]
	}*/
}

int getMinimumFuelCapacity(int X, int Y) {
	if(m==n)return mx;
	

	return -1;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1368 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Correct	18 ms	3932 KB	Output is correct
10	Correct	22 ms	4436 KB	Output is correct
11	Correct	22 ms	4436 KB	Output is correct
12	Correct	24 ms	4704 KB	Output is correct
13	Correct	23 ms	4696 KB	Output is correct
14	Correct	22 ms	3932 KB	Output is correct
15	Correct	64 ms	6352 KB	Output is correct
16	Correct	67 ms	6600 KB	Output is correct
17	Correct	65 ms	6332 KB	Output is correct
18	Correct	64 ms	6344 KB	Output is correct
19	Correct	40 ms	5204 KB	Output is correct
20	Correct	66 ms	11700 KB	Output is correct
21	Correct	72 ms	11816 KB	Output is correct
22	Correct	68 ms	12212 KB	Output is correct
23	Correct	69 ms	12220 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1368 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Incorrect	66 ms	6024 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	1368 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Incorrect	1 ms	1116 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	1116 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	1368 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Correct	18 ms	3932 KB	Output is correct
10	Correct	22 ms	4436 KB	Output is correct
11	Correct	22 ms	4436 KB	Output is correct
12	Correct	24 ms	4704 KB	Output is correct
13	Correct	23 ms	4696 KB	Output is correct
14	Correct	22 ms	3932 KB	Output is correct
15	Correct	64 ms	6352 KB	Output is correct
16	Correct	67 ms	6600 KB	Output is correct
17	Correct	65 ms	6332 KB	Output is correct
18	Correct	64 ms	6344 KB	Output is correct
19	Incorrect	66 ms	6024 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	1116 KB	Output isn't correct
2	Halted	0 ms	0 KB	-