Submission #1233384

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233384		inesfi	Swapping Cities (APIO20_swap)	C++20	6 / 100	49 ms	5804 KiB

swap

#include "swap.h"
#include<bits/stdc++.h>
using namespace std;

int nbvilles,nbroutes;
int pluslongue;

void init(int N, int M,vector<int> U, vector<int> V, vector<int> W) {
    nbvilles=N;
    nbroutes=M;
    for (int i=0;i<nbroutes;i++){
        pluslongue=max(pluslongue,W[i]);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if (nbvilles==nbroutes){
        return pluslongue;
    }
    return -1;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27