제출 #395181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
395181		abc864197532	Swapping Cities (APIO20_swap)	C++17	0 / 100	124 ms	14300 KiB

swap

#include <bits/stdc++.h>
// #include "grader_swap.cpp"
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
	for (auto i : x) cout << i << ' ';\
	cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
    return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
    return o >> a.X >> a.Y;
}
const int mod = 1e9 + 7, abc = 864197532, Doludu = 123, N = 100001, logN = 18, K = 40;

vector <pii> adj[N];
int n;

void init(int _n, int m, vector <int> u, vector <int> v, vector <int> w) {
    n = _n;
    for (int i = 0; i < n; ++i) adj[i].clear();
    for (int i = 0; i < m; ++i) {
        adj[u[i]].eb(v[i], w[i]);
        adj[v[i]].eb(u[i], w[i]);
    }
}

int getMinimumFuelCapacity(int u, int v) {
    return -1;
}
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
2 3 3
1 4 10
3
1 2
2 4
0 1
 */

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