Submission #1070074

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070074		MohamedFaresNebili	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	1 ms	348 KiB

soccer

    #include <bits/stdc++.h>
    #include "soccer.h"
     
            using namespace std;
     
            const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0};
     
            int biggest_stadium(int N, vector<vector<int>> F) {
                int res = 0;
                for(int l = 0; l < N; l++) {
                    for(int i = 0; i < N; i++) {
                        if(F[l][i] == 1) continue;
                        int cur = 0;
                        queue<pair<int, int>> Q;
                        Q.push({l,i});
                        while(!Q.empty()) {
                            int X = Q.front().first, Y = Q.front().second; Q.pop();
                            if(F[X][Y]) continue;
                            ++cur; F[X][Y] = 1;
                            for(int j = 0; j < 4; j++) {
                                int x = X + nx[j], y = Y + ny[j];
                                if(x == N || x < 0 || y == N || y < 0) continue;
                                if(F[x][y]) continue;
                                Q.push({x, y});
                            }
                        }
                        res = max(res, cur);
                    }
                }
                return res;
            }

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30