Submission #747412

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
747412	2023-05-24T07:05:13 Z	vjudge1	Swapping Cities (APIO20_swap)	C++17	6 / 100	86 ms	10164 KB

swap

#include "swap.h"

#include <bits/stdc++.h>

using namespace std;

bool bambusz = true;
int mx = 0;

void init(int N, int M,
    std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    if(M == N) bambusz = false;
    for(int i : W)mx = max(mx, i);
}

int getMinimumFuelCapacity(int X, int Y) {
    if(bambusz)return -1;
    return mx;
}

/*

3 2
0 1 5
0 2 5
1
1 2


*/

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	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	26 ms	3780 KB	Output is correct
10	Correct	29 ms	4488 KB	Output is correct
11	Correct	30 ms	4476 KB	Output is correct
12	Correct	34 ms	4656 KB	Output is correct
13	Correct	35 ms	4652 KB	Output is correct
14	Correct	31 ms	4148 KB	Output is correct
15	Correct	85 ms	8604 KB	Output is correct
16	Correct	82 ms	8604 KB	Output is correct
17	Correct	84 ms	8764 KB	Output is correct
18	Correct	86 ms	8860 KB	Output is correct
19	Correct	47 ms	6012 KB	Output is correct
20	Correct	81 ms	9636 KB	Output is correct
21	Correct	79 ms	10020 KB	Output is correct
22	Correct	84 ms	10164 KB	Output is correct
23	Correct	80 ms	10148 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	81 ms	8100 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	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 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	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	26 ms	3780 KB	Output is correct
10	Correct	29 ms	4488 KB	Output is correct
11	Correct	30 ms	4476 KB	Output is correct
12	Correct	34 ms	4656 KB	Output is correct
13	Correct	35 ms	4652 KB	Output is correct
14	Correct	31 ms	4148 KB	Output is correct
15	Correct	85 ms	8604 KB	Output is correct
16	Correct	82 ms	8604 KB	Output is correct
17	Correct	84 ms	8764 KB	Output is correct
18	Correct	86 ms	8860 KB	Output is correct
19	Incorrect	81 ms	8100 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	-