oj.uz

Submission #1009190

# Submission time Handle Problem Language Result Execution time Memory
1009190 2024-06-27T09:52:09 Z pcc Cyberland (APIO23_cyberland) C++17
44 / 100
 241 ms 12044 KB 
#include "cyberland.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define pii pair<int,int>
#define fs first
#define sc second

const ld inf = 1e15;
const int mxn  = 1e5+10;
const int lim = 60;
ld dist[mxn];
vector<pii> paths[mxn];
bitset<mxn> able;
int N,M;

namespace DIJKSTRA{
	bitset<mxn> done;
	priority_queue<pair<ld,int>,vector<pair<ld,int>>,greater<pair<ld,int>>> pq;
	void GO(int ban){
		for(int i = 0;i<N;i++){
			done[i] = 0;
			if(ban != i&&able[i])pq.push(make_pair(dist[i],i));
		}
		while(!pq.empty()){
			auto now = pq.top().sc;
			pq.pop();
			if(done[now])continue;
			done[now] = true;
			for(auto &[nxt,w]:paths[now]){
				if(!able[nxt]||done[nxt])continue;
				if(dist[nxt]>dist[now]+w){
					dist[nxt] = dist[now]+w;
					if(nxt != ban)pq.push(make_pair(dist[nxt],nxt));
				}
			}
		}
		return;
	}
}


void init(){
	for(int i = 0;i<N;i++)paths[i].clear();
}

double solve(int NN, int MM, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> z, std::vector<int> arr) {
	init();
	N = NN,M = MM;
	for(int i = 0;i<M;i++){
		int a = x[i],b = y[i],c = z[i];
		paths[a].push_back(pii(b,c));
		paths[b].push_back(pii(a,c));
	}
	for(int i = 0;i<N;i++)able[i] = true,dist[i] = inf;
	dist[0] = 0;
	DIJKSTRA::GO(H);
	for(int i = 0;i<N;i++){
		if(dist[i]+1<inf)able[i] = true;
		else able[i] = false;
	}
	if(!able[H])return -1;
	for(int i = 0;i<N;i++){
		if(able[i]&&arr[i] == 0)dist[i] = 0;
		else dist[i] = inf;
	}
	dist[0] = 0;
	ld ans = inf;
	for(int i = 0;i<=min(lim,K);i++){
		DIJKSTRA::GO(-1);
		ans = min(ans,dist[H]);
		if(arr[H] == 2&&i+1<=min(lim,K))ans = min(ans,dist[H]/2);
		dist[H] = inf;
		for(int j = 0;j<N;j++){
			if(!able[j])dist[j] = inf;
			else if(arr[j] == 2)dist[j] /= 2;
		}
	}
	return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2904 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2904 KB Correct.
2 Correct 92 ms 2960 KB Correct.
3 Correct 88 ms 2924 KB Correct.
4 Correct 91 ms 2936 KB Correct.
5 Correct 107 ms 2904 KB Correct.
6 Correct 198 ms 4044 KB Correct.
7 Correct 241 ms 4436 KB Correct.
8 Correct 124 ms 5344 KB Correct.
9 Correct 76 ms 3448 KB Correct.
10 Correct 71 ms 3628 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 3512 KB Correct.
2 Correct 123 ms 3592 KB Correct.
3 Correct 123 ms 3704 KB Correct.
4 Correct 81 ms 3504 KB Correct.
5 Correct 84 ms 3408 KB Correct.
6 Correct 42 ms 3932 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 115 ms 8988 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 3688 KB Correct.
2 Correct 52 ms 3540 KB Correct.
3 Correct 56 ms 3628 KB Correct.
4 Correct 123 ms 4368 KB Correct.
5 Correct 41 ms 3452 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 3772 KB Correct.
2 Correct 45 ms 3668 KB Correct.
3 Correct 45 ms 12044 KB Correct.
4 Correct 73 ms 3968 KB Correct.
5 Correct 56 ms 3536 KB Correct.
6 Correct 48 ms 3728 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 3660 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 97 ms 3668 KB Wrong Answer.
2 Halted 0 ms 0 KB -