oj.uz

Submission #969329

# Submission time Handle Problem Language Result Execution time Memory
969329 2024-04-25T01:43:55 Z pcc Voting Cities (NOI22_votingcity) C++17
15 / 100
 69 ms 7152 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>

const ll inf = 1e18;
const int mxn = 5050;
const int b = 5;
vector<pii> paths[mxn];
ll dist[mxn][1<<b];
int N,M,Q,K;

namespace DIJKSTRA{
	priority_queue<pll,vector<pll>,greater<pll>> pq;
	void GO(vector<int> starts){
		for(auto &i:dist){
			for(auto &j:i)j = inf;
		}
		for(auto &i:starts){
			dist[i][0] = 0;
			pq.push(pll(0,i<<b));
		}
		while(!pq.empty()){
			auto [d,now] = pq.top();
			pq.pop();
			int mask = now%(1<<b);
			now>>=b;
			if(dist[now][mask] != d)continue;
			for(int i = 0;i<b;i++){
				if(mask&(1<<i))continue;
				int tm = mask^(1<<i);
				for(auto [nxt,w]:paths[now]){
					w = w*(100-10*(i+1))/100;
					if(dist[nxt][tm]>d+w){
						dist[nxt][tm] = d+w;
						pq.push(pll(dist[nxt][tm],(nxt<<5)+tm));
					}
				}
			}
			for(auto [nxt,w]:paths[now]){
				if(dist[nxt][mask]>d+w){
					dist[nxt][mask] = d+w;
					pq.push(pll(dist[nxt][mask],(nxt<<5)+mask));
				}
			}
		}
		return;
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M>>K;
	vector<int> v;
	for(int i = 0;i<K;i++){
		int tmp;
		cin>>tmp;
		v.push_back(tmp);
	}
	for(int i = 0;i<M;i++){
		int a,b,c;
		cin>>a>>b>>c;
		paths[b].push_back(pii(a,c));
	}
	DIJKSTRA::GO(v);
	cin>>Q;
	while(Q--){
		int s,arr[b];
		cin>>s;
		for(auto &i:arr)cin>>i;
		ll ans = inf;
		for(int i = 0;i<(1<<b);i++){
			ll cost = dist[s][i];
			bool f = true;
			for(int j = 0;j<b;j++){
				if(i&(1<<j)){
					if(arr[j] == -1)f = false;
					cost += arr[j];
				}
			}
			if(!f)continue;
			ans = min(ans,cost);
		}
		cout<<(ans>=inf?-1:ans)<<'\n';
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 33 ms 2784 KB Output is correct
7 Correct 13 ms 2100 KB Output is correct
8 Correct 33 ms 2772 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1780 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 33 ms 2784 KB Output is correct
7 Correct 13 ms 2100 KB Output is correct
8 Correct 33 ms 2772 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1780 KB Output is correct
11 Correct 69 ms 7152 KB Output is correct
12 Correct 16 ms 1884 KB Output is correct
13 Correct 44 ms 3292 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 3 ms 2140 KB Output is correct
7 Incorrect 13 ms 1884 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 33 ms 2784 KB Output is correct
7 Correct 13 ms 2100 KB Output is correct
8 Correct 33 ms 2772 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1780 KB Output is correct
11 Correct 3 ms 2140 KB Output is correct
12 Incorrect 13 ms 1884 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 4304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2772 KB Output is correct
2 Correct 13 ms 1884 KB Output is correct
3 Correct 41 ms 2776 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 33 ms 2784 KB Output is correct
7 Correct 13 ms 2100 KB Output is correct
8 Correct 33 ms 2772 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1780 KB Output is correct
11 Correct 69 ms 7152 KB Output is correct
12 Correct 16 ms 1884 KB Output is correct
13 Correct 44 ms 3292 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 3 ms 2140 KB Output is correct
17 Incorrect 13 ms 1884 KB Output isn't correct
18 Halted 0 ms 0 KB -