oj.uz

Submission #485885

# Submission time Handle Problem Language Result Execution time Memory
485885 2021-11-09T15:43:26 Z rumen_m Dungeons Game (IOI21_dungeons) C++17
100 / 100
 3647 ms 279092 KB 
#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 400005;
const long long logn = 24;
const long long INF = 1e18;
const int C = 3000;
int where[logn];
long long nextt[maxn][logn],add[maxn][logn],treshold[maxn][logn];
long long sums[maxn],maxs[maxn];
bool vis[maxn];
long long n;
vector <long long> s,p,w,l;

long long dfs(long long v)
{
    if(v==n)return 0;
    if(vis[v])return sums[v];
    sums[v] = s[v] + dfs(w[v]);
    maxs[v]  =max(s[v],maxs[w[v]]);
    vis[v] = 1;
    return sums[v];
}
void init(int _n, std::vector<int> _s, std::vector<int> _p, std::vector<int> _w, std::vector<int> _l) {
	long long i,j;
	n = _n;
	s.resize(_s.size());
	for(i=0;i<_s.size();i++)
        s[i]  = _s[i];
    p.resize(_p.size());
	for(i=0;i<_p.size();i++)
        p[i]  = _p[i];
        w.resize(_w.size());
	for(i=0;i<_w.size();i++)
        w[i]  = _w[i];
        l.resize(_l.size());
	for(i=0;i<_l.size();i++)
        l[i]  = _l[i];




            for(i=0;i<n;i++)
            {


                if(s[i]<=C)
                {
                    nextt[i][0] = w[i];
                    add[i][0] = s[i];
                    treshold[i][0]= INF;

                }
                else
                {
                    nextt[i][0] = l[i];
                    add[i][0]= p[i];
                    treshold[i][0] = s[i];

                }
            }
            nextt[n][0]  = n;
            treshold[n][0] = INF;//cout<<t<<endl;
            for(i=1;i<logn;i++)
            {
                for(j=0;j<=n;j++)
                {
                    nextt[j][i]= nextt[nextt[j][i-1]][i-1];
                    add[j][i] = add[j][i-1]+add[nextt[j][i-1]][i-1];
                    treshold[j][i] = max((long long)0,min(treshold[j][i-1],treshold[nextt[j][i-1]][i-1]-add[j][i-1]));
                 //   cout<<j<<" "<<i<<" "<<t<<" -> "<<nextt[j][i][t]<<" "<<add[j][i][t]<<" "<<treshold[j][i][t]<<endl;
                }
            }


    for(i=0;i<=n;i++)
    {
        dfs(i);
    }
}

long long simulate(int _x, int _z) {

    long long x = _x;
    long long z = _z;
    while(z <= C)
    {
        if(x==n)return z;
        if(z>=s[x])
        {
            z+=s[x];
            x = w[x];
        }
        else
        {
            z+=p[x];
            x = l[x];
        }
    }
	if(x==n)return z;// cout<<"&&"<<n<<endl;
	int i;

       // cout<<x<<" "<<z<<endl;
        bool fl = true;
        while(fl)
        {
            fl=0;

            for(i = logn-1; i>=0;i--)
            {
              //  cout<<i<<" curr: "<<x<<" "<<z<<endl;
                if(x==n)return z;
                if(treshold[x][i]>z)
                {
                    z += add[x][i];
                    x = nextt[x][i];
                    fl = true;
                    break;
                }
            }
            if(x==n)return z;
              if(z>=s[x])
        {
            z+=s[x];
            x = w[x];
        }
        else
        {
            z+=p[x];
            x = l[x];
        }
        if(x==n)return z;
        fl = true;
       if(maxs[x]<=z)
        {
            z+=sums[x];
            return z;
        }
        }
           // cout<<"predi last: "<<x<<" "<<z<<endl;
            if(x==n)return z;

               if(s[x]>z)
               {
                   z+=p[x];
                   x = l[x];
               }
               else
               {
                   z+=s[x];
                   x = w[x];
               }

           // cout<<"final: "<<x<<" "<<z<<endl;

    z += sums[x];

    return z;
}

