# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440829 | denkendoemeer | Dungeons Game (IOI21_dungeons) | C++17 | 4570 ms | 868420 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 ll long long
using namespace std;
const ll inf=1e18;
vector<int>s,p,w,l,g[400005],we[400005];
ll sum[4][25][400005],mini[4][25][400005],add[400005],step[10];
int pre[4][25][400005],n;
void dfs(int nod,ll val)
{
add[nod]=val;
for(int i=0;i<g[nod].size();i++)
dfs(g[nod][i],val+we[nod][i]);
}
void init(int n2,vector<int>s2,vector<int>p2,vector<int>w2,vector<int>l2)
{
n=n2;
s=s2;
p=p2;
w=w2;
l=l2;
w.push_back(n);
l.push_back(n);
s.push_back(0);
p.push_back(0);
step[0]=1;
for(int i=1;i<10;i++)
step[i]=step[i-1]*57;
for(int k=0;k<4;k++){
int st=step[k];
for(int i=0;i<n;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... |