oj.uz

답안 #937314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937314 2024-03-03T20:09:08 Z Dan4Life 축구 경기장 (IOI23_soccer) C++17
0 / 100
 4500 ms 480 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

#define pf push_front
#define pb push_back
#define ll long long
#define vi vector<int>
#define sz(a) (int)a.size()
#define lb lower_bound
#define ub upper_bound
#define all(a) begin(a),end(a)

const int mxN = 2010;
int n;
vector<int> col[mxN];

int solve(vector<vi> &a){
	int ans = 0;
	for(int i = 0; i < n; i++) 
		col[i].clear(), col[i].pb(-1);
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			if(a[i][j]) col[j].pb(i);
	for(int i = 0; i < n; i++) 
		col[i].pb(n),sort(all(col[i]));
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(a[i][j]) continue;
			for(int k = i; k < n; k++){
				if(a[k][j]) break; 
				int mxJ = j;
				for (int l = j; l < n; l++){
					int nx_forest = *lb(all(col[l]),i);
					if(nx_forest<=k) break; mxJ = l;
				}
				
				for(int l = j; l <= mxJ; l++){
					int tot = 0, UP = i, DOWN = k;
					if(l!=j){
						while(UP>0 and !a[UP-1][l]) UP--;	
						while(DOWN<n-1 and !a[DOWN+1][l]) DOWN++;
					}
					tot+=DOWN-UP+1;
					int up2 = UP, down2 = DOWN;
					
					for(int m = l-1; m >= j; m--){
						int forestUp = *(prev(lb(all(col[m]),i)));
						int forestDown = *lb(all(col[m]),i);
						int up = max(UP, forestUp+1); 
						int down = min(DOWN, forestDown-1);
						tot+=down-up+1;
						if(m==j) UP=i,DOWN=k;
						else UP = up, DOWN = down;
					}
					UP = up2, DOWN = down2;
					for(int m = l+1; m <= mxJ; m++){
						int forestUp = *(prev(lb(all(col[m]),i)));
						int forestDown = *lb(all(col[m]),i);
						int up = max(UP, forestUp+1); 
						int down = min(DOWN, forestDown-1);
						tot+=down-up+1;
						if(m==j) UP=i,DOWN=k;
						else UP = up, DOWN = down;
					}
					ans = max(ans, tot); 
				}
			}
		}
	}
	return ans;
}

int biggest_stadium(int N, vector<vi> a)
{
	n = N; int ans = solve(a); 
	for(int k = 0; k < 4; k++){
		auto b = a;
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				a[n-j-1][i] = b[i][j];
		ans = max(ans, solve(a));
	}
	return ans;
}

Compilation message

soccer.cpp: In function 'int solve(std::vector<std::vector<int> >&)':
soccer.cpp:36:6: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   36 |      if(nx_forest<=k) break; mxJ = l;
      |      ^~
soccer.cpp:36:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   36 |      if(nx_forest<=k) break; mxJ = l;
      |                              ^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 2 ms 480 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Execution timed out 4568 ms 348 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Incorrect 0 ms 348 KB wrong
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 2 ms 480 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Incorrect 0 ms 348 KB wrong
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 2 ms 480 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Incorrect 0 ms 348 KB wrong
11 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 2 ms 480 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Execution timed out 4568 ms 348 KB Time limit exceeded
9 Halted 0 ms 0 KB -