제출 #847336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847336		Lucpp	Soccer Stadium (IOI23_soccer)	C++17	100 / 100	370 ms	62376 KiB

soccer

#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;

int biggest_stadium(int N, vector<vector<int>> F){
    vector<int> H(N), oldDp(N);
    vector<vector<int>> byH(N+1);
    int ans = 0;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(F[i][j]) H[j] = 0;
            else H[j]++;
            byH[H[j]].push_back(j);
        }
        stack<pair<int, int>> s;
        s.emplace(-1, -1);
        vector<int> L(N), R(N, N), dp(N);
        for(int k = 0; k < N; k++){
            while(s.top().first > H[k]){
                R[s.top().second] = k;
                s.pop();
            }
            if(s.top().first == H[k]) L[k] = L[s.top().second];
            else L[k] = s.top().second+1;
            s.emplace(H[k], k);
        }
        for(int h = 1; h <= i+1; h++){
            for(int j : byH[h]){
                int w = R[j]-L[j];
                dp[j] = w+oldDp[j];
                if(int k = L[j]-1; k >= 0) dp[j] = max(dp[j], w*(H[j]-H[k]) + dp[k]);
                if(int k = R[j]; k < N) dp[j] = max(dp[j], w*(H[j]-H[k]) + dp[k]);
                ans = max(ans, dp[j]);
            }
            byH[h].clear();
        }
        swap(dp, oldDp);
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 22 / 22
• Subtask 4: 18 / 18
• Subtask 5: 16 / 16
• Subtask 6: 30 / 30