oj.uz

Submission #839779

# Submission time Handle Problem Language Result Execution time Memory
839779 2023-08-30T15:51:06 Z model_code Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 212 KB 
// incorrect/largest_empty_rectangle.cpp

#include "soccer.h"
#include <iostream>
#include <vector>

int biggest_stadium(int N, std::vector<std::vector<int>> C)
{
    std::vector<std::vector<int>> up(N);
    int ans = 0;
    for (int i = 0; i < N; ++i)
    {
        up[i].resize(N + 1);
        for (int j = 0; j < N; ++j)
        {
            up[i][j] = (1 - C[i][j]) + (i ? up[i - 1][j] : 0);
        }

        std::vector<std::pair<int, int>> s;
        for (int j = 0; j <= N; ++j)
        {
            int h = up[i][j], w = 1;
            while (!s.empty() && s.back().first >= h)
            {
                auto [x, y] = s.back();
                ans = std::max(x * y, ans);
                s.pop_back();
                w += y;
            }
            s.push_back({h, w});
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB wrong
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB wrong
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

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