Submission #1130354

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130354		7mody	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	1 ms	408 KiB

soccer

#include<bits/stdc++.h>
using namespace std;
#define ll long long

int biggest_stadium(int n, vector<vector<int>> arr){
    vector<vector<int>> c(n, vector<int>(n));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(arr[i][j] == 1) c[i][j] = 0;
            else if(i == 0) c[i][j] = 1;
            else c[i][j] = 1 + c[i - 1][j];
        }
    }
    int ans = 0;
    for(int kk = 0; kk < n; kk++){
        vector<int> curr = c[kk];
        stack<int> sl, sr;
        vector<int> l(n), r(n);
        for(int i = 0; i < n; i++){
            while(sl.size() && curr[i] <= curr[sl.top()]){
                sl.pop();
            }
            l[i] = (sl.size() ? 0 : sl.top() + 1);
            sl.push(i);
        }
        for(int i = n - 1; i >= 0; i--){
            while(sr.size() && curr[i] <= curr[sr.top()]){
                sr.pop();
            }
            r[i] = (sr.size() ? n - 1 : sr.top() - 1);
            sr.push(i);
        }
        for(int i = 0; i < n; i++){
            ans = max(ans, (r[i] - l[i] + 1) * curr[i]);
        }
    }
    return ans;
}

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