Submission #394264

#	Time	Username	Problem	Language	Result	Execution time	Memory
394264		Sugardorj	Swapping Cities (APIO20_swap)	C++14	6 / 100	117 ms	6504 KiB

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 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27