제출 #738287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
738287		shadow_sami	자매 도시 (APIO20_swap)	C++17	0 / 100	253 ms	10752 KiB

swap

#include "swap.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
// vi adj[mx];
// typedef struct EDGE{
// 	ll src,dest,wet;
// 	void init(ll aa,ll bb,ll cc){
// 		src = aa;
// 		dest = bb;
// 		wet = cc;
// 		return;
// 	}
// }edge;

// edge qt;

// bool cmp(const edge &aa,const edge &bb){
// 	return aa.wet < bb.wet;
// }

// vector<edge> ve;

// typedef struct Disjoint_Set_Union{
// 	vi parent,siz;
// 	vector<bool> flag,flag2;
// 	vi degree;
// 	ll srcparent,destparent;
// 	void init(ll k){
// 		parent.resize(k+5);
// 		siz.resize(k+5,1);
// 		degree.resize(k+5,0);
// 		flag.resize(k+5,false);
// 		flag2.resize(k+5,false);
// 		fip(0,k+5){
// 			parent[i] = i;
// 			degree[i] = 0;
// 			flag2[i] = flag[i] = false;
// 			siz[i] = 1;
// 		}
// 		return;
// 	}
// 	ll find(ll k){
// 		return parent[k] == k ? k : parent[k] = find(parent[k]);
// 	}
// 	bool unite(ll u,ll v){
// 		srcparent=find(u);
// 		destparent=find(v);
// 		degree[u]++;
// 		degree[v]++;
// 		if(degree[u]>2)
// 			flag2[srcparent] = 1;
// 		if(degree[v]>2)
// 			flag2[destparent] = 1;
// 		if(srcparent==destparent){
// 			flag[srcparent] = 1;
// 			return 0;
// 		}
// 		if(siz[srcparent] < siz[destparent])
// 			swap(srcparent,destparent);
// 		parent[destparent] = srcparent;
// 		siz[srcparent] += siz[destparent];
// 		flag[srcparent] = flag[srcparent] | flag[destparent];
// 		flag2[srcparent] = flag2[srcparent] | flag2[destparent];
// 		return 1;
// 	}
// }DSU;

// DSU dsu;
multiset<ll> st;
ll wet[mx];

void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {
	n = N;
	m = M;
	st.clear();
	fip(0,m){
		wet[V[i]] = W[i];
		st.insert(W[i]);
	}
	return;
}

int getMinimumFuelCapacity(int X, int Y) {
	if(!X || !Y)
		return -1;
	st.erase(wet[X]);
	st.erase(wet[Y]);
	ans = -1;
	if(st.size()){
		tp = *st.begin();
		ans = max(tp,max(wet[X],wet[Y]));
	}
	st.insert(wet[X]);
	st.insert(wet[Y]);
	return ans;
}


// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         int N,M;
//         cin>>N>>M;
//         vector<int> U(M),V(M),W(M);
//         fip(0,M){
//         	cin>>U[i]>>V[i]>>W[i];
//         }
//         // debug(W);
//         init(N,M,U,V,W);
//         ll Q;
//         cin>>Q;
//         int sr,de;
//         fip(0,Q){
//         	cin>>sr>>de;
//         	cout<<getMinimumFuelCapacity(sr,de)<<nli;
//         }
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

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