oj.uz

Submission #749874

# Submission time Handle Problem Language Result Execution time Memory
749874 2023-05-28T19:41:00 Z 1ne Cyberland (APIO23_cyberland) C++17
44 / 100
 970 ms 2097152 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
	 vector<vector<pair<int,int>>>adj(N);
	 for (int i = 0;i<M;++i){
	 	adj[x[i]].push_back({y[i],c[i]});
	 	adj[y[i]].push_back({x[i],c[i]});
	 }
	 queue<pair<int,int>>q;
	 q.push({0,K});
	 vector<vector<double>>dist(N,vector<double>(K + 1,1e12));
	 dist[0][K] = 0;
	 while(!q.empty()){
	 	auto u = q.front();
	 	q.pop();
	 	if (u.first == H)continue;
	 	for (auto x:adj[u.first]){
	 		long long v = x.second;
	 		if (arr[x.first] == 0){
	 			v = -dist[u.first][u.second];	
	 		}
	 		if (dist[x.first][u.second] > dist[u.first][u.second] + v){
	 			dist[x.first][u.second] = dist[u.first][u.second] + v;
	 			q.push({x.first,u.second});
	 		}
	 		if (arr[x.first] == 2 && u.second > 0){
	 			if (dist[x.first][1] > (dist[u.first][u.second] + x.second)/2){
	 				dist[x.first][1] = (dist[u.first][u.second] + x.second)/2;
	 				q.push({x.first,u.second - 1});
	 			}
	 			//nx = dist[u.first][u.second] + x.second)/2 + 2 * vx) / 2 + 2 * vx ) / 2 
	 		}		
	 	}
	 }
	 double ans = 1e12;
	 for (int i = 0;i<=K;++i){
	 	ans = min(ans,dist[H][i]);
	 }	
	 if (ans == 1e12)return -1;		
	 return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 724 KB Correct.
2 Correct 26 ms 716 KB Correct.
3 Correct 26 ms 684 KB Correct.
4 Correct 27 ms 932 KB Correct.
5 Correct 29 ms 664 KB Correct.
6 Correct 33 ms 3796 KB Correct.
7 Correct 37 ms 3816 KB Correct.
8 Correct 14 ms 7380 KB Correct.
9 Correct 26 ms 424 KB Correct.
10 Correct 28 ms 340 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 680 KB Correct.
2 Correct 27 ms 688 KB Correct.
3 Correct 25 ms 660 KB Correct.
4 Correct 27 ms 412 KB Correct.
5 Correct 27 ms 428 KB Correct.
6 Correct 6 ms 3156 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 688 KB Correct.
2 Correct 30 ms 680 KB Correct.
3 Correct 27 ms 680 KB Correct.
4 Correct 29 ms 3628 KB Correct.
5 Correct 24 ms 420 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 660 KB Correct.
2 Correct 26 ms 684 KB Correct.
3 Correct 59 ms 27852 KB Correct.
4 Correct 21 ms 2508 KB Correct.
5 Correct 31 ms 340 KB Correct.
6 Correct 28 ms 668 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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