oj.uz

Submission #839792

# Submission time Handle Problem Language Result Execution time Memory
839792 2023-08-30T15:51:36 Z model_code Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 264 ms 51196 KB 
// partially_correct/sol_db_check_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)
{
    vector<int> emptyvec(N, 0);
    vector<vector<int>> emptymat(N, emptyvec);
    if (C == emptymat)
    {
        return N * N;
    }
    return C[0][0] || C[0].back() || C.back()[0] || C.back().back() ? N * N - 1 : 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 232 KB ok
4 Correct 1 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 1 ms 212 KB partial
7 Partially correct 2 ms 340 KB partial
8 Partially correct 15 ms 3532 KB partial
9 Partially correct 264 ms 51196 KB partial

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 0 ms 212 KB ok
4 Correct 1 ms 232 KB ok
5 Correct 1 ms 212 KB ok
6 Correct 1 ms 212 KB ok
7 Partially correct 1 ms 212 KB partial
8 Partially correct 2 ms 340 KB partial
9 Partially correct 15 ms 3532 KB partial
10 Partially correct 264 ms 51196 KB partial
11 Partially correct 1 ms 240 KB partial
12 Partially correct 1 ms 260 KB partial
13 Partially correct 1 ms 212 KB partial
14 Partially correct 0 ms 212 KB partial
15 Partially correct 1 ms 212 KB partial
16 Incorrect 0 ms 212 KB wrong
17 Halted 0 ms 0 KB -