# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112269 | gs14004 | Two Transportations (JOI19_transportations) | C++17 | 2106 ms | 85344 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 MAXN = 2005;
using pi = pair<int, int>;
namespace {
vector<pi> gph[MAXN];
int dist[MAXN];
bool vis[MAXN];
bool firstSkip = 1;
int n, recValue1, recValue2, curMode;
void sendValue(int x, int b){
for(int i=b-1; i>=0; i--){
SendA((x >> i) & 1);
}
}
void relax(int v){
// printf("A relaxed %d = %d\n", v, dist[v]);
vis[v] = 1;
for(auto &i : gph[v]){
dist[i.second] = min(dist[i.second], i.first + dist[v]);
}
}
int getMax(){
int ret = 0;
for(int i=0; i<n; i++){
if(vis[i]) ret = max(ret, dist[i]);
}
return ret;
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... |