Submission #962352

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
962352	2024-04-13T11:06:20 Z	Mohamed_Kachef06	Swapping Cities (APIO20_swap)	C++17	6 / 100	81 ms	11452 KB

swap

#include "swap.h"
//#include "grader.cpp"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int n ,  m; 
vector<int> u , v , w; 
int mx ; 
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
      n = N; m = M; u = U; v = V; w = W; 
      mx = *max_element(w.begin() , w.end());
}

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	1 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	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	18 ms	3164 KB	Output is correct
10	Correct	25 ms	3676 KB	Output is correct
11	Correct	21 ms	3612 KB	Output is correct
12	Correct	23 ms	3932 KB	Output is correct
13	Correct	22 ms	3932 KB	Output is correct
14	Correct	21 ms	3164 KB	Output is correct
15	Correct	60 ms	5564 KB	Output is correct
16	Correct	60 ms	5332 KB	Output is correct
17	Correct	62 ms	5560 KB	Output is correct
18	Correct	61 ms	5560 KB	Output is correct
19	Correct	41 ms	4436 KB	Output is correct
20	Correct	61 ms	10960 KB	Output is correct
21	Correct	64 ms	11024 KB	Output is correct
22	Correct	81 ms	11452 KB	Output is correct
23	Correct	66 ms	11448 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	60 ms	5256 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	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Incorrect	1 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	1 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	1 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	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	18 ms	3164 KB	Output is correct
10	Correct	25 ms	3676 KB	Output is correct
11	Correct	21 ms	3612 KB	Output is correct
12	Correct	23 ms	3932 KB	Output is correct
13	Correct	22 ms	3932 KB	Output is correct
14	Correct	21 ms	3164 KB	Output is correct
15	Correct	60 ms	5564 KB	Output is correct
16	Correct	60 ms	5332 KB	Output is correct
17	Correct	62 ms	5560 KB	Output is correct
18	Correct	61 ms	5560 KB	Output is correct
19	Incorrect	60 ms	5256 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	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-