oj.uz

답안 #1060982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060982 2024-08-16T05:11:31 Z Halym2007 사이버랜드 (APIO23_cyberland) C++17
15 / 100
 22 ms 13916 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 <ll, ll>
const int N = 2e5 + 5;
 
vector <pii> v[N];
ll dis[N];
priority_queue <pair <ll, ll>, vector<pair <ll, ll>>, greater <pair <ll, ll>>> q;
ll n, m, k, h, vis[N];
vector <ll> a, tt;
 
void dfs (ll x) {
	vis[x] = 1;
	if (a[x] == 0) {
		tt.pb (x);
	}
	for (pii 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) {
	n = N;m = M;k = K;h = H;
	a.resize(n);
	for (int i = 0; i < n; ++i) {
		a[i] = arr[i];
	}
//	assert (h != 0);
	for (ll i = 0; i < m; ++i) {
		v[x[i]].pb ({y[i], c[i]});
		v[y[i]].pb ({x[i], c[i]});
	}
	
	for (ll i = 0; i < n; ++i) {
		dis[i] = 1e16;
	}
	q.push ({0, h});
	dis[h] = 0;
	while (!q.empty()) {
		ll 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 (ll i : tt) {
		jogap = min (jogap, (double)dis[i]);
	}
	
	if (jogap == (double)1e16) jogap = -1;
	for (ll 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 (ll i=0;i<N;i++)
//      assert(1 == scanf("%d", &arr[i]));
//    for (ll i=0;i<M;i++)
//      assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
//    prllf("%.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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 8028 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8216 KB Correct.
2 Correct 21 ms 8308 KB Correct.
3 Correct 17 ms 8280 KB Correct.
4 Correct 18 ms 8284 KB Correct.
5 Correct 18 ms 8284 KB Correct.
6 Correct 17 ms 9052 KB Correct.
7 Correct 22 ms 9052 KB Correct.
8 Correct 10 ms 10076 KB Correct.
9 Correct 15 ms 8028 KB Correct.
10 Correct 15 ms 8148 KB Correct.

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 8540 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 13916 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 8284 KB Correct.
2 Correct 18 ms 8284 KB Correct.
3 Correct 19 ms 8280 KB Correct.
4 Correct 19 ms 9564 KB Correct.
5 Correct 14 ms 8152 KB Correct.

Subtask #6
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 8540 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 8280 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 8284 KB Wrong Answer.
2 Halted 0 ms 0 KB -