# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132363 | sebinkim | Two Transportations (JOI19_transportations) | C++14 | 1463 ms | 61144 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"
using namespace std;
typedef pair <int, int> pii;
const int ID = 11;
const int DIST = 20;
namespace{
priority_queue <pii> Q;
vector <pii> G[2020];
vector <int> D;
bool chk[2020];
int _st, _val, _cnt;
int n;
}
static void sendint(int x, int l) { for(; l--; ) SendA((x & (1 << l))? 1 : 0); }
static void apply(int p, int d)
{
// printf("applyA %d %d\n", p, d);
chk[p] = 1; D[p] = d;
for(pii &t: G[p]){
if(!chk[t.first] && D[t.first] > d + t.second){
D[t.first] = d + t.second;
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... |