#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
ll prefrow[2001][2001];
ll prefcol[2001][2001];
ll grid[2001][2001];
bool checkrow(ll a, ll b, ll row){
if (a>b) swap(a,b);
return (prefrow[row][b] - prefrow[row][a] + grid[row][a] == 0);
}
bool checkcol(ll a, ll b, ll col){
if (a>b) swap(a,b);
return (prefcol[b][col] - prefcol[a][col] + grid[a][col] == 0);
}
vector<array<ll,2>> possible;
ll ans = 0;
ll cnt =0 ;
void idkman(vector<array<ll,2>>& sus, ll n, bool flag){
cnt++;
if (sus.size() == n){
vector<vector<ll>> special;
ll temp = 0;
bool flag = false;
FOR(i,0,sus.size()){
if (sus[i] != array<ll,2> {0,0}){
special.push_back({i, sus[i][1]});
special.push_back({i, sus[i][0]});
temp -= prefrow[i][sus[i][1]] - prefrow[i][sus[i][0]] + grid[i][sus[i][0]];
temp += sus[i][1]-sus[i][0]+1;
}
}
for (auto&X : special){
for (auto&Y : special){
ll i = X[0], j = X[1], k = Y[0], l= Y[1];
if (grid[i][j]==1 || grid[k][l] == 1) continue;
bool check1 = (checkrow(l, j, i) && checkcol(k, i, l));
bool check2 = (checkrow(l, j, k) && checkcol(k, i, j));
if (!check1 && !check2) flag = true;
}
}
if (!flag){
ans = max(ans, temp);
}
return;
}
bool origflag = flag;
for (auto&i : possible){
if (sus.size() && i != array<ll,2>{0,0}){
ll left = sus[sus.size()-1][0];
ll right = sus[sus.size()-1][1];
if (!(left==0 && right==0) && !(left<=i[0] && i[1] <= right) && flag){
continue;
}
if (!(left==0 && right==0) && !(left<=i[0] && i[1] <= right)) flag = 1;
}
if (sus.size()>=2 && i == array<ll,2>{0,0} && sus[sus.size()-2] != i){
continue;
}
sus.push_back(i);
idkman(sus, n, flag);
sus.pop_back();
flag = origflag;
}
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
possible.clear();
ans = 0;
FOR(i,0,N){
FOR(j,0,N){
grid[i][j] = F[i][j];
}
}
FOR(i,0,N){
prefrow[i][0] = F[i][0];
FOR(j,1,N){
prefrow[i][j] = prefrow[i][j-1] + F[i][j];
}
}
FOR(j,0,N){
prefcol[0][j] = F[0][j];
FOR(i,1,N){
prefcol[i][j] = prefcol[i-1][j] + F[i][j];
}
}
FOR(i,0,N){
FOR(j,i,N){
possible.push_back({i,j});
}
}
possible.push_back({0,0});
// cout << possible.size() << endl;
vector<array<ll,2>> lmao;
idkman(lmao, N, 0);
// cout << cnt << endl;
// vector<vector<ll>> special;
// FOR(i,a,b){
// FOR(j,c,d){
// temp -= grid[i][j];
// vector<vector<ll>> sus = {{i-1,j}, {i+1,j}, {i,j-1}, {i,j+1}};
// if (grid[i][j] != 1){
// bool flag = 0;
// for (auto&k : sus){
// if (0<=k[0] && k[0]<N && 0<=k[1] && k[1]<N){
// if (grid[k[0]][k[1]]==1) flag = 1;
// }
// }
// if (flag==1 || i==0 || i==N-1 || j==0 || j==N-1) special.push_back({i,j});
// }
// }
// }
// bool flag = false;
// for (auto&X : special){
// for (auto&Y : special){
// ll i = X[0], j = X[1], k = Y[0], l= Y[1];
// if (grid[i][j]==1 || grid[k][l] == 1) continue;
// bool check1 = (checkrow(l, j, i) && checkcol(k, i, l));
// bool check2 = (checkrow(l, j, k) && checkcol(k, i, j));
// if (!check1 && !check2) flag = true;
// }
// }
// if (!flag) ans = max(ans, temp);
return ans;
}
Compilation message
soccer.cpp: In function 'void idkman(std::vector<std::array<long long int, 2> >&, ll, bool)':
soccer.cpp:42:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
42 | if (sus.size() == n){
| ~~~~~~~~~~~^~~~
soccer.cpp:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
47 | FOR(i,0,sus.size()){
| ~~~~~~~~~~~~~~
soccer.cpp:47:9: note: in expansion of macro 'FOR'
47 | FOR(i,0,sus.size()){
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
97 ms |
480 KB |
ok |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Execution timed out |
4538 ms |
344 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Correct |
1 ms |
348 KB |
ok |
| 4 |
Incorrect |
0 ms |
448 KB |
wrong |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
97 ms |
480 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Correct |
1 ms |
344 KB |
ok |
| 4 |
Correct |
1 ms |
348 KB |
ok |
| 5 |
Incorrect |
0 ms |
448 KB |
wrong |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
97 ms |
480 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Correct |
1 ms |
344 KB |
ok |
| 4 |
Execution timed out |
4538 ms |
344 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
97 ms |
480 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Correct |
1 ms |
344 KB |
ok |
| 4 |
Execution timed out |
4538 ms |
344 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
97 ms |
480 KB |
ok |
| 2 |
Correct |
1 ms |
344 KB |
ok |
| 3 |
Correct |
1 ms |
344 KB |
ok |
| 4 |
Execution timed out |
4538 ms |
344 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
