제출 #1147389

#제출 시각아이디문제언어결과실행 시간메모리
1147389yeediotVoting Cities (NOI22_votingcity)C++20
0 / 100
11 ms2892 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void CHECK(); void setio(){ freopen("/Users/iantsai/cpp/input.txt","r",stdin); freopen("/Users/iantsai/cpp/output.txt","w",stdout); } #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif #define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio(); const int mxn = 5005; vector<pii>adj[mxn]; int dis[mxn][1 << 5]; void solve(){ int n, m, k; cin >> n >> m >> k; vector<int>st(k); priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>>pq; for(int i = 0; i < n; i++){ for(int j = 0; j < (1 << 5); j++){ dis[i][j] = 1e18; } } for(auto &i : st){ cin >> i; dis[i][0] = 0; pq.push({0, i, 0}); } for(int i = 0; i < m; i++){ int a, b, c; cin >> a >> b >> c; adj[b].pb({a, c}); } while(sz(pq)){ auto [d, v, msk] = pq.top(); pq.pop(); if(d != dis[v][msk]) continue; for(auto [u, l] : adj[v]){ for(int i = 0; i < 5; i++){ if(msk >> i & 1) continue; if(dis[u][msk | (1 << i)] > dis[v][msk] + l * (10 - i - 1) / 10){ dis[u][msk | (1 << i)] = dis[v][msk] + l * (10 - i - 1) / 10; pq.push({dis[u][msk | (1 << i)], u, msk | (1 << i)}); } } } } int q; cin >> q; while(q--){ int s, ans = 1e18; cin >> s; vector<int>vec(5); for(auto &i : vec){ cin >> i; } for(int i = 0; i < (1 << 5); i++){ int cost = 0; for(int j = 0; j < 5; j++){ if(i >> j & 1){ if(vec[j] == -1){ cost = 1e18; break; } cost += vec[j]; } } debug(i, cost, dis[s][i]); chmin(ans, dis[s][i] + cost); } cout << (ans == 1e18 ? -1 : ans) << '\n'; } } signed main(){ TOI_is_so_de; int t = 1; //cin >> t; while(t--){ solve(); } #ifdef local CHECK(); #endif } /* input: */ #ifdef local void CHECK(){ cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n"; function<bool(string,string)> compareFiles = [](string p1, string p2)->bool { std::ifstream file1(p1); std::ifstream file2(p2); if(!file1.is_open() || !file2.is_open()) return false; std::string line1, line2; while (getline(file1, line1) && getline(file2, line2)) { if (line1 != line2)return false; } int cnta = 0, cntb = 0; while(getline(file1,line1))cnta++; while(getline(file2,line2))cntb++; return cntb - cnta <= 1; }; bool check = compareFiles("output.txt","expected.txt"); if(check) cerr<<"ACCEPTED\n"; else cerr<<"WRONG ANSWER!\n"; } #else #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...