oj.uz

답안 #758815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758815 2023-06-15T10:47:13 Z OrazB 사이버랜드 (APIO23_cyberland) C++17
44 / 100
 3000 ms 2097152 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <double, int>
#define pb push_back
#define ff first
#define ss second

vector<pii> E[N];

double F(int x){
	double res = 1.0;
	while(x--) res *= 2;
	return res;
}

void dfs(int nd, int h, vector<int> arr, vector<int> &z, vector<double> &dis, vector<bool> &vis){
	if (!arr[nd]){
		z.pb(nd);
		dis[nd] = 0;
	} 
	vis[nd] = 1;
	for (auto i : E[nd]){
		if (vis[i.ff] or i.ff == h) continue;
		dfs(i.ff, h, arr, z, dis, vis);	
	}
}

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
	for (int i = 0; i < n; i++) E[i].clear();
	for (int i = 0; i < m; i++){
		E[x[i]].pb({y[i], c[i]});
		E[y[i]].pb({x[i], c[i]});	
	}
	vector<int> vec, z = {0};
	vector<bool> vis(n, 0);
	vector<double> dis(n, 1e15);
	dis[0] = 0;
	dfs(0, h, arr, z, dis, vis);
	for (int i = 0; i < n; i++){
		if (arr[i] == 2) vec.pb(i);
	}
	set<pii> q;
	for (auto i : z) q.insert({0, i});
	for (int i = 0; i <= k; i++){
		while(!q.empty()){
			int x = (*q.begin()).ss;
			q.erase(q.begin());
			if (x == h) continue;
			for (auto j : E[x]){
				double res = (dis[x]/F(i))+j.ss;
				if (dis[j.ff] > res){
					q.erase({dis[j.ff], j.ff});
					dis[j.ff] = res;
					q.insert({dis[j.ff], j.ff});
				}
			}
		}
		for (auto j : z) q.insert({0, j});
		for (auto j : vec) q.insert({dis[j], j});
	}
	if (dis[h] == 1e15) return double(-1);
	return dis[h];
}

// int main () 
// {
// 	int n, m, k, h;
// 	cin >> n >> m >> k >> h;
// 	vector<int> x(m), y(m), c(m), arr(n);
// 	for (int i = 0; i < m; i++){
// 		cin >> x[i] >> y[i] >> c[i];
// 	}
// 	for (int i = 0; i < n; i++) cin >> arr[i];
// 	cout << solve(n,m,k,h,x,y,c,arr);
// }

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2944 KB Correct.
2 Correct 34 ms 2940 KB Correct.
3 Correct 32 ms 2852 KB Correct.
4 Correct 27 ms 2888 KB Correct.
5 Correct 27 ms 2896 KB Correct.
6 Correct 83 ms 4388 KB Correct.
7 Correct 92 ms 4336 KB Correct.
8 Correct 201 ms 7232 KB Correct.
9 Correct 30 ms 2772 KB Correct.
10 Correct 26 ms 2748 KB Correct.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 2880 KB Correct.
2 Correct 113 ms 2816 KB Correct.
3 Correct 103 ms 2892 KB Correct.
4 Correct 99 ms 2740 KB Correct.
5 Correct 102 ms 2728 KB Correct.
6 Correct 36 ms 4072 KB Correct.

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1393 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 3944 KB Correct.
2 Correct 30 ms 3792 KB Correct.
3 Correct 32 ms 4008 KB Correct.
4 Correct 140 ms 58116 KB Correct.
5 Correct 22 ms 2764 KB Correct.

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 3936 KB Correct.
2 Correct 62 ms 3832 KB Correct.
3 Correct 39 ms 10036 KB Correct.
4 Correct 126 ms 59616 KB Correct.
5 Correct 70 ms 2752 KB Correct.
6 Correct 65 ms 3924 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3048 ms 2644 KB Time limit exceeded
2 Halted 0 ms 0 KB -