oj.uz

Submission #1037865

# Submission time Handle Problem Language Result Execution time Memory
1037865 2024-07-29T09:24:51 Z fv3 Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 600 KB 
#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int biggest_stadium(int N, vector<vector<int>> F)
{
    int x, y;
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (F[i][j])
            {
                y = j;
                x = i;
            }
        }
    }

    return N*N - min(min((x+1)*(y+1), (x+1)*(N-y)), min((N-x)*(y+1), (N-x)*(N-y)));
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:22:65: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   22 |     return N*N - min(min((x+1)*(y+1), (x+1)*(N-y)), min((N-x)*(y+1), (N-x)*(N-y)));
      |                                                               ~~^~~
soccer.cpp:22:41: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   22 |     return N*N - min(min((x+1)*(y+1), (x+1)*(N-y)), min((N-x)*(y+1), (N-x)*(N-y)));
      |                                       ~~^~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 428 KB ok
4 Correct 0 ms 348 KB ok
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 428 KB ok
5 Correct 0 ms 348 KB ok
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -