Submission #846990

#TimeUsernameProblemLanguageResultExecution timeMemory
846990vjudge1축구 경기장 (IOI23_soccer)C++17
48 / 100
4627 ms2097152 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int N, std::vector<std::vector<int>> F) { vector<vector<vector<vector<int>>>> f(N, vector<vector<vector<int>>>(N, vector<vector<int>>(N, vector<int>(N, -N * N)))); vector<vector<vector<int>>> ok(N, vector<vector<int>>(N, vector<int>(N, 0))); for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { for (int k = j; k < N; k++) { if (F[i][k]) break; f[i][i][j][k] = k - j + 1; ok[i][j][k] = 1; } } } int res = 0; for (int r = 0; r < N; r++) { for (int l = r; ~l; l--) { for (int a = 0; a < N; a++) { for (int b = a; b < N; b++) { if (f[l][r][a][b] < 0) continue; res = max(res, f[l][r][a][b]); for (int aa = a; aa <= b; aa++) { for (int bb = aa; bb <= b; bb++) { if (l > 0 && ok[l - 1][aa][bb]) f[l - 1][r][aa][bb] = max(f[l - 1][r][aa][bb], f[l][r][a][b] + bb - aa + 1); if (r + 1 < N && ok[r + 1][aa][bb]) f[l][r + 1][aa][bb] = max(f[l][r + 1][aa][bb], f[l][r][a][b] + bb - aa + 1); } } } } } } return res; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...