Submission #981055

#	Time	Username	Problem	Language	Result	Execution time	Memory
981055		Abito	Swapping Cities (APIO20_swap)	C++17	0 / 100	106 ms	21784 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define ep insert
#define pb push_back
using namespace std;
const int NN=1e5+5;
int n,m,mid,w[NN];
vector<pair<int,int>> adj[NN];
set<int> s;
void init(int N, int M,
          vector<int> U, vector<int> V, vector<int> W) {
    n=N,m=M;
    for (int i=0;i<m;i++) w[V[i]]=W[i],s.ep(W[i]);
    return;
}

int getMinimumFuelCapacity(int X, int Y) {
    if (X && Y && n>3){
        s.erase(s.find(w[X]));
        s.erase(s.find(w[Y]));
        int ans=max(*s.begin(),max(w[X],w[Y]));
        s.ep(w[X]);
        s.ep(w[Y]);
        return ans;
    }
    return -1;
}

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