# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389663 | denkendoemeer | Two Transportations (JOI19_transportations) | C++14 | 938 ms | 48844 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>
#include "Azer.h"
#define inf 1e9
using namespace std;
namespace {
int n,cnt1,cnt2,nr,dist1,dist2;
bool ok;
vector<pair<int,int>>*g;
vector<int>dist;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
void update(int nod)
{
for(auto it:g[nod]){
if (dist[nod]+it.second<-dist[it.first]){
dist[it.first]=-(dist[nod]+it.second);
pq.push(make_pair(dist[nod]+it.second,it.first));
}
}
}
void query()
{
int i;
if (cnt1==0)
return ;
cnt1--;
while(1){
if (pq.empty()){
dist2=511;
for(i=8;i>=0;i--)
SendA((dist2>>i)&1);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |