oj.uz

Submission #1009263

# Submission time Handle Problem Language Result Execution time Memory
1009263 2024-06-27T10:41:52 Z pcc Cyberland (APIO23_cyberland) C++17
44 / 100
 749 ms 17608 KB 
#include "cyberland.h"

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

const ld inf = 1e15;
const int mxn  = 2e5+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++){
			dist[i+N] = inf;
			done[i] = done[i+N] = false;
			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;
			int pid = (now<N?now:now-N);
			for(auto &[nxt,w]:paths[pid]){
				if(!able[nxt]||done[nxt+N])continue;
				if(dist[nxt+N] > dist[now]+w){
					dist[nxt+N] = dist[now]+w;
					if(nxt != ban)pq.push(make_pair(dist[nxt+N],nxt+N));
				}
			}
		}
		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*2;i++)able[i] = true;
	for(int i = 0;i<N;i++)dist[i] = inf;
	dist[0] = 0;
	DIJKSTRA::GO(H);
	for(int i = 0;i<N;i++){
		able[i] = able[i+N] = (min(dist[i],dist[i+N])+1<inf);
	}
	for(int i = 0;i<N;i++){
		if(able[i]&&arr[i] == 0)dist[i] = 0;
		else dist[i] = inf;
	}
	if(!able[H])return -1;
	dist[0] = 0;
	ld ans = inf;
	for(int i = 0;i<=min(K,lim);i++){
		DIJKSTRA::GO(-1);
		ans = min({ans,dist[H],dist[H+N]});
		if(i+1<=min(K,lim)&&arr[H] == 2)ans = min({ans,dist[H]/2,dist[H+N]/2});
		for(int j = 0;j<N;j++){
			dist[j] = min(dist[j],dist[j+N]);
			if(able[j]&&arr[j] == 2)dist[j] = min(dist[j],dist[j+N]/2);
		}
		dist[H] = inf;
	}
	return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 6744 KB Correct.
2 Correct 405 ms 6844 KB Correct.
3 Correct 381 ms 6744 KB Correct.
4 Correct 414 ms 6856 KB Correct.
5 Correct 393 ms 6744 KB Correct.
6 Correct 582 ms 7728 KB Correct.
7 Correct 749 ms 7632 KB Correct.
8 Correct 328 ms 9176 KB Correct.
9 Correct 243 ms 6768 KB Correct.
10 Correct 224 ms 6780 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 6864 KB Correct.
2 Correct 439 ms 6744 KB Correct.
3 Correct 398 ms 6872 KB Correct.
4 Correct 262 ms 6744 KB Correct.
5 Correct 262 ms 6744 KB Correct.
6 Correct 137 ms 7896 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 12756 KB Correct.
2 Incorrect 294 ms 6748 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 6744 KB Correct.
2 Correct 160 ms 6744 KB Correct.
3 Correct 177 ms 6744 KB Correct.
4 Correct 332 ms 7764 KB Correct.
5 Correct 106 ms 6744 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 6748 KB Correct.
2 Correct 155 ms 6744 KB Correct.
3 Correct 49 ms 17608 KB Correct.
4 Correct 239 ms 7888 KB Correct.
5 Correct 137 ms 6748 KB Correct.
6 Correct 193 ms 6900 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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