oj.uz

Submission #1074652

# Submission time Handle Problem Language Result Execution time Memory
1074652 2024-08-25T11:43:43 Z cpdreamer Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 214 ms 39508 KB 
#include "soccer.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>

#define S second
#define P pair
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    for(int i=0;i<N;i++){
        int c=0;
        for(int j=0;j<N;j++){
            if(c==0){
                if(F[i][j]==0)
                    c++;
            }
            else if(c==1){
                if(F[i][j]==1)
                    c++;
            }
            else{
                if(F[i][j]==0){
                    return 0;
                }
            }
        }
    }
    for(int i=0;i<N;i++){
        int c=0;
        for(int j=0;j<N;j++){
            if(c==0){
                if(F[j][i]==0)
                    c++;
            }
            if(c==1){
                if(F[j][i]==1)
                    c++;
            }
            if(c==2){
                if(F[j][i]==0){
                    return 0;
                }
            }
        }
    }
    int c=0;
    for(int i=0;i<N;i++) {
        for (int j = 0; j < N; j++) {
            if (F[i][j] == 0)
                c++;
        }
    }
    return c;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 344 KB ok
6 Partially correct 0 ms 432 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 14 ms 2908 KB partial
9 Partially correct 214 ms 39508 KB partial

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 856 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
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 #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 856 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
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 #6
0.0 / 30.0

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