제출 #569505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569505		niloyroot	Swapping Cities (APIO20_swap)	C++14	0 / 100	87 ms	8736 KiB

swap

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;
 
void init(int a, int b, vector<int> c, vector<int> d, vector<int> e){
 
}
 
int getMinimumFuelCapacity(int X, int Y){
    return -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