Submission #1041769

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041769		Muhammet	자매 도시 (APIO20_swap)	C++17	0 / 100	159 ms	10768 KiB

swap

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

#define ll long long

const int N = 100005;

ll n, m, v[N];

multiset <ll> s;

void init(int n1, int m1, vector<int> u1, vector<int> v1, vector<int> w1) {
    m = m1;
    for(int i = 0; i < m1; i++){
        v[v1[i]] = (w1[i]);
        s.insert(w1[i]);
    }
}

int getMinimumFuelCapacity(int x, int y) {
    if(m <= 2 or min(x,y) == 0) return -1;
    ll ans = (v[x]+v[y]);
    s.erase(s.find(v[x]));
    s.erase(s.find(v[y]));
    ans += 2*(*s.begin());
    s.insert(v[x]);
    s.insert(v[y]);
    return ans;
}

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