Submission #394292

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
394292	2021-04-26T10:59:08 Z	irmuun	Swapping Cities (APIO20_swap)	C++17	6 / 100	103 ms	5824 KB

swap

#include "swap.h"
#include<bits/stdc++.h>
using namespace std;
int ans=0,i,n,m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  ans=W[0];
  n=N;
  m=M;
  for(i=0;i<M;i++){
    ans=max(ans,W[i]);
  }
}
int getMinimumFuelCapacity(int X, int Y) {
  if(m+1==n){
    return -1;
  }
  else{
    return ans;
  }
}

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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	26 ms	2120 KB	Output is correct
10	Correct	31 ms	2500 KB	Output is correct
11	Correct	33 ms	2436 KB	Output is correct
12	Correct	41 ms	2624 KB	Output is correct
13	Correct	33 ms	2628 KB	Output is correct
14	Correct	38 ms	2240 KB	Output is correct
15	Correct	97 ms	4304 KB	Output is correct
16	Correct	93 ms	4264 KB	Output is correct
17	Correct	100 ms	4356 KB	Output is correct
18	Correct	99 ms	4420 KB	Output is correct
19	Correct	72 ms	3984 KB	Output is correct
20	Correct	92 ms	5452 KB	Output is correct
21	Correct	99 ms	5628 KB	Output is correct
22	Correct	101 ms	5792 KB	Output is correct
23	Correct	103 ms	5824 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	204 KB	Output is correct
3	Incorrect	89 ms	4132 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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	26 ms	2120 KB	Output is correct
10	Correct	31 ms	2500 KB	Output is correct
11	Correct	33 ms	2436 KB	Output is correct
12	Correct	41 ms	2624 KB	Output is correct
13	Correct	33 ms	2628 KB	Output is correct
14	Correct	38 ms	2240 KB	Output is correct
15	Correct	97 ms	4304 KB	Output is correct
16	Correct	93 ms	4264 KB	Output is correct
17	Correct	100 ms	4356 KB	Output is correct
18	Correct	99 ms	4420 KB	Output is correct
19	Incorrect	89 ms	4132 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