제출 #70173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70173		WA_TLE	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	1114 ms	109960 KiB

crocodile

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1000000000;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int travel_plan(int n,int m,int R[][2],int L[],int K,int P[]){
	priority_queue<pair<llint,int>,vector<pair<llint,int>>,greater<pair<llint,int>>>que;
	vector<int>dasyu(n,2);
	int i;
	vector<vector<pair<llint,int>>>go(n);
	for(i=0;i<m;i++){
		go[R[i][0]].pub(mp(L[i],R[i][1]));
		go[R[i][1]].pub(mp(L[i],R[i][0]));
	}
	for(i=0;i<K;i++){dasyu[P[i]]=1;que.push(mp(0LL,P[i]));}
	while(que.size()){
		llint zi;int ter;
		tie(zi,ter)=que.top();
		que.pop();
		dasyu[ter]--;
		if(dasyu[ter]==0){
			if(ter==0){return zi;}
			for(auto it:go[ter]){
				que.push(mp(zi+it.fir,it.sec));
			}
		}
	}
	return -1;
}

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11