oj.uz

Submission #1011061

# Submission time Handle Problem Language Result Execution time Memory
1011061 2024-06-29T18:13:00 Z Dan4Life Soccer Stadium (IOI23_soccer) C++17
0 / 100
 4500 ms 492 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)

const int mxN = (int)1e3+10;
int n;
set<int> col[mxN];

int biggest_stadium(int N, vector<vector<int>> F)
{
	n = N; int ans = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(!F[i][j]) continue;
			col[j].insert(i);
		}
		col[i].insert(-1),col[i].insert(n);
	}
    for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(F[i][j]) continue;
			int k = i;
			while(k<n){
				if(F[k][j]) break;
				for(int l = i; l <= k; l++){
					int U = i, D = k;
					int tot = D-U+1;
					for(int m = j-1; m>=0; m--){
						auto itr2 = col[m].lower_bound(l);
						auto itr = itr2; itr--;
						U = max(U,*itr+1);
						D = min(D,*itr2-1);
						if(U>l or D<l) break;
						tot+=D-U+1;
					}
					U = i, D = k;
					for(int m = j+1; m < n; m++){
						auto itr2 = col[m].lower_bound(l);
						auto itr = itr2; itr--;
						U = max(U,*itr+1);
						D = min(D,*itr2-1);
						if(U>l or D<l) break;
						tot+=D-U+1;
					}
					ans = max(ans, tot);
				}
				k++;
			}
		}
	}
	return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory 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 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Execution timed out 4598 ms 492 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Incorrect 0 ms 344 KB wrong
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory 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 344 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Incorrect 0 ms 344 KB wrong
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory 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 0 ms 344 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Incorrect 0 ms 344 KB wrong
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory 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 0 ms 344 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Incorrect 0 ms 344 KB wrong
11 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory 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 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Execution timed out 4598 ms 492 KB Time limit exceeded
9 Halted 0 ms 0 KB -