oj.uz

Submission #983958

# Submission time Handle Problem Language Result Execution time Memory
983958 2024-05-16T08:30:54 Z Halym2007 Cyberland (APIO23_cyberland) C++17
21 / 100
 26 ms 8024 KB 
#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define ll long long
const int N = 1e5 + 5;
 
vector <pair <int, ll>> v[N];
 
ll dis[N];
bool vis[N];
 
void dfs (int x) {
	vis[x] = 1;
	for (pair <int, ll> i : v[x]) {
		if (vis[i.ff]) continue;
		dfs (i.ff);
	}
}
 
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
 	bool subtask = 0;
	for (int i = 0; i < M; ++i) {
		v[x[i]].pb ({y[i], (ll)c[i]});
		v[y[i]].pb ({x[i], (ll)c[i]});
		if (arr[i] == 2) {
			subtask = 1;
		}
	}
	double jogap;
	if (!subtask) {
		for (int i = 0; i < N; ++i) {
			dis[i] = 1e18;
		}
		vis[H] = 1;
		dfs (0);
		vis[H] = 0;
		priority_queue <pair <ll, int>, vector <pair <ll, int>>, greater <pair <ll, int>>> q;
		q.push ({0, H});
		dis[H] = 0;
		while (!q.empty()) {
			int x = q.top().ss;
			q.pop();
			for (pair <int, ll> i : v[x]) {
				if (dis[i.ff] > dis[x] + i.ss) {
					dis[i.ff] = dis[x] + i.ss;
					q.push({dis[i.ff], i.ff});
				}
			}
		}
		if (dis[0] != 1e18) {
			jogap = dis[0];
			for (int i = 1; i < N; ++i) {
				if (!arr[i] and vis[i]) jogap = min (jogap, (double)dis[i]);
			}
		}
		else jogap = -1;
	}
	else {
		int sana = 0;
		for (int i = H - 1; i >= 0; i--) {
			if (!arr[i]) break;
			if (arr[i] == 2 and sana < K) {
				sana++;
				vis[i] = 1;
			}
		}
		for (int i = 0; i < H; ++i) {
			double jj = c[i];
			jogap += jj;
			if (!arr[i]) jogap = 0;
			else if (vis[i]) {
				jogap /= 2.0;
			}
		}
	}
	for (int i = 0; i < N; ++i) {
		v[i].clear();
		vis[i] = 0;
	}
	return jogap;
}
 
//int main() {
//	freopen ("input.txt", "r", stdin);
//	int T;
//	assert(1 == scanf("%d", &T));
//	while (T--) {
//    	int N,M,K,H;
//    	assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
//	    std::vector<int> x(M);
//	    std::vector<int> y(M);
//	    std::vector<int> c(M);
//	    std::vector<int> arr(N);
//    	for (int i=0;i<N;i++)
//      		assert(1 == scanf("%d", &arr[i]));
//		for (int i=0;i<M;i++)
//    		assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
//		printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
//	}
//}

Compilation message

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:73:10: warning: 'jogap' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |    jogap += jj;
      |    ~~~~~~^~~~~

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 3676 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 3692 KB Correct.
2 Correct 20 ms 3680 KB Correct.
3 Correct 19 ms 3676 KB Correct.
4 Correct 20 ms 3676 KB Correct.
5 Correct 20 ms 3676 KB Correct.
6 Correct 18 ms 4440 KB Correct.
7 Correct 22 ms 4440 KB Correct.
8 Correct 10 ms 5212 KB Correct.
9 Correct 26 ms 3552 KB Correct.
10 Correct 18 ms 3416 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3848 KB Correct.
2 Correct 19 ms 3676 KB Correct.
3 Correct 18 ms 3728 KB Correct.
4 Correct 19 ms 3420 KB Correct.
5 Correct 19 ms 3560 KB Correct.
6 Correct 5 ms 4132 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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