oj.uz

Submission #839783

# Submission time Handle Problem Language Result Execution time Memory
839783 2023-08-30T15:51:16 Z model_code Soccer Stadium (IOI23_soccer) C++17
6 / 100
 245 ms 35588 KB 
// incorrect/sol_db_atmost_one.cpp

#include "soccer.h"
#include <iostream>
#include <array>
#include <map>
#include <algorithm>
#include <cassert>
#define xx first
#define yy second

using namespace std;
typedef pair<int, int> pii;

int biggest_stadium(int N, vector<vector<int>> C)
{
    int x = 1, y = 1;
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < N; ++j)
        {
            if (C[i][j])
                x = i, y = j;
        }
    }
    int ans = 0;
    ans = max(ans, N * N - (x + 1) * (y + 1));
    ans = max(ans, N * N - (N - x) * (y + 1));
    ans = max(ans, N * N - (x + 1) * (N - y));
    ans = max(ans, N * N - (N - x) * (N - y));
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok
2 Correct 1 ms 296 KB ok
3 Correct 0 ms 212 KB ok
4 Correct 1 ms 212 KB ok
5 Correct 1 ms 300 KB ok
6 Correct 1 ms 212 KB ok
7 Correct 2 ms 340 KB ok
8 Correct 15 ms 2512 KB ok
9 Correct 245 ms 35588 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok
2 Correct 1 ms 296 KB ok
3 Partially correct 1 ms 212 KB partial
4 Partially correct 1 ms 212 KB partial
5 Partially correct 1 ms 212 KB partial
6 Partially correct 1 ms 284 KB partial
7 Partially correct 0 ms 212 KB partial
8 Correct 0 ms 212 KB ok
9 Incorrect 1 ms 296 KB wrong
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 296 KB ok
4 Partially correct 1 ms 212 KB partial
5 Partially correct 1 ms 212 KB partial
6 Partially correct 1 ms 212 KB partial
7 Partially correct 1 ms 284 KB partial
8 Partially correct 0 ms 212 KB partial
9 Correct 0 ms 212 KB ok
10 Incorrect 1 ms 296 KB wrong
11 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 296 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 1 ms 212 KB partial
7 Partially correct 1 ms 212 KB partial
8 Partially correct 1 ms 212 KB partial
9 Partially correct 1 ms 284 KB partial
10 Partially correct 0 ms 212 KB partial
11 Correct 0 ms 212 KB ok
12 Incorrect 1 ms 296 KB wrong
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 296 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 1 ms 212 KB partial
7 Partially correct 1 ms 212 KB partial
8 Partially correct 1 ms 212 KB partial
9 Partially correct 1 ms 284 KB partial
10 Partially correct 0 ms 212 KB partial
11 Correct 0 ms 212 KB ok
12 Incorrect 1 ms 296 KB wrong
13 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 296 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Correct 1 ms 300 KB ok
7 Correct 1 ms 212 KB ok
8 Correct 2 ms 340 KB ok
9 Correct 15 ms 2512 KB ok
10 Correct 245 ms 35588 KB ok
11 Partially correct 1 ms 212 KB partial
12 Partially correct 1 ms 212 KB partial
13 Partially correct 1 ms 212 KB partial
14 Partially correct 1 ms 284 KB partial
15 Partially correct 0 ms 212 KB partial
16 Correct 0 ms 212 KB ok
17 Incorrect 1 ms 296 KB wrong
18 Halted 0 ms 0 KB -