oj.uz

Submission #919848

# Submission time Handle Problem Language Result Execution time Memory
919848 2024-02-01T17:58:49 Z Lalic Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 440 ms 64968 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5+10;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int act[MAXN], dist[MAXN][2];
vector<pii> g[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][0]=dist[i][1]=INF;
	
	for(int i=0;i<M;i++){
		g[R[i][0]].pb({R[i][1], L[i]});
		g[R[i][1]].pb({R[i][0], L[i]});
	}
	
	priority_queue<pii, vector<pii>, greater<>> pq;
	for(int i=0;i<K;i++){
		act[P[i]]=1;
		pq.push({0, P[i]});
		dist[P[i]][0]=dist[P[i]][1]=0;
	}
	
	while(!pq.empty()){
		pii curr=pq.top();
		pq.pop();
		
		if(!act[curr.se]){
			act[curr.se]=1;
			continue;
		}
		else if(act[curr.se]==2) continue;
		act[curr.se]=2;
		
		for(auto u : g[curr.se]){
			if(dist[curr.se][1]+u.se<dist[u.fi][0]){
				dist[u.fi][1]=dist[u.fi][0];
				dist[u.fi][0]=dist[curr.se][1]+u.se;
				pq.push({dist[u.fi][0], u.fi});
			}
			else if(dist[curr.se][1]+u.se<dist[u.fi][1]){
				dist[u.fi][1]=dist[curr.se][1]+u.se;
				pq.push({dist[u.fi][1], u.fi});
			}
		}
	}
	
	return dist[0][1];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 7000 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 2 ms 6780 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 7000 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 2 ms 6780 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7000 KB Output is correct
10 Correct 2 ms 6744 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 5 ms 7256 KB Output is correct
13 Correct 4 ms 7260 KB Output is correct
14 Correct 2 ms 6744 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 7000 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 2 ms 6780 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7000 KB Output is correct
10 Correct 2 ms 6744 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 5 ms 7256 KB Output is correct
13 Correct 4 ms 7260 KB Output is correct
14 Correct 2 ms 6744 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct
16 Correct 306 ms 62592 KB Output is correct
17 Correct 55 ms 18768 KB Output is correct
18 Correct 77 ms 20192 KB Output is correct
19 Correct 440 ms 64968 KB Output is correct
20 Correct 226 ms 54504 KB Output is correct
21 Correct 29 ms 12376 KB Output is correct
22 Correct 244 ms 51792 KB Output is correct