Submission #981049

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
981049	2024-05-12T18:24:47 Z	Abito	Swapping Cities (APIO20_swap)	C++17	6 / 100	71 ms	12856 KB

swap

#include "swap.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
const int NN=1e5+5;
int n,m,mid,mx;
vector<pair<int,int>> adj[NN];
void init(int N, int M,
          vector<int> U, vector<int> V, vector<int> W) {
    n=N,m=M;
    for (int i=0;i<m;i++) mx=max(mx,W[i]);
    return;
}

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	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	2 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2816 KB	Output is correct
9	Correct	20 ms	6268 KB	Output is correct
10	Correct	24 ms	6992 KB	Output is correct
11	Correct	24 ms	7004 KB	Output is correct
12	Correct	25 ms	7148 KB	Output is correct
13	Correct	25 ms	7024 KB	Output is correct
14	Correct	24 ms	6480 KB	Output is correct
15	Correct	67 ms	11128 KB	Output is correct
16	Correct	66 ms	11008 KB	Output is correct
17	Correct	66 ms	11256 KB	Output is correct
18	Correct	67 ms	11196 KB	Output is correct
19	Correct	39 ms	8428 KB	Output is correct
20	Correct	65 ms	11984 KB	Output is correct
21	Correct	67 ms	12304 KB	Output is correct
22	Correct	71 ms	12856 KB	Output is correct
23	Correct	68 ms	12500 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Incorrect	61 ms	6568 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	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	2 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2816 KB	Output is correct
9	Incorrect	1 ms	2652 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	2652 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	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	2 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2816 KB	Output is correct
9	Correct	20 ms	6268 KB	Output is correct
10	Correct	24 ms	6992 KB	Output is correct
11	Correct	24 ms	7004 KB	Output is correct
12	Correct	25 ms	7148 KB	Output is correct
13	Correct	25 ms	7024 KB	Output is correct
14	Correct	24 ms	6480 KB	Output is correct
15	Correct	67 ms	11128 KB	Output is correct
16	Correct	66 ms	11008 KB	Output is correct
17	Correct	66 ms	11256 KB	Output is correct
18	Correct	67 ms	11196 KB	Output is correct
19	Incorrect	61 ms	6568 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	2652 KB	Output isn't correct
2	Halted	0 ms	0 KB	-