# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066381 | urd05 | Two Transportations (JOI19_transportations) | C++17 | 659 ms | 49036 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> P;
namespace A {
int n;
int ca=0;
bool vis[2005];
vector<P> adj[2005];
priority_queue<P,vector<P>,greater<P>> pq;
int nowd=0;
int got=0;
int prd=0;
int cnt=0;
int dist[2005];
const int INF=1e6;
} // namespace
typedef pair<int,int> P;
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
std::vector<int> C) {
A::n=N;
for(int i=0;i<A;i++) {
A::adj[U[i]].push_back(P(V[i],C[i]));
A::adj[V[i]].push_back(P(U[i],C[i]));
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... |