oj.uz

Submission #1006894

# Submission time Handle Problem Language Result Execution time Memory
1006894 2024-06-24T09:38:19 Z Abito Soccer Stadium (IOI23_soccer) C++17
0 / 100
 0 ms 348 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int mvx[]={1,0,-1,0},mvy[]={0,1,0,-1};
int biggest_stadium(int n, std::vector<std::vector<int>> a)
{
    //bool ok=true;
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (!a[i][j]) continue;
            int h=0;
            for (int k=0;k<4;k++){
                int x=i+mvx[k],y=j+mvy[k];
                if (x<0 || x>=n || y<0 || y>=n) continue;
                h+=(!a[x][y]);
            }
            if (h>1) return 0;
        }
    }return 1;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -