Submission #394266

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
394266	2021-04-26T09:23:46 Z	Sugardorj	Swapping Cities (APIO20_swap)	C++14	6 / 100	107 ms	5856 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	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	27 ms	2156 KB	Output is correct
10	Correct	34 ms	2472 KB	Output is correct
11	Correct	39 ms	2500 KB	Output is correct
12	Correct	35 ms	2648 KB	Output is correct
13	Correct	34 ms	2652 KB	Output is correct
14	Correct	33 ms	2280 KB	Output is correct
15	Correct	100 ms	4304 KB	Output is correct
16	Correct	96 ms	4304 KB	Output is correct
17	Correct	99 ms	4428 KB	Output is correct
18	Correct	97 ms	4432 KB	Output is correct
19	Correct	74 ms	4012 KB	Output is correct
20	Correct	98 ms	5448 KB	Output is correct
21	Correct	102 ms	5740 KB	Output is correct
22	Correct	103 ms	5832 KB	Output is correct
23	Correct	107 ms	5856 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Incorrect	93 ms	4176 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	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 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	332 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	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	27 ms	2156 KB	Output is correct
10	Correct	34 ms	2472 KB	Output is correct
11	Correct	39 ms	2500 KB	Output is correct
12	Correct	35 ms	2648 KB	Output is correct
13	Correct	34 ms	2652 KB	Output is correct
14	Correct	33 ms	2280 KB	Output is correct
15	Correct	100 ms	4304 KB	Output is correct
16	Correct	96 ms	4304 KB	Output is correct
17	Correct	99 ms	4428 KB	Output is correct
18	Correct	97 ms	4432 KB	Output is correct
19	Incorrect	93 ms	4176 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