Compilation message

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:29:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(i=0;i<_s.size();i++)
      |          ~^~~~~~~~~~
dungeons.cpp:32:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(i=0;i<_p.size();i++)
      |          ~^~~~~~~~~~
dungeons.cpp:35:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(i=0;i<_w.size();i++)
      |          ~^~~~~~~~~~
dungeons.cpp:38:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for(i=0;i<_l.size();i++)
      |          ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 1612 KB Output is correct
4 Correct 57 ms 32448 KB Output is correct
5 Correct 2 ms 1612 KB Output is correct
6 Correct 57 ms 32452 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 972 KB Output is correct
2 Correct 608 ms 266492 KB Output is correct
3 Correct 645 ms 277612 KB Output is correct
4 Correct 611 ms 279092 KB Output is correct
5 Correct 626 ms 266548 KB Output is correct
6 Correct 719 ms 273456 KB Output is correct
7 Correct 732 ms 275872 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 81 ms 33232 KB Output is correct
3 Correct 79 ms 34260 KB Output is correct
4 Correct 86 ms 34716 KB Output is correct
5 Correct 74 ms 34244 KB Output is correct
6 Correct 109 ms 33184 KB Output is correct
7 Correct 277 ms 33232 KB Output is correct
8 Correct 98 ms 34756 KB Output is correct
9 Correct 79 ms 33220 KB Output is correct
10 Correct 130 ms 34724 KB Output is correct
11 Correct 1695 ms 33232 KB Output is correct
12 Correct 1862 ms 33220 KB Output is correct
13 Correct 420 ms 33212 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 81 ms 33232 KB Output is correct
3 Correct 79 ms 34260 KB Output is correct
4 Correct 86 ms 34716 KB Output is correct
5 Correct 74 ms 34244 KB Output is correct
6 Correct 109 ms 33184 KB Output is correct
7 Correct 277 ms 33232 KB Output is correct
8 Correct 98 ms 34756 KB Output is correct
9 Correct 79 ms 33220 KB Output is correct
10 Correct 130 ms 34724 KB Output is correct
11 Correct 1695 ms 33232 KB Output is correct
12 Correct 1862 ms 33220 KB Output is correct
13 Correct 420 ms 33212 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 87 ms 33184 KB Output is correct
16 Correct 87 ms 33180 KB Output is correct
17 Correct 81 ms 34088 KB Output is correct
18 Correct 80 ms 34000 KB Output is correct
19 Correct 111 ms 33232 KB Output is correct
20 Correct 108 ms 34208 KB Output is correct
21 Correct 87 ms 34256 KB Output is correct
22 Correct 467 ms 33700 KB Output is correct
23 Correct 2086 ms 33216 KB Output is correct
24 Correct 516 ms 33220 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 81 ms 33232 KB Output is correct
3 Correct 79 ms 34260 KB Output is correct
4 Correct 86 ms 34716 KB Output is correct
5 Correct 74 ms 34244 KB Output is correct
6 Correct 109 ms 33184 KB Output is correct
7 Correct 277 ms 33232 KB Output is correct
8 Correct 98 ms 34756 KB Output is correct
9 Correct 79 ms 33220 KB Output is correct
10 Correct 130 ms 34724 KB Output is correct
11 Correct 1695 ms 33232 KB Output is correct
12 Correct 1862 ms 33220 KB Output is correct
13 Correct 420 ms 33212 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 87 ms 33184 KB Output is correct
16 Correct 87 ms 33180 KB Output is correct
17 Correct 81 ms 34088 KB Output is correct
18 Correct 80 ms 34000 KB Output is correct
19 Correct 111 ms 33232 KB Output is correct
20 Correct 108 ms 34208 KB Output is correct
21 Correct 87 ms 34256 KB Output is correct
22 Correct 467 ms 33700 KB Output is correct
23 Correct 2086 ms 33216 KB Output is correct
24 Correct 516 ms 33220 KB Output is correct
25 Correct 62 ms 32432 KB Output is correct
26 Correct 87 ms 33232 KB Output is correct
27 Correct 107 ms 33220 KB Output is correct
28 Correct 87 ms 33348 KB Output is correct
29 Correct 95 ms 33212 KB Output is correct
30 Correct 142 ms 34756 KB Output is correct
31 Correct 173 ms 34728 KB Output is correct
32 Correct 337 ms 33180 KB Output is correct
33 Correct 238 ms 33172 KB Output is correct
34 Correct 940 ms 33260 KB Output is correct
35 Correct 1065 ms 33312 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 972 KB Output is correct
2 Correct 608 ms 266492 KB Output is correct
3 Correct 645 ms 277612 KB Output is correct
4 Correct 611 ms 279092 KB Output is correct
5 Correct 626 ms 266548 KB Output is correct
6 Correct 719 ms 273456 KB Output is correct
7 Correct 732 ms 275872 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 81 ms 33232 KB Output is correct
10 Correct 79 ms 34260 KB Output is correct
11 Correct 86 ms 34716 KB Output is correct
12 Correct 74 ms 34244 KB Output is correct
13 Correct 109 ms 33184 KB Output is correct
14 Correct 277 ms 33232 KB Output is correct
15 Correct 98 ms 34756 KB Output is correct
16 Correct 79 ms 33220 KB Output is correct
17 Correct 130 ms 34724 KB Output is correct
18 Correct 1695 ms 33232 KB Output is correct
19 Correct 1862 ms 33220 KB Output is correct
20 Correct 420 ms 33212 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 87 ms 33184 KB Output is correct
23 Correct 87 ms 33180 KB Output is correct
24 Correct 81 ms 34088 KB Output is correct
25 Correct 80 ms 34000 KB Output is correct
26 Correct 111 ms 33232 KB Output is correct
27 Correct 108 ms 34208 KB Output is correct
28 Correct 87 ms 34256 KB Output is correct
29 Correct 467 ms 33700 KB Output is correct
30 Correct 2086 ms 33216 KB Output is correct
31 Correct 516 ms 33220 KB Output is correct
32 Correct 62 ms 32432 KB Output is correct
33 Correct 87 ms 33232 KB Output is correct
34 Correct 107 ms 33220 KB Output is correct
35 Correct 87 ms 33348 KB Output is correct
36 Correct 95 ms 33212 KB Output is correct
37 Correct 142 ms 34756 KB Output is correct
38 Correct 173 ms 34728 KB Output is correct
39 Correct 337 ms 33180 KB Output is correct
40 Correct 238 ms 33172 KB Output is correct
41 Correct 940 ms 33260 KB Output is correct
42 Correct 1065 ms 33312 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 944 KB Output is correct
45 Correct 671 ms 269848 KB Output is correct
46 Correct 543 ms 265156 KB Output is correct
47 Correct 615 ms 265528 KB Output is correct
48 Correct 572 ms 276132 KB Output is correct
49 Correct 747 ms 269756 KB Output is correct
50 Correct 650 ms 275772 KB Output is correct
51 Correct 544 ms 274260 KB Output is correct
52 Correct 701 ms 273844 KB Output is correct
53 Correct 1709 ms 266328 KB Output is correct
54 Correct 1030 ms 267696 KB Output is correct
55 Correct 2048 ms 266936 KB Output is correct
56 Correct 3647 ms 267064 KB Output is correct
57 Correct 2852 ms 267196 KB Output is correct
58 Correct 2253 ms 267324 KB Output is correct
59 Correct 2021 ms 267408 KB Output is correct
60 Correct 2601 ms 267972 KB Output is correct
61 Correct 2625 ms 266676 KB Output is correct