Submission #1070221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070221		MohamedFaresNebili	축구 경기장 (IOI23_soccer)	C++17	0 / 100	1221 ms	2097152 KiB

soccer

#include <bits/stdc++.h>
#include "soccer.h"

        using namespace std;

        int solveA(int r, int i, int j, int N, vector<vector<int>> F) {
            if(r == N) return 0;
            int best = 0;
            for(int l = i; l <= j; l++) {
                int k = l;
                if(F[r][l] == 1) continue;
                while(k <= j && F[r][k] == 0) k++;
                best = max(best, k - l + solveA(r + 1, l, k - 1, N, F));
                l = k - 1;
            }
            return best;
        }
        int solveB(int r, int i, int j, int N, vector<vector<int>> F) {
            if(r == -1) return 0;
            int best = 0;
            for(int l = i; l <= j; l++) {
                int k = l;
                if(F[r][l] == 1) continue;
                while(k <= j && F[r][k] == 0) k++;
                best = max(best, k - l + solveB(r - 1, l, k - 1, N, F));
                l = k - 1;
            }
            return best;
        }

        int solveC(int r, int i, int j, int N, vector<vector<int>> F) {
            if(r == N) return 0;
            int best = 0;
            for(int l = i; l <= j; l++) {
                int k = l;
                if(F[l][r] == 1) continue;
                while(k <= j && F[k][r] == 0) k++;
                best = max(best, k - l + solveC(r + 1, l, k - 1, N, F));
                l = k - 1;
            }
            return best;
        }
        int solveD(int r, int i, int j, int N, vector<vector<int>> F) {
            if(r == -1) return 0;
            int best = 0;
            for(int l = i; l <= j; l++) {
                int k = l;
                if(F[l][r] == 1) continue;
                while(k <= j && F[k][r] == 0) k++;
                best = max(best, k - l + solveD(r - 1, l, k - 1, N, F));
                l = k - 1;
            }
            return best;
        }

        int biggest_stadium(int N, vector<vector<int>> F) {
            int A = solveA(0, 0, N - 1, N, F);
            int B = solveB(N - 1, 0, N - 1, N, F);
            int C = solveC(0, 0, N - 1, N, F);
            int D = solveD(N - 1, 0, N - 1, N, F);
            return max({A, B, C, D});
        }

• 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