oj.uz

Submission #394285

# Submission time Handle Problem Language Result Execution time Memory
394285 2021-04-26T10:54:08 Z irmuun Swapping Cities (APIO20_swap) C++17
0 / 100
 1 ms 204 KB 
#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 0;
  }
  else{
    return ans;
  }
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 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
2 Halted 0 ms 0 KB -