oj.uz

Submission #1060945

# Submission time Handle Problem Language Result Execution time Memory
1060945 2024-08-16T04:54:24 Z Halym2007 Cyberland (APIO23_cyberland) C++17
15 / 100
 20 ms 12120 KB 
#include <bits/stdc++.h>
//#include "cyberland.h"
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
const int N = 2e5 + 5;

vector <pii> v[N];
ll dis[N];
priority_queue <pair <ll, int>, vector<pair <ll, int>>, greater <pair <ll, int>>> q;
int n, m, k, h, vis[N];
vector <int> a, tt;

void dfs (int x) {
	vis[x] = 1;
	for (pii i : v[x]) {
		if (vis[i.ff]) continue;
		if (a[i.ff] == 0) {
			tt.pb (i.ff);
		}
		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) {
	n = N;m = M;k = K;h = H;
	a = arr;
	assert (h != 0);
	for (int i = 0; i < m; ++i) {
		v[x[i]].pb ({y[i], c[i]});
		v[y[i]].pb ({x[i], c[i]});
	}
	
	for (int i = 0; i < n; ++i) {
		dis[i] = 1e16;
	}
	q.push ({0, h});
	dis[h] = 0;
	while (!q.empty()) {
		int x = q.top().ss;
		q.pop();
		for (pii 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});
			}		
		}
	} 
	double jogap = 1e16;
	jogap = min (jogap, (double)dis[0]);
	vis[h] = 1;
	dfs (0);
	
	for (int i : tt) {
		jogap = min (jogap, (double)dis[i]);
	}
	
	if (jogap == (double)1e16) jogap = -1;
	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));
//  }
//}


/*
1
3 2 30
2
1 2 1
1 2 12
2 0 4
answer : 4.00000000000

1
4 4 30
3
1 0 2 1
0 1 5
0 2 4
1 3 2
2 3 4
answer : 2.00000000000
*/

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7436 KB Correct.
2 Correct 16 ms 7260 KB Correct.
3 Correct 16 ms 7408 KB Correct.
4 Correct 17 ms 7260 KB Correct.
5 Correct 17 ms 7464 KB Correct.
6 Correct 14 ms 8028 KB Correct.
7 Correct 18 ms 8028 KB Correct.
8 Correct 14 ms 8792 KB Correct.
9 Correct 15 ms 7260 KB Correct.
10 Correct 14 ms 7380 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7516 KB Correct.
2 Correct 16 ms 7516 KB Correct.
3 Correct 16 ms 7508 KB Correct.
4 Correct 15 ms 8284 KB Correct.
5 Correct 14 ms 7256 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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