oj.uz

답안 #557187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557187 2022-05-04T20:37:47 Z lunchbox 푸드 코트 (JOI21_foodcourt) C++17
24 / 100
 341 ms 32776 KB 
#include <bits/stdc++.h>
using namespace std;

using LL = long long;
const int N = 250000, N_ = 1 << 18, INF = 0x3f3f3f3f;

int n_;

array<LL, 2> st1[N_ * 2];

array<LL, 2> join(array<LL, 2> a, array<LL, 2> b) {
	return { a[0] + b[0], max(a[1] + b[0], b[1]) };
}

void update1(int i, int x) {
	i |= n_;
	st1[i][0] = x;
	st1[i][1] = max(0, x);
	while (i >>= 1)
		st1[i] = join(st1[i << 1 | 0], st1[i << 1 | 1]);
}

LL query1(int l, int r) {
	vector<int> ll, rr;
	array<LL, 2> v = { 0, 0 };

	for (l |= n_, r |= n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			ll.push_back(l++);
		if ((r & 1) == 0)
			rr.push_back(r--);
	}
	for (int i : ll)
		v = join(v, st1[i]);
	reverse(rr.begin(), rr.end());
	for (int i : rr)
		v = join(v, st1[i]);
	return v[1];
}

LL st2[N_ * 2];

void update2(int i, int x) {
	st2[i |= n_] = x;
	while (i >>= 1)
		st2[i] = st2[i << 1 | 0] + st2[i << 1 | 1];
}

LL query2(int l, int r) {
	LL sum = 0;

	for (l |= n_, r |= n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			sum += st2[l++];
		if ((r & 1) == 0)
			sum += st2[r--];
	}
	return sum;
}

int query3(LL x) {
	int i = 1;

	while (i < n_) {
		if (st2[i << 1 | 0] >= x)
			i = i << 1 | 0;
		else {
			x -= st2[i << 1 | 0];
			i = i << 1 | 1;
		}

	}
	return i ^ n_;
}

vector<pair<int, int>> uu[N], qq[N];

void run() {
	static int cc[N], ans[N];
	int n, m, q;

	scanf("%d%d%d", &n, &m, &q);
	n_ = 1;
	while (n_ < q)
		n_ <<= 1;
	for (int h = 0; h < q; h++) {
		int t;

		scanf("%d", &t);
		if (t == 1) {
			int l, r, k;

			scanf("%d%d%d%d", &l, &r, &cc[h], &k), l--;
			uu[l].push_back({ h << 1 | 0, k });
			uu[r].push_back({ h << 1 | 0, 0 });
		} else if (t == 2) {
			int l, r, k;

			scanf("%d%d%d", &l, &r, &k), l--;
			uu[l].push_back({ h << 1 | 1, -k });
			uu[r].push_back({ h << 1 | 1, 0 });
		} else {
			int i, k;

			scanf("%d%d", &i, &k), i--;
			qq[i].push_back({ h, k });
		}
	}
	memset(ans, -1, q * sizeof * ans);
	for (int i = 0; i < n; i++) {
		for (auto [h2, k] : uu[i]) {
			int h = h2 >> 1;

			update1(h, k);
			if ((h2 & 1) == 0)
				update2(h, k);
		}
		for (auto [h, k] : qq[i]) {
			LL x = query1(0, h);

			ans[h] = x < k ? 0 : cc[query3(query2(0, h) - x + k)];
		}
	}
	for (int h = 0; h < q; h++)
		if (ans[h] != -1)
			printf("%d\n", ans[h]);
}

int main() {
	run();
	return 0;
}

Compilation message

