Submission #394264

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
394264	2021-04-26T09:19:07 Z	Sugardorj	Swapping Cities (APIO20_swap)	C++14	6 / 100	117 ms	6504 KB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int  i,j,s,t;
int a[261523],b[234567],l,r,tt,k,y,z,n,m,N,M,x;
vector<int>te,so, p[1234],an;


void init(int NN, int MM, vector <int> U,vector <int> V, vector <int> W) {
    m= W[0];
    N=NN;
    M=MM;
    for (auto u:W)
        m=max (m,u);
}
int getMinimumFuelCapacity(int u, int v) {
    if (N==M+1)
        return -1;
    return m;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	28 ms	2816 KB	Output is correct
10	Correct	34 ms	3140 KB	Output is correct
11	Correct	34 ms	3136 KB	Output is correct
12	Correct	39 ms	3332 KB	Output is correct
13	Correct	36 ms	3288 KB	Output is correct
14	Correct	34 ms	2940 KB	Output is correct
15	Correct	100 ms	5068 KB	Output is correct
16	Correct	117 ms	4984 KB	Output is correct
17	Correct	102 ms	5100 KB	Output is correct
18	Correct	104 ms	5092 KB	Output is correct
19	Correct	62 ms	4684 KB	Output is correct
20	Correct	98 ms	6120 KB	Output is correct
21	Correct	103 ms	6376 KB	Output is correct
22	Correct	104 ms	6440 KB	Output is correct
23	Correct	106 ms	6504 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Incorrect	91 ms	4912 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	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	28 ms	2816 KB	Output is correct
10	Correct	34 ms	3140 KB	Output is correct
11	Correct	34 ms	3136 KB	Output is correct
12	Correct	39 ms	3332 KB	Output is correct
13	Correct	36 ms	3288 KB	Output is correct
14	Correct	34 ms	2940 KB	Output is correct
15	Correct	100 ms	5068 KB	Output is correct
16	Correct	117 ms	4984 KB	Output is correct
17	Correct	102 ms	5100 KB	Output is correct
18	Correct	104 ms	5092 KB	Output is correct
19	Incorrect	91 ms	4912 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	204 KB	Output isn't correct