oj.uz

답안 #823999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823999 2023-08-13T11:19:37 Z Mohammed_Atalah Voting Cities (NOI22_votingcity) C++17
15 / 100
 6 ms 2372 KB 
/// Template path: /home/mohammed/.config/sublime-text-3/Packages/User

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vecint;
typedef vector<char> vecchar;
typedef vector<string> vecstr;
typedef vector<long long> vecll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

// Marcos
#define endl ("\n")
#define int long long
#define mod 1000000007
#define pi (3.141592653589)
#define REP(i,a,b) for (int i = a; i < b; i++)
#define RREP(i,a,b) for (int i = a; i > b; i--)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

// Functions
long long squared(long long x) {return (x * x) % mod;}
int factorial(int n) {long long res = 1; for (int i = 1; i <= n; i++) {res = ((res * i) % mod + mod) % mod ;} return res;}
long long power(long long x, long long p) {if (p == 0) {return 1;} if (p % 2 == 1) {return (power(x, p - 1) * x) % mod;} return squared(power(x, p / 2));}

// cout << fixed;
// cout << setprecision(4);


// ---------(^_^)--------- //





void main_solve() {

	int n, e, k; cin >> n >> e >> k;
	cin >> k;
	vector<vector<vector<int>>> edg(n);
	for (int i = 0; i < e; i ++) {
		int a, b, c; cin >> a >> b >> c;
		edg[b].push_back({a, c});
	}

	vector<int> cost(n, LLONG_MAX);
	vector<int> vis(n);
	priority_queue<pair<int, int>> q;
	cost[k] = 0;
	q.push({0, k});
	while (!q.empty()) {
		int a = q.top().second; q.pop();
		if (vis[a]) continue;
		vis[a]++;
		for (auto &i : edg[a]) {
			int b = i[0], w = i[1];
			if (cost[a] + w < cost[b]) {
				cost[b] = cost[a] + w;
				q.push({ -cost[b], b});
			}
		}
	}
	int t; cin >> t;
	while (t--) {
		int s, p1, p2, p3, p4, p5;
		cin >> s >> p1 >> p2 >> p3 >> p4 >> p5;
		if (cost[s] == LLONG_MAX) {
			cout << -1 << endl;
		} else {
			cout << cost[s] << endl;
		}
	}
}


int32_t main() {

	fast;
// #ifndef ONLINE_JUDGE
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt", "w", stdout);
// #endif
	// Just another problem (-_-)

	int t;
	t = 1;
	// cin >> t;

	while (t--) {
		main_solve();
	}


}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 1364 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 1364 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 4 ms 2252 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 1236 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 1368 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 1364 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 5 ms 1236 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 4 ms 1368 KB Output is correct
14 Incorrect 4 ms 1352 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 1364 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 4 ms 2252 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -