Submission #1201314

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201314		PagodePaiva	Soccer Stadium (IOI23_soccer)	C++20	8 / 100	4414 ms	416 KiB

soccer

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

using namespace std;

const int N = 4;
int m[N][N];

int check(int n){
    int cnt = 0;
    for(int i1 = 0;i1 < n;i1++){
        for(int j1 = 0;j1 < n;j1++){
            if(m[i1][j1] == 1)
                continue;
            cnt++;
            for(int i2 = i1;i2 < n;i2++){
                for(int j2 = j1;j2 < n;j2++){
                    if(m[i2][j2] == 1)
                        continue;
                    bool aux1 = true, aux2 = true;
                    for(int l = i1;l <= i2;l++){
                        if(m[l][j1] == 1)
                            aux1 = false;
                        if(m[l][j2] == 1)
                            aux2 = false;
                    }
                    for(int l = j1;l <= j2;l++){
                        if(m[i2][l])
                            aux1 = false;
                        if(m[i1][l])
                            aux2 = false;
                    }
                    if(!aux1 and !aux2){
                        //cout << i1 << ' ' << j1 << ' ' << i2 << ' ' << j2 << '\n';
                        return 0;
                    }
                }
                for(int j2 = j1;j2 >= 0;j2--){
                    if(m[i2][j2] == 1)
                        continue;
                    bool aux1 = true, aux2 = true;
                    for(int l = i1;l <= i2;l++){
                        if(m[l][j1] == 1)
                            aux1 = false;
                        if(m[l][j2] == 1)
                            aux2 = false;
                    }
                    for(int l = j2;l >= j1;l--){
                        if(m[i2][l])
                            aux1 = false;
                        if(m[i1][l])
                            aux2 = false;
                    }
                    if(!aux1 and !aux2){
                       // cout << i1 << ' ' << j1 << ' ' << i2 << ' ' << j2 << '\n';
                        return 0;
                    }
                }   
            }
        }
    }
    return cnt;
}

int biggest_stadium(int n, std::vector<std::vector<int>> mat){
    int ans = 0;
    for(int mask = 0;mask < (1<<(n*n));mask++){
        for(int i = 0;i < n;i++){
            for(int j = 0;j < n;j++){
                if(mat[i][j] == 1)
                    m[i][j] = 1;
                else
                    m[i][j] = 0;
            }
        }
        for(int j = 0;j < n*n;j++){
            if(((1<<j)&mask)){
                int l = j/n;
                int r = j%n;
                m[l][r] = 1;
            }
        }
        ans = max(ans, check(n));
    }  
    return ans;
}

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