oj.uz

Submission #846495

# Submission time Handle Problem Language Result Execution time Memory
846495 2023-09-07T16:02:06 Z Andrey Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 4444 KB 
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;

int haha[3001][3001];
int l[3001][3001];
int r[3001][3001];
int n;

int calc(const vector<int>& haha) {
    int n = haha.size();
    vector<int> bruh(n);
    vector<int> wow(n);
    stack<pair<int,int>> idk;
    for(int i = 0; i < n; i++) {
        int a = haha[i];
        while(!idk.empty() && a <= idk.top().first) {
            idk.pop();
        }
        if(idk.empty()) {
            bruh[i] = (i+1)*a;
        }
        else {
            bruh[i] = bruh[idk.top().second]+a*(i-idk.top().second);
        }
        idk.push({a,i});
    }
    while(!idk.empty()) {
        idk.pop();
    }
    for(int i = n-1; i >= 0; i--) {
        int a = haha[i];
        while(!idk.empty() && a <= idk.top().first) {
            idk.pop();
        }
        if(idk.empty()) {
            wow[i] = (n-i)*a;
        }
        else {
            wow[i] = wow[idk.top().second]+a*(idk.top().second-i)+a-idk.top().second;
        }
        idk.push({a,i});
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        ans = max(ans,bruh[i]+wow[i]-haha[i]);
    }
    return ans;
}

int biggest_stadium(int N, std::vector<std::vector<int>> f)
{
    n = N;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            haha[i][j] = f[i][j];
        }
    }
    for(int i = 0; i < n; i++) {
        if(haha[i][0]) {
            l[i][0] = -1;
        }
        else {
            l[i][0] = 0;
        }
        for(int j = 1; j < n; j++) {
            if(haha[i][j]) {
                l[i][j] = -1;
            }
            else {
                l[i][j] = l[i][j-1]+1;
            }
        }
        if(haha[i][n-1]) {
            r[i][n-1] = -1;
        }
        else {
            r[i][n-1] = 0;
        }
        for(int j = n-2; j >= 0; j--) {
            if(haha[i][j]) {
                r[i][j] = -1;
            }
            else {
                r[i][j] = r[i][j+1]+1;
            }
        }
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        vector<int> yay(0);
        vector<int> wut(0);
        for(int j = 0; j < n; j++) {
            if(l[i][j] == -1) {
                if(yay.size() > 0) {
                    ans = max(ans,calc(yay)+calc(wut)+(int)yay.size());
                }
                yay.clear();
                wut.clear();
            }
            else {
                yay.push_back(l[j][i]);
                wut.push_back(r[j][i]);
            }
        }
        if(yay.size() > 0) {
            ans = max(ans,calc(yay)+calc(wut)+(int)yay.size());
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4440 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB ok
2 Incorrect 1 ms 4444 KB wrong
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB ok
2 Incorrect 1 ms 4444 KB wrong
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4440 KB partial
2 Correct 1 ms 4444 KB ok
3 Incorrect 1 ms 4444 KB wrong
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4440 KB partial
2 Correct 1 ms 4444 KB ok
3 Incorrect 1 ms 4444 KB wrong
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4440 KB partial
2 Correct 1 ms 4444 KB ok
3 Incorrect 1 ms 4444 KB wrong
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4440 KB partial
2 Correct 1 ms 4444 KB ok
3 Incorrect 1 ms 4444 KB wrong
4 Halted 0 ms 0 KB -