# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623341 | tinjyu | Dungeons Game (IOI21_dungeons) | C++17 | 24 ms | 9880 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 "dungeons.h"
#include <vector>
#include <iostream>
using namespace std;
long long int n,s[1000005],p[1000005],l[1000005],w[1000005];
long long int step[400005][25][8];
long long int d[400005][25][8];
long long int mx[400005][25][8];
void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
n=N;
for(int i=0;i<n;i++)s[i]=S[i];
for(int i=0;i<n;i++)p[i]=P[i];
for(int i=0;i<n;i++)w[i]=W[i];
for(int i=0;i<n;i++)l[i]=L[i];
long long int b=1;
for(int bits=0;bits<25;bits++)
{
for(int i=0;i<n;i++)
{
if(s[i]>b)
{
step[i][bits][0]=l[i];
mx[i][bits][0]=s[i];
d[i][bits][0]=p[i];
}
else
{
# | 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... |