Submission #735428

#	Time	Username	Problem	Language	Result	Execution time	Memory
735428		keisuke6	Swapping Cities (APIO20_swap)	C++14	0 / 100	87 ms	7036 KiB

swap

#include "swap.h"

#include <bits/stdc++.h>
using namespace std;
int N,M;
vector<int> U,V,W,W_;
void init(int NN, int MM,
          std::vector<int> UU, std::vector<int> VV, std::vector<int> WW) {
            N = NN;
            M = MM;
            U = UU;
            V = VV;
            W = WW;
            W_ = W;
            for(int i=0;i<M;i++){
              W[V[i]-1] = W_[i];
            }
            std::sort(W_.begin(),W_.end());
}

int getMinimumFuelCapacity(int X, int Y) {
  if(N == 2 || N == 3) return -1;
  if(X == 0){
    if(W_[0] == W[Y-1]) return W_[1];
    else return W_[0];
  }
  else{
    int a = W[X-1];
    int b = W[Y-1];
    if(a > b) swap(a,b);
    if(a == W_[0] && b == W_[1]) return W_[2];
    else return b;
  }
}

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