답안 #54249 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
54249	2018-07-02T22:07:13 Z	baactree	Pyramid Base (IOI08_pyramid_base)	C++17	80 / 100	5000 ms	55284 KB

pyramid_base

#include <bits/stdc++.h>
using namespace std;
int tree[1 << 21][2];
void update(int le, int ri, int val, int nodele, int noderi, int node) {
	if (le > noderi || ri < nodele)return;
	if (le <= nodele && noderi <= ri) {
		tree[node][0] += val;
		tree[node][1] += val;
		return;
	}
	int mid = (nodele + noderi) / 2;
	update(le, ri, val, nodele, mid, node * 2);
	update(le, ri, val, mid + 1, noderi, node * 2 + 1);
	tree[node][0] = min(tree[node * 2][0], tree[node * 2 + 1][0])+tree[node][1];
}
void init(int nodele, int noderi, int node) {
	tree[node][0] = tree[node][1] = 0;
	if (nodele == noderi) return;
	int mid = (nodele + noderi) / 2;
	init(nodele, mid, node * 2);
	init(mid + 1, noderi, node * 2 + 1);
}
int n, m, b, p;
vector<tuple<int, int, int> > vec[1000005];
bool possi(int k) {
	init(1, m - k + 1, 1);
	for (int i = 1; i <= n; i++) {
		for (auto v : vec[i]) {
			int y1, y2, c;
			tie(y1, y2, c) = v;
			if (c > 0) update(max(1, y1 - k + 1), min(m - k + 1, y2), c, 1, m - k + 1, 1);
		}
		if (i >= k) {
			for (auto v : vec[i - k]) {
				int y1, y2, c;
				tie(y1, y2, c) = v;
				if (c < 0) update(max(1, y1 - k + 1), min(m - k + 1, y2), c, 1, m - k + 1, 1);
			}
		}
		if (i >= k && tree[1][0] <= b) return true;
	}
	return false;
}
int main() {
	scanf("%d%d%d%d", &n, &m, &b, &p);
	for (int i = 0; i < p; i++) {
		int x1, y1, x2, y2, c;
		scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
		vec[x1].emplace_back(y1, y2, b ? c : 1);
		vec[x2].emplace_back(y1, y2, b ? -c : -1);
	}
	int le, ri, ans, mid;
	le = 1;
	ri = m;
	ans = 0;
	while (le <= ri) {
		mid = (le + ri) / 2;
		if (possi(mid)) {
			ans = mid;
			le = mid + 1;
		}
		else ri = mid - 1;
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

pyramid_base.cpp: In function 'int main()':
pyramid_base.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &n, &m, &b, &p);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
pyramid_base.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	23800 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	23908 KB	Output is correct

Subtask #3
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	23988 KB	Output is correct

Subtask #4
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	24296 KB	Output is correct

Subtask #5
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	43 ms	26120 KB	Output is correct

Subtask #6
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	114 ms	32280 KB	Output is correct
2	Correct	270 ms	40536 KB	Output is correct

Subtask #7
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	259 ms	40536 KB	Output is correct
2	Correct	144 ms	40536 KB	Output is correct

Subtask #8
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	40536 KB	Output is correct
2	Correct	61 ms	40536 KB	Output is correct
3	Correct	53 ms	40536 KB	Output is correct

Subtask #9
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	142 ms	40536 KB	Output is correct
2	Correct	285 ms	40536 KB	Output is correct
3	Correct	247 ms	40536 KB	Output is correct

Subtask #10
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	320 ms	40536 KB	Output is correct
2	Correct	44 ms	40536 KB	Output is correct
3	Correct	404 ms	41196 KB	Output is correct
4	Correct	505 ms	41708 KB	Output is correct

Subtask #11
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	503 ms	41804 KB	Output is correct
2	Correct	873 ms	41964 KB	Output is correct
3	Correct	228 ms	41964 KB	Output is correct

Subtask #12
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	398 ms	41964 KB	Output is correct
2	Correct	1109 ms	42364 KB	Output is correct
3	Correct	1083 ms	42364 KB	Output is correct
4	Correct	1121 ms	42364 KB	Output is correct
5	Correct	1129 ms	42364 KB	Output is correct
6	Correct	177 ms	42364 KB	Output is correct

Subtask #13
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4830 ms	51060 KB	Output is correct
2	Correct	421 ms	51060 KB	Output is correct

Subtask #14
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5033 ms	55284 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #15
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5017 ms	55284 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-