Submission #914282

#	Time	Username	Problem	Language	Result	Execution time	Memory
914282		duckindog	Swapping Cities (APIO20_swap)	C++14	6 / 100	80 ms	16060 KiB

swap

#include "swap.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
vector<pair<int, int>> ad[N];

int n, m;
int p[N];
bool sub1 = 1;
int answers1 = 0;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  n = N; m = M;
  for (int i = 1; i <= M; ++i) {
    int u = U[i - 1], v = V[i - 1], w = W[i - 1];
//    cerr << u << ' ' << v << ' ' << w << '\n';
    ad[u].push_back({v, w});
    ad[v].push_back({u, w});
    answers1 = max(answers1, w);
    if (ad[u].size() > 2 || ad[v].size() > 2) sub1 = 0;
  }

}

int getMinimumFuelCapacity(int X, int Y) {
  if (sub1) return (m == n - 1 ? -1 : answers1);
  return 0;
}

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