Submission #343505

#	Time	Username	Problem	Language	Result	Execution time	Memory
343505		blue	Swapping Cities (APIO20_swap)	C++11	0 / 100	100 ms	9484 KiB

swap

#include "swap.h"
#include <vector>
using namespace std;

int res = 0;
vector<int> wt(100000);
int m1 = 2000000000, m2 = 2000000000, m3 = 2000000000;
int n;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    for(int i = 0; i < M; i++)
    {
        wt[V[i]] = W[i];
        if(W[i] < m1)
        {
            m3 = m2;
            m2 = m1;
            m1 = W[i];
        }
        else if(W[i] < m2)
        {
            m3 = m2;
            m2 = W[i];
        }
        else if(W[i] < m3)
        {
            m3 = W[i];
        }
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if(X == 0 || Y == 0 || n == 3) return -1;
    return max(wt[X], max(wt[Y], m3));
}

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