답안 #1023885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023885	2024-07-15T08:36:51 Z	j_vdd16	축구 경기장 (IOI23_soccer)	C++17	48 / 100	4500 ms	6748 KB

soccer

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;


int biggest_stadium(int n, vvi f) {
	vvi up(n, vi(n)), down(n, vi(n)), left(n, vi(n)), right(n, vi(n));
	loop(x, n) {
		up[0][x] = 1 - f[0][x];
		for (int y = 1; y < n; y++) {
			if (f[y][x])
				up[y][x] = 0;
			else
				up[y][x] = up[y - 1][x] + 1;

		}

		down[n - 1][x] = 1 - f[n - 1][x];
		for (int y = n - 2; y >= 0; y--) {
			if (f[y][x])
				down[y][x] = 0;
			else
				down[y][x] = down[y + 1][x] + 1;
		}
	}
	loop(y, n) {
		left[y][0] = 1 - f[y][0];
		for (int x = 1; x < n; x++) {
			if (f[y][x])
				left[y][x] = 0;
			else
				left[y][x] = left[y][x - 1] + 1;

		}

		right[y][n - 1] = 1 - f[y][n - 1];
		for (int x = n - 2; x >= 0; x--) {
			if (f[y][x])
				right[y][x] = 0;
			else
				right[y][x] = right[y][x + 1] + 1;
		}

		//loop(y, n)
		//	cout << high[x][y] << low[x][y] << ' ';

		//cout << endl;
	}
	//cout << endl;

	int result = 0;
	loop(y, n) {
		loop(x, n) {
			if (f[y][x]) {
				//cout << "00 ";
				continue;
			}

			int count1 = 0;
			{
				int l = 0, r = INT_MAX;
				vii intervals;
				for (int y2 = y; y2 < y + down[y][x]; y2++) {
					l = max(l, x - left[y2][x] + 1);
					r = min(r, x + right[y2][x] - 1);

					intervals.push_back({ l, r });
					count1 += r - l + 1;
				}

				l = x - left[y][x] + 1;
				r = x + right[y][x] - 1;
				for (int y2 = y - 1; y2 > y - up[y][x]; y2--) {
					l = max(l, x - left[y2][x] + 1);
					r = min(r, x + right[y2][x] - 1);

					for (auto [li, ri] : intervals) {
						if (r < ri)
							l = max(l, li);

						if (l > li)
							r = min(r, ri);
					}

					if (r < l)
						break;

					count1 += r - l + 1;
				}
			}
			int count2 = 0;
			{
				int l = 0, r = INT_MAX;
				vii intervals;
				for (int y2 = y; y2 > y - up[y][x]; y2--) {
					l = max(l, x - left[y2][x] + 1);
					r = min(r, x + right[y2][x] - 1);

					intervals.push_back({ l, r });
					count2 += r - l + 1;
				}

				l = x - left[y][x] + 1;
				r = x + right[y][x] - 1;
				for (int y2 = y + 1; y2 < y + down[y][x]; y2++) {
					l = max(l, x - left[y2][x] + 1);
					r = min(r, x + right[y2][x] - 1);

					for (auto [li, ri] : intervals) {
						if (r < ri)
							l = max(l, li);

						if (l > li)
							r = min(r, ri);
					}

					if (r < l)
						break;

					count2 += r - l + 1;
				}
			}

			int count = max(count1, count2);
			result = max(result, count);
			//cout << count / 10 << count % 10 << ' ';
		}
		//cout << endl;
	}
	return result;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

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

Subtask #2
8.0 / 8.0

#	결과	메모리	Grader output
1	Correct	344 KB	ok
2	Correct	436 KB	ok
3	Correct	348 KB	ok
4	Correct	348 KB	ok
5	Correct	344 KB	ok
6	Correct	348 KB	ok
7	Correct	348 KB	ok
8	Correct	348 KB	ok
9	Correct	348 KB	ok
10	Correct	348 KB	ok
11	Correct	348 KB	ok
12	Correct	348 KB	ok
13	Correct	344 KB	ok

Subtask #3
22.0 / 22.0

#	결과	메모리	Grader output
1	Correct	348 KB	ok
2	Correct	344 KB	ok
3	Correct	436 KB	ok
4	Correct	348 KB	ok
5	Correct	348 KB	ok
6	Correct	344 KB	ok
7	Correct	348 KB	ok
8	Correct	348 KB	ok
9	Correct	348 KB	ok
10	Correct	348 KB	ok
11	Correct	348 KB	ok
12	Correct	348 KB	ok
13	Correct	348 KB	ok
14	Correct	344 KB	ok
15	Correct	348 KB	ok
16	Correct	348 KB	ok
17	Correct	348 KB	ok
18	Correct	348 KB	ok
19	Correct	348 KB	ok
20	Correct	348 KB	ok
21	Correct	392 KB	ok
22	Correct	348 KB	ok
23	Correct	348 KB	ok
24	Correct	436 KB	ok
25	Correct	348 KB	ok
26	Correct	348 KB	ok

Subtask #4
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	436 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	1 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Correct	0 ms	348 KB	ok
8	Correct	0 ms	344 KB	ok
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	348 KB	ok
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Correct	0 ms	348 KB	ok
14	Correct	0 ms	348 KB	ok
15	Correct	0 ms	348 KB	ok
16	Correct	0 ms	344 KB	ok
17	Correct	0 ms	348 KB	ok
18	Correct	0 ms	348 KB	ok
19	Correct	0 ms	348 KB	ok
20	Correct	0 ms	348 KB	ok
21	Correct	0 ms	348 KB	ok
22	Correct	0 ms	348 KB	ok
23	Correct	0 ms	392 KB	ok
24	Correct	0 ms	348 KB	ok
25	Correct	0 ms	348 KB	ok
26	Correct	0 ms	436 KB	ok
27	Correct	0 ms	348 KB	ok
28	Correct	0 ms	348 KB	ok
29	Correct	1 ms	348 KB	ok
30	Correct	1 ms	348 KB	ok
31	Correct	1 ms	348 KB	ok
32	Correct	0 ms	348 KB	ok
33	Correct	0 ms	348 KB	ok
34	Correct	1 ms	344 KB	ok
35	Correct	0 ms	348 KB	ok
36	Correct	0 ms	348 KB	ok
37	Correct	0 ms	348 KB	ok
38	Correct	1 ms	348 KB	ok
39	Correct	0 ms	600 KB	ok
40	Correct	1 ms	348 KB	ok
41	Correct	1 ms	348 KB	ok

Subtask #5
0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	436 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	1 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Correct	0 ms	348 KB	ok
8	Correct	0 ms	344 KB	ok
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	348 KB	ok
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Correct	0 ms	348 KB	ok
14	Correct	0 ms	348 KB	ok
15	Correct	0 ms	348 KB	ok
16	Correct	0 ms	344 KB	ok
17	Correct	0 ms	348 KB	ok
18	Correct	0 ms	348 KB	ok
19	Correct	0 ms	348 KB	ok
20	Correct	0 ms	348 KB	ok
21	Correct	0 ms	348 KB	ok
22	Correct	0 ms	348 KB	ok
23	Correct	0 ms	392 KB	ok
24	Correct	0 ms	348 KB	ok
25	Correct	0 ms	348 KB	ok
26	Correct	0 ms	436 KB	ok
27	Correct	0 ms	348 KB	ok
28	Correct	0 ms	348 KB	ok
29	Correct	1 ms	348 KB	ok
30	Correct	1 ms	348 KB	ok
31	Correct	1 ms	348 KB	ok
32	Correct	0 ms	348 KB	ok
33	Correct	0 ms	348 KB	ok
34	Correct	1 ms	344 KB	ok
35	Correct	0 ms	348 KB	ok
36	Correct	0 ms	348 KB	ok
37	Correct	0 ms	348 KB	ok
38	Correct	1 ms	348 KB	ok
39	Correct	0 ms	600 KB	ok
40	Correct	1 ms	348 KB	ok
41	Correct	1 ms	348 KB	ok
42	Correct	142 ms	6744 KB	ok
43	Correct	72 ms	6748 KB	ok
44	Partially correct	3680 ms	6744 KB	partial
45	Execution timed out	4563 ms	6748 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

Subtask #6
0.0 / 30.0

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

답안 #1023885

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 0.0 / 6.0

Subtask #2 8.0 / 8.0

Subtask #3 22.0 / 22.0

Subtask #4 18.0 / 18.0

Subtask #5 0.0 / 16.0

Subtask #6 0.0 / 30.0

Subtask #0
0.0 / 0.0

Subtask #1
0.0 / 6.0

Subtask #2
8.0 / 8.0

Subtask #3
22.0 / 22.0

Subtask #4
18.0 / 18.0

Subtask #5
0.0 / 16.0

Subtask #6
0.0 / 30.0