# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757208 | groshi | Olympic Bus (JOI20_ho_t4) | C++17 | 987 ms | 2520 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("O3","unroll-loops","Ofast")
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
struct wi{
vector<int> Q;
int odw=0;
long long kiedy_odw=1e18;
int od_kogo=0;
}*w;
long long wynik=1e18;
int kiedy=1;
int n;
int t[60000][4];
long long odl[210][210];
bool nalezy[60000];
void dijkstra(int kto)
{
priority_queue<pair<long long,pair<int,int> > > kolejka;
kolejka.push({0,{1,0}});
for(int i=1;i<=n;i++)
w[i].kiedy_odw=1e18;
while(!kolejka.empty())
{
pair<long long,pair<int,int> > para=kolejka.top();
int x=para.second.first;
kolejka.pop();
if(w[x].kiedy_odw<-para.first)
Compilation message (stderr)
# | 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... |