제출 #439236

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439236		Sorting	던전 (IOI21_dungeons)	C++17	컴파일 에러	0 ms	0 KiB

dungeons

#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 4e5 + 3;
const int C = 10000;
const int LOGN = 19;
const ll INF = 1e18;

int n;
vector<int> s, p, w, l;
array<ll, 3> up[LOGN][N]; // pos, strength, max
array<ll, 2> only_win;

void init(int _n, vector<int> _s, vector<int> _p, vector<int> _w, vector<int> _l) {
	n = _n, swap(s, _s), swap(p, _p), swap(w, _w), swap(l, _l);

    for(int i = 0; i < n; ++i){
        if(s[i] <= C)
            up[0][i] = {i, 0, -INF};
        else
            up[0][i] = {i, 0, -s[i]};
    }

    for(int j = 1; j < LOGN; ++j){
        for(int i = 0; i < n; ++i){
            if(up[j - 1][i][0] == n){
                up[j][i] = {n, -1, -1};
                continue;
            }
            int a = up[j - 1][i][0], b;
            ll add;
            if(s[a] <= C){
                b = w[a];
                add = s[a];
            }
            else{
                b = l[a];
                add = p[a];
            }
            if(b == n || up[j - 1][b][0] == n){
                up[j][i] = {n, -1, -1};
                continue;
            } 
            up[j][i][0] = up[j - 1][b][0];
            up[j][i][1] = up[j - 1][i][1] + add + up[j - 1][b][1]; 
            up[j][i][2] = max(up[j - 1][i][2], up[j - 1][i][1] + add + up[j - 1][b][2]);
        }
    }

    only_win[n] = {0, 0};
    for(int i = n - 1; i >= 0; --i){
        only_win[i][0] = max(s[i], only_win[w[i]][0] - s[i]);
        only_win[i][1] = s[i] + only_win[w[i]];
    }
}

long long simulate(int x, int z) {
	ll ans = z;
    while(ans < C && x != n){
        if(ans >= s[x]){
            ans += s[x];
            x = w[x];
        }
        else{
            ans += p[x];
            x = l[x];
        }
    }

    int cnt = 0;
    while(x != n){
        if(ans >= only_win[x][0]){
            ans += only_win[x][1];
            return ans;
        }
        for(int j = LOGN - 1; j >= 0; --j){
            if(up[j][x][0] == n) continue;
            if(up[j][x][2] + ans < 0){
                ans += up[j][x][1];
                x = up[j][x][0];
                if(s[x] <= ans){
                    ans += s[x];
                    x = w[x];
                }
                else{
                    ans += p[x];
                    x = l[x];
                }
                if(x == n) return ans;
            }
        }
        assert(s[x] > C);
        if(s[x] <= ans){
            ans += s[x];
            x = w[x];
        }
        ++cnt;
        //assert(cnt <= 1003);
    }

    return ans;
}

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

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:54:24: error: cannot convert '<brace-enclosed initializer list>' to 'std::array<long long int, 2>::value_type' {aka 'long long int'} in assignment
   54 |     only_win[n] = {0, 0};
      |                        ^
dungeons.cpp:56:20: error: invalid types 'std::array<long long int, 2>::value_type {aka long long int}[int]' for array subscript
   56 |         only_win[i][0] = max(s[i], only_win[w[i]][0] - s[i]);
      |                    ^
dungeons.cpp:56:50: error: invalid types 'std::array<long long int, 2>::value_type {aka long long int}[int]' for array subscript
   56 |         only_win[i][0] = max(s[i], only_win[w[i]][0] - s[i]);
      |                                                  ^
dungeons.cpp:57:20: error: invalid types 'std::array<long long int, 2>::value_type {aka long long int}[int]' for array subscript
   57 |         only_win[i][1] = s[i] + only_win[w[i]];
      |                    ^
dungeons.cpp: In function 'long long int simulate(int, int)':
dungeons.cpp:76:30: error: invalid types 'std::array<long long int, 2>::value_type {aka long long int}[int]' for array subscript
   76 |         if(ans >= only_win[x][0]){
      |                              ^
dungeons.cpp:77:31: error: invalid types 'std::array<long long int, 2>::value_type {aka long long int}[int]' for array subscript
   77 |             ans += only_win[x][1];
      |                               ^