제출 #761750

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761750		caganyanmaz	던전 (IOI21_dungeons)	C++17	0 / 100	7040 ms	1876 KiB

dungeons

#include <bits/stdc++.h>
#define pb push_back
using namespace std;

constexpr static int SIZE = 400001;
constexpr static int LOG_SIZE = 40;
int win_next[SIZE][LOG_SIZE];
int64_t win_gain[SIZE][LOG_SIZE];
int64_t win_max[SIZE][LOG_SIZE];
int lose_next[SIZE][LOG_SIZE];
int64_t lose_gain[SIZE][LOG_SIZE];
int64_t lose_min[SIZE][LOG_SIZE];

int n;
vector<int> s;
vector<int> l;

void init(int nn, vector<int> ss, vector<int> p, vector<int> w, vector<int> ll)
{
        n = nn;
        l = ll;
        s = ss;
        for (int i = 0; i < n; i++)
                assert(s[i] == p[i]);
        w.pb(n);
        s.pb(0);
        for (int i = 0; i <= n; i++)
        {
                win_next[i][0] = w[i];
                win_max[i][0] = win_gain[i][0] = s[i];
                lose_next[i][0] = l[0];
                lose_min[i][0] = s[i];
                lose_gain[i][0] = p[0];
        }
        for (int i = 1; i < LOG_SIZE; i++)
        {
                for (int j = 0; j = n; j++)
                {
                        win_next[j][i] = win_next[win_next[j][i-1]][i-1];
                        win_gain[j][i] = win_gain[j][i-1] + win_gain[win_next[j][i-1]][i-1];
                        win_max[j][i] = max(win_max[j][i-1], win_max[win_next[j][i-1]][i-1] - win_gain[j][i-1]);
                        lose_next[j][i] = lose_next[lose_next[j][i-1]][i-1];
                        lose_gain[j][i] = lose_gain[j][i-1] + lose_gain[lose_next[j][i-1]][i-1];
                        lose_min[j][i] = min(lose_min[j][i-1], lose_min[lose_next[j][i-1]][i-1]);
                }
        }
}

int64_t simulate(int x, int zz)
{
        int64_t z = zz;
        while (x != n)
        {
                int _next = LOG_SIZE-1;
                for (int _next = LOG_SIZE-1; _next >= 0; _next--)
                {
                        if (win_max[x][_next] <= z)
                        {
                                z += win_gain[x][_next];
                                x = win_next[x][_next];
                        }
                }
                for (int _next = LOG_SIZE-1; _next >= 0; _next--)
                {
                        if (lose_min[x][_next] > z)
                        {
                                z += lose_gain[x][_next];
                                x = lose_next[x][_next];
                        }
                }
        }
        return z;
}

컴파일 시 표준 에러 (stderr) 메시지

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:37:35: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   37 |                 for (int j = 0; j = n; j++)
      |                                 ~~^~~
dungeons.cpp: In function 'int64_t simulate(int, int)':
dungeons.cpp:54:21: warning: unused variable '_next' [-Wunused-variable]
   54 |                 int _next = LOG_SIZE-1;
      |                     ^~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11