Submission #1353212

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353212		vahagng	자매 도시 (APIO20_swap)	C++20	6 / 100	65 ms	24652 KiB

swap

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

const int NN = 2e5 + 10;

vector<set<pair<int,int>>> adj(NN);

int n, mx;
bool fl = 0;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  for(int i = 0; i < M; i++){
    adj[U[i]].insert({W[i], V[i]});
    adj[V[i]].insert({W[i], U[i]});
    mx = max(mx, W[i]);
  }
  fl = (M == N - 1);
  n = N;
}

int getMinimumFuelCapacity(int X, int Y) {
  if(fl){
    return -1;
  }
  return mx;
}

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