# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499380 | Neos | Putovanje (COCI20_putovanje) | C++14 | 142 ms | 74160 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>
#define pb emplace_back
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define fi first
#define se second
using namespace std;
typedef pair<ll,ll> pii;
const int maxN = 1e6+1;
const int inf = 1e9;
const int MOD = 1e9+7;
struct node{
int v;
ll w,c;
node(){};
node(int v,ll w,ll c){
this->v=v;
this->w=w;
this->c=c;
}
};
int n;
vector<node> a[maxN];
int l=20;
int up[maxN][21];
int in[maxN],out[maxN],timer=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |