oj.uz

Submission #70173

# Submission time Handle Problem Language Result Execution time Memory
70173 2018-08-22T12:53:03 Z WA_TLE Crocodile's Underground City (IOI11_crocodile) C++14
100 / 100
 1114 ms 109960 KB 
#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.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 4 ms 532 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 4 ms 532 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 6 ms 1300 KB Output is correct
10 Correct 3 ms 1300 KB Output is correct
11 Correct 5 ms 1300 KB Output is correct
12 Correct 10 ms 2044 KB Output is correct
13 Correct 7 ms 2044 KB Output is correct
14 Correct 3 ms 2044 KB Output is correct
15 Correct 5 ms 2044 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 4 ms 532 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 6 ms 1300 KB Output is correct
10 Correct 3 ms 1300 KB Output is correct
11 Correct 5 ms 1300 KB Output is correct
12 Correct 10 ms 2044 KB Output is correct
13 Correct 7 ms 2044 KB Output is correct
14 Correct 3 ms 2044 KB Output is correct
15 Correct 5 ms 2044 KB Output is correct
16 Correct 1114 ms 109960 KB Output is correct
17 Correct 120 ms 109960 KB Output is correct
18 Correct 165 ms 109960 KB Output is correct
19 Correct 976 ms 109960 KB Output is correct
20 Correct 482 ms 109960 KB Output is correct
21 Correct 75 ms 109960 KB Output is correct
22 Correct 868 ms 109960 KB Output is correct