제출 #442301

#제출 시각아이디문제언어결과실행 시간메모리
442301daniel920712던전 (IOI21_dungeons)C++17
13 / 100
150 ms36456 KiB
#include "dungeons.h" #pragma GCC optimize("Ofast", "unroll-loops") #include <bits/stdc++.h> using namespace std; #define int long long // #define double long double using pii = pair<int, int>; template<typename T> using Prior = std::priority_queue<T>; template<typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>; #define X first #define Y second #define eb emplace_back #define pb pop_back #define pf pop_front #define ALL(x) begin(x), end(x) #define RALL(x) rbegin(x), rend(x) namespace { mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); // const int maxn = 4E5 + 5; const int maxn = 5E4 + 5; // const int w_lgmx = 19; const int w_lgmx = 17; const int l_lgmx = 24; int N; vector<int> S, P, W, L; int win_anc[w_lgmx][maxn], win_sum[w_lgmx][maxn], win_val[w_lgmx][maxn]; int los_anc[l_lgmx][maxn], los_sum[l_lgmx][maxn]; } /// end of namespace void init(int32_t _N, vector<int32_t> _S, vector<int32_t> _P, vector<int32_t> _W, vector<int32_t> _L) { N = _N; for (auto &x : _S) S.eb(x); for (auto &x : _P) P.eb(x); for (auto &x : _W) W.eb(x); for (auto &x : _L) L.eb(x); memset(win_anc, 0x00, sizeof(win_anc)); memset(win_sum, 0x00, sizeof(win_sum)); // memset(win_val, 0x00, sizeof(win_val)); memset(los_anc, 0x00, sizeof(los_anc)); memset(los_sum, 0x00, sizeof(los_sum)); for (int i = 0; i < N; ++i) { win_anc[0][i] = W[i]; win_sum[0][i] = S[i]; // win_val[0][i] = S[i]; los_anc[0][i] = L[i]; los_sum[0][i] = P[i]; } win_anc[0][N] = los_anc[0][N] = N; for (int lay = 1; lay < w_lgmx; ++lay) { for (int i = 0; i <= N; ++i) { int win_par = win_anc[lay-1][i]; win_anc[lay][i] = win_anc[lay-1][win_par]; win_sum[lay][i] = win_sum[lay-1][i] + win_sum[lay-1][win_par]; // win_val[lay][i] = max(win_val[lay-1][i], win_val[lay-1][win_par]); } //if(wi) } for (int lay = 1; lay < l_lgmx; ++lay) { for (int i = 0; i <= N; ++i) { int los_par = los_anc[lay-1][i]; los_anc[lay][i] = los_anc[lay-1][los_par]; los_sum[lay][i] = los_sum[lay-1][i] + los_sum[lay-1][los_par]; } } } int simulate(int32_t now, int32_t _Z) { /// s[i] = s[j] /// int Z = _Z; for (int lay = l_lgmx-1; lay >= 0; --lay) { if (los_anc[lay][now] != N and Z + los_sum[lay][now] < S[now]) { Z += los_sum[lay][now]; now = los_anc[lay][now]; } // cerr << "(Z, now): " << Z << "," << now << "\n"; } if (Z < S[now]) Z += P[now], now = L[now]; //if(Z<S[now]&&now!=N) while(1); //if(win_anc[w_lgmx-1][now]!=N) while(1); return Z + win_sum[w_lgmx-1][now]; }

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

dungeons.cpp:35:51: warning: '{anonymous}::win_val' defined but not used [-Wunused-variable]
   35 | int win_anc[w_lgmx][maxn], win_sum[w_lgmx][maxn], win_val[w_lgmx][maxn];
      |                                                   ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...