Submission #1029373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029373		VMaksimoski008	Swapping Cities (APIO20_swap)	C++17	6 / 100	75 ms	16264 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const int maxn = 1e5 + 5;
int n, m;
vector<pii> graph[maxn];
vector<int> deg(maxn);
int mn = 1e9, mx = 0;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    for(int i=0; i<m; i++) {
        graph[U[i]].push_back({ V[i], W[i] });
        graph[V[i]].push_back({ U[i], W[i] });
        mx = max(mx, W[i]);
        deg[U[i]]++; deg[V[i]]++;
    }

    for(int i=0; i<N; i++) mn = min(mn, deg[i]);
}

int getMinimumFuelCapacity(int X, int Y) {
    if(mn == 1) 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