제출 #407335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407335		proma	자매 도시 (APIO20_swap)	C++17	7 / 100	113 ms	10896 KiB

swap

#include <bits/stdc++.h>

using namespace std;

int n;
vector <pair <int, int>> edge;
vector <int> weight;

void init (int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    weight.resize(N);
    for (int i = 0; i < M; i ++) {
        edge.push_back({W[i], V[i]});
        weight[V[i]] = W[i];
    }
    sort(edge.begin(), edge.end());
}

int getMinimumFuelCapacity (int X, int Y) {
    if (n < 4) {
        return -1;
    }
    if (!X or !Y) {
        int max_weight = weight[Y];
        int cnt = 0;
        for (auto i: edge) {
            if (i.second != Y) {
                max_weight = max(max_weight, i.first);
                cnt ++;
            }
            if (cnt == 2) {
                break;
            }
        }
        return max_weight;
    }
    else {
        int max_weight = max(weight[X], weight[Y]);
        for (auto i: edge) {
            if (i.second != X and i.second != Y) {
                max_weight = max(max_weight, i.first);
                break;
            }
        }
        return max_weight;
    }
}

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