oj.uz

Submission #980172

# Submission time Handle Problem Language Result Execution time Memory
980172 2024-05-12T00:33:10 Z vjudge1 Soccer Stadium (IOI23_soccer) C++17
6 / 100
 229 ms 31824 KB 
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;

int n;

int biggest_stadium(int N, std::vector<std::vector<int>> F){

    n=N;
    int p1=-1, p2=-1;
    int ans=0;
    for(int i=0; i<n && p1==-1; i++){
        for(int j=0; j<n; j++){
            if(F[i][j]==1){
                p1=i;
                p2=j;
                break;
            }
        }
    }
    ans=max(ans, n*n-(n-p1)*(n-p2));
    ans=max(ans, n*n-(p1+1)*(n-p2));
    ans= max(ans, n*n-(p1+1)*(p2+1));
    ans= max(ans, n*n-(n-p1)*(p2+1));
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 1 ms 476 KB ok
8 Correct 20 ms 2396 KB ok
9 Correct 229 ms 31824 KB ok

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

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