oj.uz

Submission #973405

# Submission time Handle Problem Language Result Execution time Memory
973405 2024-05-02T00:20:41 Z irmuun Soccer Stadium (IOI23_soccer) C++17
6 / 100
 237 ms 39504 KB 
#include<bits/stdc++.h>
#include "soccer.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int biggest_stadium(int n,vector<vector<int>>f){
    int total=0,x,y;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(f[i][j]==1){
                total++;
                x=i;
                y=j;
            }
        }
    }
    if(total==0){
        return n*n;
    }
    if(total==1){
        if(x==0||y==0||x==n-1||y==n-1){
            return n*n-1;
        }
        x++;
        y++;
        x=min(x,n+1-x);
        y=min(y,n+1-y);
        return n*n-x*y;
    }
    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 600 KB ok
5 Correct 1 ms 504 KB ok
6 Correct 0 ms 440 KB ok
7 Correct 2 ms 500 KB ok
8 Correct 15 ms 2688 KB ok
9 Correct 237 ms 39504 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 1 ms 600 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 1 ms 348 KB partial
7 Partially correct 1 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 Partially correct 1 ms 348 KB partial
2 Correct 1 ms 516 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 1 ms 600 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Incorrect 0 ms 348 KB wrong
10 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 1 ms 516 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 600 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 1 ms 348 KB partial
11 Incorrect 0 ms 348 KB wrong
12 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 1 ms 516 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 600 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 1 ms 348 KB partial
11 Incorrect 0 ms 348 KB wrong
12 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 1 ms 516 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 600 KB ok
6 Correct 1 ms 504 KB ok
7 Correct 0 ms 440 KB ok
8 Correct 2 ms 500 KB ok
9 Correct 15 ms 2688 KB ok
10 Correct 237 ms 39504 KB ok
11 Partially correct 1 ms 600 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Incorrect 0 ms 348 KB wrong
17 Halted 0 ms 0 KB -