# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255496 | kshitij_sodani | Cities (BOI16_cities) | C++14 | 4679 ms | 108024 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.
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n,k,m;
vector<pair<int,int>> adj[100001];
vector<int> dd;
llo dist[5][100001];
void dj(int tt,int s){
for(llo i=0;i<n;i++){
dist[tt][i]=-1;
}
dist[tt][s]=0;
priority_queue<pair<llo,int>> ss;
ss.push({0,s});
/* for(llo i=0;i<k;i++){
for(llo j=0;j<n;j++){
cout<<dist[i][j]<<",";
}
cout<<endl;
}*/
while(ss.size()){
pair<llo,int> no=ss.top();
ss.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... |