# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969330 | pcc | Voting Cities (NOI22_votingcity) | C++17 | 73 ms | 8488 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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<pll> 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();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |