oj.uz

Submission #394263

# Submission time Handle Problem Language Result Execution time Memory
394263 2021-04-26T09:14:28 Z Sugardorj Swapping Cities (APIO20_swap) C++14
0 / 100
 1 ms 332 KB 
#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,W;


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

Subtask #1
0 / 6.0

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