foodcourt.cpp: In function 'void run()':
foodcourt.cpp:82:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  scanf("%d%d%d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |   scanf("%d", &t);
      |   ~~~~~^~~~~~~~~~
foodcourt.cpp:93:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |    scanf("%d%d%d%d", &l, &r, &cc[h], &k), l--;
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:99:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |    scanf("%d%d%d", &l, &r, &k), l--;
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:105:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |    scanf("%d%d", &i, &k), i--;
      |    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 12 ms 12244 KB Output is correct
3 Correct 12 ms 12184 KB Output is correct
4 Correct 9 ms 12172 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 9 ms 12140 KB Output is correct
8 Correct 9 ms 12192 KB Output is correct
9 Correct 9 ms 12244 KB Output is correct
10 Correct 13 ms 12136 KB Output is correct
11 Correct 10 ms 12200 KB Output is correct
12 Correct 9 ms 12244 KB Output is correct
13 Correct 12 ms 12116 KB Output is correct
14 Correct 11 ms 12244 KB Output is correct
15 Correct 8 ms 12116 KB Output is correct
16 Correct 8 ms 12244 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 9 ms 12244 KB Output is correct
19 Correct 12 ms 12244 KB Output is correct
20 Correct 9 ms 12188 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 12 ms 12244 KB Output is correct
3 Correct 12 ms 12184 KB Output is correct
4 Correct 9 ms 12172 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 9 ms 12140 KB Output is correct
8 Correct 9 ms 12192 KB Output is correct
9 Correct 9 ms 12244 KB Output is correct
10 Correct 13 ms 12136 KB Output is correct
11 Correct 10 ms 12200 KB Output is correct
12 Correct 9 ms 12244 KB Output is correct
13 Correct 12 ms 12116 KB Output is correct
14 Correct 11 ms 12244 KB Output is correct
15 Correct 8 ms 12116 KB Output is correct
16 Correct 8 ms 12244 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 9 ms 12244 KB Output is correct
19 Correct 12 ms 12244 KB Output is correct
20 Correct 9 ms 12188 KB Output is correct
21 Incorrect 9 ms 12136 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 17896 KB Output is correct
2 Correct 72 ms 17968 KB Output is correct
3 Correct 77 ms 17956 KB Output is correct
4 Correct 78 ms 17944 KB Output is correct
5 Correct 70 ms 17956 KB Output is correct
6 Correct 84 ms 17948 KB Output is correct
7 Correct 44 ms 16440 KB Output is correct
8 Correct 42 ms 16600 KB Output is correct
9 Correct 79 ms 17496 KB Output is correct
10 Correct 78 ms 17944 KB Output is correct
11 Correct 80 ms 17780 KB Output is correct
12 Correct 81 ms 18072 KB Output is correct
13 Correct 52 ms 17172 KB Output is correct
14 Correct 78 ms 17916 KB Output is correct
15 Correct 63 ms 17688 KB Output is correct
16 Correct 89 ms 17920 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 341 ms 32776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 12 ms 12244 KB Output is correct
3 Correct 12 ms 12184 KB Output is correct
4 Correct 9 ms 12172 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 9 ms 12140 KB Output is correct
8 Correct 9 ms 12192 KB Output is correct
9 Correct 9 ms 12244 KB Output is correct
10 Correct 13 ms 12136 KB Output is correct
11 Correct 10 ms 12200 KB Output is correct
12 Correct 9 ms 12244 KB Output is correct
13 Correct 12 ms 12116 KB Output is correct
14 Correct 11 ms 12244 KB Output is correct
15 Correct 8 ms 12116 KB Output is correct
16 Correct 8 ms 12244 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 9 ms 12244 KB Output is correct
19 Correct 12 ms 12244 KB Output is correct
20 Correct 9 ms 12188 KB Output is correct
21 Correct 67 ms 17896 KB Output is correct
22 Correct 72 ms 17968 KB Output is correct
23 Correct 77 ms 17956 KB Output is correct
24 Correct 78 ms 17944 KB Output is correct
25 Correct 70 ms 17956 KB Output is correct
26 Correct 84 ms 17948 KB Output is correct
27 Correct 44 ms 16440 KB Output is correct
28 Correct 42 ms 16600 KB Output is correct
29 Correct 79 ms 17496 KB Output is correct
30 Correct 78 ms 17944 KB Output is correct
31 Correct 80 ms 17780 KB Output is correct
32 Correct 81 ms 18072 KB Output is correct
33 Correct 52 ms 17172 KB Output is correct
34 Correct 78 ms 17916 KB Output is correct
35 Correct 63 ms 17688 KB Output is correct
36 Correct 89 ms 17920 KB Output is correct
37 Correct 68 ms 17456 KB Output is correct
38 Correct 52 ms 16784 KB Output is correct
39 Correct 37 ms 15916 KB Output is correct
40 Correct 39 ms 16524 KB Output is correct
41 Correct 58 ms 17356 KB Output is correct
42 Correct 60 ms 17948 KB Output is correct
43 Correct 59 ms 18000 KB Output is correct
44 Correct 58 ms 17596 KB Output is correct
45 Correct 59 ms 17920 KB Output is correct
46 Correct 63 ms 17980 KB Output is correct
47 Correct 45 ms 16964 KB Output is correct
48 Correct 61 ms 17532 KB Output is correct
49 Correct 40 ms 16264 KB Output is correct
50 Correct 49 ms 17100 KB Output is correct
51 Correct 61 ms 17944 KB Output is correct
52 Correct 57 ms 17916 KB Output is correct
53 Correct 45 ms 16696 KB Output is correct
54 Correct 68 ms 17904 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 17328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 12 ms 12244 KB Output is correct
3 Correct 12 ms 12184 KB Output is correct
4 Correct 9 ms 12172 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 9 ms 12140 KB Output is correct
8 Correct 9 ms 12192 KB Output is correct
9 Correct 9 ms 12244 KB Output is correct
10 Correct 13 ms 12136 KB Output is correct
11 Correct 10 ms 12200 KB Output is correct
12 Correct 9 ms 12244 KB Output is correct
13 Correct 12 ms 12116 KB Output is correct
14 Correct 11 ms 12244 KB Output is correct
15 Correct 8 ms 12116 KB Output is correct
16 Correct 8 ms 12244 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 9 ms 12244 KB Output is correct
19 Correct 12 ms 12244 KB Output is correct
20 Correct 9 ms 12188 KB Output is correct
21 Incorrect 9 ms 12136 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 12 ms 12244 KB Output is correct
3 Correct 12 ms 12184 KB Output is correct
4 Correct 9 ms 12172 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12116 KB Output is correct
7 Correct 9 ms 12140 KB Output is correct
8 Correct 9 ms 12192 KB Output is correct
9 Correct 9 ms 12244 KB Output is correct
10 Correct 13 ms 12136 KB Output is correct
11 Correct 10 ms 12200 KB Output is correct
12 Correct 9 ms 12244 KB Output is correct
13 Correct 12 ms 12116 KB Output is correct
14 Correct 11 ms 12244 KB Output is correct
15 Correct 8 ms 12116 KB Output is correct
16 Correct 8 ms 12244 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 9 ms 12244 KB Output is correct
19 Correct 12 ms 12244 KB Output is correct
20 Correct 9 ms 12188 KB Output is correct
21 Incorrect 9 ms 12136 KB Output isn't correct
22 Halted 0 ms 0 KB -