Submission #403703

#	Time	Username	Problem	Language	Result	Execution time	Memory
403703		aryan12	Swapping Cities (APIO20_swap)	C++17	7 / 100	141 ms	9956 KiB

swap

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

const int N = 1e5 + 5;

int maxWeight = 0;
int weightComing[N];
vector<pair<pair<int, int>, int> > edge;
bool f = true;

bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  return a.second < b.second;
}

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    if(N <= 3)
        f = false;
    maxWeight = 0;
    for(int i = 0; i < M; i++) {
      edge.push_back(make_pair(make_pair(U[i], V[i]), W[i]));
    }
    sort(edge.begin(), edge.end(), cmp);
    for(int i = 0; i < M; i++) {
      weightComing[edge[i].first.second] = edge[i].second;
    }
    maxWeight = edge[2].second;
    if(N == M)
      f = true;
}

int getMinimumFuelCapacity(int X, int Y) {
    if(f) {
        return max(maxWeight, max(weightComing[X], weightComing[Y]));
    }
    return -1;
}

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