oj.uz

Submission #758699

# Submission time Handle Problem Language Result Execution time Memory
758699 2023-06-15T06:57:04 Z OrazB Cyberland (APIO23_cyberland) C++17
49 / 100
 626 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 300005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

vector<pii> E[N];

void dfs(int nd, int h, vector<int> arr, set<pii> &q, vector<double> &dis, vector<bool> &vis){
	if (!arr[nd]){
		q.insert({0, 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, q, 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<bool> vis(n+10, 0);
	vector<double> dis(n+10, 1e18);
	vector<int> cur(n+10, 0);
	set<pii> q;
	q.insert({0, 0});
	dis[0] = 0;
	dfs(0, h, arr, q, dis, vis);
	while(!q.empty()){
		int x = (*q.begin()).ss;
		q.erase(q.begin());
		if (x == h) continue;
		for (auto i : E[x]){
			int t=0;
			double res = dis[x]+i.ss;
			if (arr[i.ff] == 2){
				if (cur[x] < k){res /= 2;t=1;}
			}
			if (dis[i.ff] > res){
				q.erase({dis[i.ff], i.ff});
				dis[i.ff] = res;
				cur[i.ff] = cur[x]+t;
				q.insert({dis[i.ff], i.ff});
			}
		}
	}
	if (dis[h] == 1e18) 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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 7508 KB Correct.
2 Correct 17 ms 7508 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 7524 KB Correct.
2 Correct 29 ms 7588 KB Correct.
3 Correct 28 ms 7508 KB Correct.
4 Correct 30 ms 7560 KB Correct.
5 Correct 29 ms 7508 KB Correct.
6 Correct 81 ms 8928 KB Correct.
7 Correct 95 ms 8920 KB Correct.
8 Correct 212 ms 10504 KB Correct.
9 Correct 31 ms 7548 KB Correct.
10 Correct 25 ms 7436 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7556 KB Correct.
2 Correct 32 ms 7552 KB Correct.
3 Correct 30 ms 7608 KB Correct.
4 Correct 27 ms 7380 KB Correct.
5 Correct 27 ms 7380 KB Correct.
6 Correct 19 ms 8720 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 625 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 8556 KB Correct.
2 Correct 37 ms 8500 KB Correct.
3 Correct 43 ms 8544 KB Correct.
4 Correct 140 ms 62692 KB Correct.
5 Correct 22 ms 7460 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 8564 KB Correct.
2 Correct 23 ms 8480 KB Correct.
3 Correct 35 ms 13604 KB Correct.
4 Correct 49 ms 64104 KB Correct.
5 Correct 23 ms 7380 KB Correct.
6 Correct 25 ms 8560 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8580 KB Correct.
2 Correct 8 ms 9428 KB Correct.
3 Runtime error 626 ms 2097152 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -