# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152838 | username | Two Transportations (JOI19_transportations) | C++14 | 1984 ms | 85200 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 "Azer.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=int(j)-1;i>=(k);--i)
#define pb push_back
#define f first
#define s second
namespace{
const int maxn=2009,inf=1e9;
int n,ls=0,t=0,fin=0,r,tmp,d[maxn];
bitset<maxn>c;
vector<pii>g[maxn];
priority_queue<pii,vector<pii>,greater<pii>>pq;
void send(int x,int l){RREP(i,l,0)SendA((x>>i)&1);}
void rlx(int u,int x){
d[u]=x;
c[u]=1;
++fin;
ls=d[u];
REP(i,0,g[u].size()){
pii&ee=g[u][i];
if(d[u]+ee.s<d[ee.f]){
d[ee.f]=d[u]+ee.s;
pq.push({d[ee.f],ee.f});
}
}
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... |