# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287463 | Namnamseo | 철도 요금 (JOI16_ho_t3) | C++17 | 469 ms | 50508 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 <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int,int> pp;
priority_queue<pp> pq;
int n,m,q;
struct ES{
int f,t;
bool dead;
} ee[300010];
vector<int> edge [300010];
vector<int> parent [300010];
vector<int> child [300010];
vector<int> child_ei[300010];
int dijk[300010];
bool dead[300010];
int boolman;
int alive_pars[300010];
void dodijk(){
int i;
for(i=2;i<=n;++i) dijk[i]=1e9;
pq.push(pp(0,1));
int me;
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... |