제출 #634144

#제출 시각아이디문제언어결과실행 시간메모리
634144Utaha죄수들의 도전 (IOI22_prison)C++17
컴파일 에러
0 ms0 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; const int maxN = 305; int n_col = 0; const int max_height = maxN; long long dp[maxN][3][max_height + 1]; long long prefix[maxN][max_height + 1]; const long long INF = 1e18; const int UP = 0; const int DOWN = 1; const int STOP = 2; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { n_col = N + 2; for(int i = 0; i < M; i++) { prefix[X[i] + 1][Y[i] + 1] = W[i]; } for(int i = 0; i < n_col; i++) { for(int j = 0; j < max_height; j++) { prefix[i][j + 1] += prefix[i][j]; } } // for(int i = 0; i < n_col; i++) { // for(int j = 0; j < prefix[i].size(); j++) { // cout << prefix[i][j] << ' '; // } // cout<<'\n'; // } for(int i = 0; i < n_col; i++) { for(int j = 0; j < 3; j++) { for(int k = 0; k <= max_height; k++) { // printf("%d %d %d %lld\n", i, j, k, dp[i][j][k]); if (i == 0) { if (j != UP) { dp[i][j][k] = -INF; } else { dp[i][j][k] = 0; } } if (i == n_col - 1) break; if (j == UP) { for(int t = k; t <= max_height; t++) { dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][t] - prefix[i + 1][k]); // printf("DEBUG: %d %d %lld\n",i, t, dp[i + 1][UP][t]); } if (k == max_height) dp[i + 1][STOP][k] = max(dp[i + 1][STOP][k], dp[i][j][k]); } else if(j == STOP) { if(k != max_height) { continue; } for(int t = 0; t <= k; t++){ dp[i + 1][DOWN][t] = max(dp[i + 1][DOWN][t], dp[i][j][k] + prefix[i + 1][k] - prefix[i + 1][t]); } // down and immediately up // maybe this case doesn't even exist... for(int t = 0; t <= max_height; t++) { const int height = max(t, k); // printf("check: %d %d %lld %lld\n",i, t, dp[i][j][k], prefix[i + 1][height]); dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][height]); // printf("DEBU2: %d %d %lld\n",i, t, dp[i + 1][UP][t]); } } else{ for(int t = 0; t <= k; t++) { dp[i + 1][DOWN][t] = max(dp[i + 1][DOWN][t], dp[i][j][k] + prefix[i + 1][k] - prefix[i + 1][t]); } // down and immediately up // maybe this case doesn't even exist... for(int t = 0; t <= max_height; t++) { const int height = max(t, k); // printf("check: %d %d %lld %lld\n",i, t, dp[i][j][k], prefix[i + 1][height]); dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][height]); // printf("DEBU2: %d %d %lld\n",i, t, dp[i + 1][UP][t]); } } } } } return dp[n_col - 1][DOWN][0]; }

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

prison.cpp:1:10: fatal error: fish.h: No such file or directory
    1 | #include "fish.h"
      |          ^~~~~~~~
compilation terminated.