oj.uz

Submission #745293

# Submission time Handle Problem Language Result Execution time Memory
745293 2023-05-19T18:58:17 Z CSQ31 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 2000 ms 152852 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (int)(a.size())
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll A,ll B) {if(!B)return A;return gcd(B,A%B);}
const int INF = 1e9+2,MAXN = 1e5+5;
int dist[MAXN];
vector<pii> adj[MAXN];
multiset<int>s[MAXN];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for(int i=0;i<N;i++)dist[i] = INF;
	for(int i=0;i<M;i++){
		adj[R[i][0]].pb({R[i][1],L[i]});
		adj[R[i][1]].pb({R[i][0],L[i]});
	}
	priority_queue<pii,vector<pii>,greater<pii>>pq;
	for(int i=0;i<K;i++){
		dist[P[i]] = 0;
		pq.push({0,P[i]});
	}
	while(!pq.empty()){
		int v = pq.top().se;
		int d = pq.top().fi;
		pq.pop();
		if(d != dist[v])continue;
		for(auto x:adj[v]){
			int w = x.se;
			int u = x.fi;
			s[u].insert(d+w);
			if(sz(s[u]) == 1)continue;
			auto it = s[u].begin();
			it++;
			if(*it < dist[u]){
				dist[u] = *it;
				pq.push({dist[u],u});
			}			
		}
	}
	return dist[0];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct
4 Correct 4 ms 7516 KB Output is correct
5 Correct 5 ms 7516 KB Output is correct
6 Correct 5 ms 7504 KB Output is correct
7 Correct 5 ms 7508 KB Output is correct
8 Correct 5 ms 7512 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct
4 Correct 4 ms 7516 KB Output is correct
5 Correct 5 ms 7516 KB Output is correct
6 Correct 5 ms 7504 KB Output is correct
7 Correct 5 ms 7508 KB Output is correct
8 Correct 5 ms 7512 KB Output is correct
9 Correct 8 ms 8016 KB Output is correct
10 Correct 4 ms 7328 KB Output is correct
11 Correct 5 ms 7648 KB Output is correct
12 Correct 11 ms 8660 KB Output is correct
13 Correct 9 ms 8732 KB Output is correct
14 Correct 6 ms 7428 KB Output is correct
15 Correct 5 ms 7648 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct
4 Correct 4 ms 7516 KB Output is correct
5 Correct 5 ms 7516 KB Output is correct
6 Correct 5 ms 7504 KB Output is correct
7 Correct 5 ms 7508 KB Output is correct
8 Correct 5 ms 7512 KB Output is correct
9 Correct 8 ms 8016 KB Output is correct
10 Correct 4 ms 7328 KB Output is correct
11 Correct 5 ms 7648 KB Output is correct
12 Correct 11 ms 8660 KB Output is correct
13 Correct 9 ms 8732 KB Output is correct
14 Correct 6 ms 7428 KB Output is correct
15 Correct 5 ms 7648 KB Output is correct
16 Execution timed out 2068 ms 152852 KB Time limit exceeded
17 Halted 0 ms 0 KB -