# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642191 | cadmiumsky | Two Transportations (JOI19_transportations) | C++14 | 774 ms | 48888 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;
const int nmax = 2e3 + 5, inf = 1e9 + 5;
using pii = pair<int,int>;
namespace A {
int numberofstates;
int N;
set<pii> heap;
vector<pii> g[nmax];
int dist[nmax];
vector<int> bits;
int lastdocumented = 0;
int last = 0;
int state = 0;
int theircost = 0, theirnode = 0;
int mynode = 0, mycost = 0;
void receiveA(bool x) {
bits.emplace_back(x);
if(state == 0 && bits.size() == lastdocumented + 9) {
int node, cost;
if(heap.size())
tie(cost, node) = *heap.begin();
else
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... |