Submission #405663

#	Time	Username	Problem	Language	Result	Execution time	Memory
405663		Blistering_Barnacles	Swapping Cities (APIO20_swap)	C++11	6 / 100	135 ms	26420 KiB

swap

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include "swap.h"
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
pll tree[555555] ;
    bool is = 1 ;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    for(ll i = 0 ; i < M ; i++){
        adj[U[i]].pb(V[i]) , adj[V[i]].pb(U[i]);
        k = max(k , W[i]) ;
    }
    for(ll i = 0 ; i < N ; i++){
        is &= (sz(adj[i]) == 2) ;
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    R (is ? k : -1) ;
}

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