oj.uz

Submission #847760

# Submission time Handle Problem Language Result Execution time Memory
847760 2023-09-10T10:39:39 Z KN200711 Cyberland (APIO23_cyberland) C++17
44 / 100
 67 ms 27592 KB 
#include "cyberland.h"
# include <bits/stdc++.h>
# define fi first
# define se second
using namespace std;

bool vis[100001];
vector< pair<int, double> > edge[100001];
int h1;

void dfs(int a) {
	vis[a] = 1;
	if(a == h1) return;
	for(auto p : edge[a]) {
		if(!vis[p.fi]) dfs(p.fi);
	}
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
	K = min(K, 70);
	h1 = H;
	for(int i=0;i<N;i++) {
		vis[i] = 0;
		edge[i].clear();
	}
	for(int i=0;i<M;i++) {
		edge[x[i]].push_back(make_pair(y[i], (double) c[i]));
		edge[y[i]].push_back(make_pair(x[i], (double) c[i]));
	}
	dfs(0);
	
	vector< vector<double> > dp;
	dp.resize(K + 1);
	for(int i=0;i<=K;i++) {
		dp[i].resize(N);
		for(int c=0;c<N;c++) dp[i][c] = -1;
	}
	priority_queue< pair<int, pair<double, int> > > PQ;
	for(int d=0;d<N;d++) {
		if(d == 0 || (arr[d] == 0 && vis[d])) PQ.push(make_pair(0, make_pair(0, d)));
	}
	
	while(!PQ.empty()) {
		double a = PQ.top().se.fi;
		int nm = -PQ.top().fi, pos = PQ.top().se.se;
		PQ.pop();
		
		if(dp[nm][pos] != -1) continue;
		dp[nm][pos] = -a;
	//	cout<<pos<<" "<<-nm<<" "<<-a<<endl;
		if(pos == H) break;
		
		for(auto p : edge[pos]) {
			if(arr[p.fi] == 0) continue;
			else if(arr[p.fi] == 1 && dp[nm][p.fi] == -1) PQ.push(make_pair(-nm, make_pair((double) a - ((double) p.se), p.fi)));
			else if(arr[p.fi] == 2) {
				if(nm + 1 <= K && dp[nm+1][p.fi] == -1) PQ.push(make_pair(-nm-1, make_pair(((double) a - (double) p.se) / ((double) 2), p.fi)));
				if(dp[nm][p.fi] == -1) PQ.push(make_pair(-nm, make_pair(((double) a - (double) p.se), p.fi)));
			} 
		}
	}
	double ans = 1e18;
	for(int v=0;v<=K;v++) {
		if(dp[v][H] != (double) -1) ans = min(ans, dp[v][H]);
	}
	if(ans == 1e18) ans = -1;
	return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3160 KB Correct.
2 Correct 21 ms 3248 KB Correct.
3 Correct 19 ms 3164 KB Correct.
4 Correct 21 ms 3208 KB Correct.
5 Correct 20 ms 3216 KB Correct.
6 Correct 18 ms 5980 KB Correct.
7 Correct 24 ms 5804 KB Correct.
8 Correct 16 ms 9308 KB Correct.
9 Correct 21 ms 2908 KB Correct.
10 Correct 21 ms 2908 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3188 KB Correct.
2 Correct 28 ms 3296 KB Correct.
3 Correct 22 ms 3256 KB Correct.
4 Correct 24 ms 2908 KB Correct.
5 Correct 24 ms 2996 KB Correct.
6 Correct 5 ms 5468 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3288 KB Correct.
2 Correct 20 ms 3264 KB Correct.
3 Correct 21 ms 3424 KB Correct.
4 Correct 24 ms 6012 KB Correct.
5 Correct 19 ms 2908 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3300 KB Correct.
2 Correct 24 ms 3352 KB Correct.
3 Correct 44 ms 27592 KB Correct.
4 Correct 15 ms 5388 KB Correct.
5 Correct 22 ms 3000 KB Correct.
6 Correct 21 ms 3332 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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