Submission #743421

# Submission time Handle Problem Language Result Execution time Memory
743421 2023-05-17T11:32:52 Z Mauve Swapping Cities (APIO20_swap) C++14
6 / 100
85 ms 8104 KB
#include "swap.h"
#include<bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
using namespace std;
int l,r,i,j,ii,jj,k,n,m,mx;
vector< pair<int,int> > v[100000];
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n=N;
    m=M;
    for(i=0;i<M;i++){
        mx=max(mx,W[i]);
    }
}
int getMinimumFuelCapacity(int X, int Y) {
    if(m<n) return -1;
    return mx;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 24 ms 4436 KB Output is correct
10 Correct 29 ms 4812 KB Output is correct
11 Correct 31 ms 4796 KB Output is correct
12 Correct 35 ms 4976 KB Output is correct
13 Correct 32 ms 4996 KB Output is correct
14 Correct 31 ms 4588 KB Output is correct
15 Correct 82 ms 6752 KB Output is correct
16 Correct 79 ms 6652 KB Output is correct
17 Correct 83 ms 6748 KB Output is correct
18 Correct 80 ms 6772 KB Output is correct
19 Correct 46 ms 6472 KB Output is correct
20 Correct 81 ms 7820 KB Output is correct
21 Correct 81 ms 8072 KB Output is correct
22 Correct 82 ms 8068 KB Output is correct
23 Correct 85 ms 8104 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 75 ms 6564 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Incorrect 2 ms 2656 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2656 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 24 ms 4436 KB Output is correct
10 Correct 29 ms 4812 KB Output is correct
11 Correct 31 ms 4796 KB Output is correct
12 Correct 35 ms 4976 KB Output is correct
13 Correct 32 ms 4996 KB Output is correct
14 Correct 31 ms 4588 KB Output is correct
15 Correct 82 ms 6752 KB Output is correct
16 Correct 79 ms 6652 KB Output is correct
17 Correct 83 ms 6748 KB Output is correct
18 Correct 80 ms 6772 KB Output is correct
19 Incorrect 75 ms 6564 KB Output isn't correct
20 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2656 KB Output isn't correct
2 Halted 0 ms 0 KB -