Submission #394871

#	Time	Username	Problem	Language	Result	Execution time	Memory
394871		Sugardorj	Swapping Cities (APIO20_swap)	C++14	6 / 100	129 ms	11540 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
long long  i,j,s,t;
long long link[261523],size[234567],l=12345678,r,tt,k,y,z,n,m,x;
pair<long long,long long>p[234567];

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 ++){
        p[i].first=W[i];
        p[i].second=U[i]*l+V[i];
    }
    sort (p,p+m);
}

int getMinimumFuelCapacity(int u, int v) {
    if (n==m+1)
        return -1;
    
    return p[m-1].first;
}

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