제출 #1249735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249735		Geforgs	Voting Cities (NOI22_votingcity)	C++20	100 / 100	142 ms	5784 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void Dijkstra(vector<ll>& start, vector<vector<pair<ll, ll>>>& a, vector<vector<ll>>& dis){
    set<pair<ll, pair<ll, ll>>> s;
    for(auto el: start){
        s.insert({0, {el, 0}});
        dis[el][0] = 0;
    }
    while(!s.empty()){
        auto [val, el] = *s.begin();
        auto [x, ticket] = el;
        s.erase(s.begin());
        for(auto [y, w]: a[x]){
            if(dis[y][ticket] > val + w){
                s.erase({dis[y][ticket], {y, ticket}});
                dis[y][ticket] = val + w;
                s.insert({dis[y][ticket], {y, ticket}});
            }
            for(int i=0;i<5;++i){
                if(ticket&(1<<i)) continue;
                if(dis[y][ticket|(1<<i)] > val + (9-i)*w/10){
                    s.erase({dis[y][ticket|(1<<i)], {y, ticket|(1<<i)}});
                    dis[y][ticket|(1<<i)] = val + (9-i)*w/10;
                    s.insert({dis[y][ticket|(1<<i)], {y, ticket|(1<<i)}});
                }
            }
        }
    }
}

void solve(){
    ll n, m, k, q, i, j, x, y, w, res, ans;
    cin>>n>>m>>k;
    vector<vector<pair<ll, ll>>> a(n);
    vector<vector<ll>> dis(n, vector<ll>(32, inf));
    vector<ll> start(k);
    for(i=0;i<k;++i){
        cin>>start[i];
    }
    for(i=0;i<m;++i){
        cin>>x>>y>>w;
        a[y].pb({x, w});
    }
    Dijkstra(start, a, dis);
    cin>>q;
    vector<ll> price(5);
    for(i=0;i<q;++i){
        cin>>x;
        for(j=0;j<5;++j){
            cin>>price[j];
        }
        res = inf;
        for(j=0;j<32;++j){
            ans = dis[x][j];
            for(k=0;k<5;++k){
                if(j&(1<<k)){
                    if(price[k] == -1){
                        ans = inf;
                    }else{
                        ans += price[k];
                    }
                }
            }
            res = min(res, ans);
        }
        if(res == inf){
            cout<<-1<<endl;
        }else{
            cout<<res<<endl;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 10 / 10
• Subtask 7: 15 / 15
• Subtask 8: 50 / 50