oj.uz

답안 #983348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983348 2024-05-15T10:42:39 Z crispxx 사이버랜드 (APIO23_cyberland) C++17
15 / 100
 26 ms 6744 KB 
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree <int, null_type, less<int>, rb_tree_tag, 
		tree_order_statistics_node_update> ordered_set;
typedef pair<double, int> pii;
#define nl '\n'
#define vt vector
#define ar array
#define pb push_back
#define ff first
#define ss second

const int INF = INT_MAX;
double solve(int N, int M, int K, int H, vt<int> x, vt<int> y, vt<int> c, vt<int> arr) {
	int n = N, m = M, k = K, h = H;
	vt<pair<int, int>> adj[n];
	for(int i = 0; i < m; i++) {
		adj[x[i]].pb({y[i], c[i]});
		adj[y[i]].pb({x[i], c[i]});
	}
	vector<double> d(n, numeric_limits<double>::max());
	priority_queue<pii, vt<pii>, greater<pii>> q;
	d[0] = 0;
	q.push({0, 0});
	while(!q.empty()) {
		int u = q.top().ss;
		double res = q.top().ff;
		q.pop();
		
		if(u == h) return res;
		int ch = k;
		if(arr[u] == 2) ch--;
		for(auto &edge : adj[u]) {
			int v = edge.ff;
			int c = edge.ss;
			double nw = res + c;
			
			if(arr[v] == 0) nw = res;
			if(arr[v] == 2 && ch) {
				nw = res + res / 2.;
				ch--;
			}
			
			if(nw < d[v]) {
				d[v] = nw;
				q.push({nw, v});
			}
		}
	}
	return -1;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1204 KB Correct.
2 Correct 22 ms 1372 KB Correct.
3 Correct 19 ms 1368 KB Correct.
4 Correct 25 ms 1360 KB Correct.
5 Correct 20 ms 1372 KB Correct.
6 Correct 15 ms 2136 KB Correct.
7 Correct 22 ms 2140 KB Correct.
8 Correct 10 ms 2956 KB Correct.
9 Correct 18 ms 1264 KB Correct.
10 Correct 21 ms 1116 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1112 KB Correct.
2 Correct 20 ms 1116 KB Correct.
3 Correct 20 ms 1112 KB Correct.
4 Correct 23 ms 2392 KB Correct.
5 Correct 17 ms 1116 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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