Submission #532863

#	Time	Username	Problem	Language	Result	Execution time	Memory
532863		ohohorz	Swapping Cities (APIO20_swap)	C++14	6 / 100	130 ms	15664 KiB

swap

#include "swap.h"

#include <vector>
#include<set>
#include<algorithm>
#include<climits>
using namespace std;

// #define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define sz(x) (int)x.size()

const int MAXN = 1e5 + 5;
const int INF = INT_MAX;
const int LOGN = 22;

int n, m;
vector< pair <int,int> > g[MAXN];
bool cycle = 0;
int mx;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  n = N,m = M;

  for(int i = 0;i < m;i++){
    int u = U[i] + 1;
    int v = V[i] + 1;
    mx=max(mx, W[i]);
    g[u].pb(mp(v, W[i]));
    g[v].pb(mp(u, W[i]));
  }
  if(n == m){
      cycle = 1;
  }
}

int getMinimumFuelCapacity(int X, int Y) {
  X++, Y++;
  if(cycle==1){
      return mx;
  }
  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