oj.uz

Submission #849274

# Submission time Handle Problem Language Result Execution time Memory
849274 2023-09-14T11:18:41 Z IBory 역사적 조사 (JOI14_historical) C++17
100 / 100
 3417 ms 14164 KB 
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int SZ = 1 << 17, SQ = 8;
ll X[SZ], ans[SZ], S[SZ];

struct Query {
	int s, e, id;
	Query(int a = 0, int b = 0, int c = 0) {
		s = a, e = b, id = c;
	}
	const bool operator<(Query& a) {
		if ((s >> SQ) != (a.s >> SQ)) return (s >> SQ) < (a.s >> SQ);
		return e > a.e;
	}
} QS[SZ];

struct Seg {
	ll T[SZ << 1];
	void Update(int i, ll v) {
		T[i += SZ - 1] += v;
		while (i >>= 1) T[i] = max(T[i * 2], T[i * 2 + 1]);
	}
} T;

void Add(int idx) {
	T.Update(S[idx], X[idx]);
}

void Sub(int idx) {
	T.Update(S[idx], -X[idx]);
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, Q;
	cin >> N >> Q;
	map<int, int> occur;
	for (int i = 1; i <= N; ++i) {
		cin >> X[i];
		if (occur.find(X[i]) == occur.end()) S[i] = occur[X[i]] = i;
		else S[i] = occur[X[i]];
	}
	for (int i = 0; i < Q; ++i) {
		int s, e;
		cin >> s >> e;
		QS[i] = Query(s, e, i);
	}
	sort(QS, QS + Q);

	int L = 1, R = 0;
	for (int d = 0; d < Q; ++d) {
		auto [s, e, id] = QS[d];
		while (R < e) Add(++R);
		while (s < L) Add(--L);
		while (e < R) Sub(R--);
		while (L < s) Sub(L++);
		ans[id] = T.T[1];
	}

	for (int i = 0; i < Q; ++i) cout << ans[i] << '\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6612 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6616 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6612 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6616 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6632 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 8 ms 6492 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 24 ms 6720 KB Output is correct
22 Correct 23 ms 6748 KB Output is correct
23 Correct 30 ms 6488 KB Output is correct
24 Correct 28 ms 6744 KB Output is correct
25 Correct 22 ms 6748 KB Output is correct
26 Correct 22 ms 6792 KB Output is correct
27 Correct 22 ms 6748 KB Output is correct
28 Correct 22 ms 6796 KB Output is correct
29 Correct 23 ms 7000 KB Output is correct
30 Correct 22 ms 6796 KB Output is correct
31 Correct 28 ms 6632 KB Output is correct
32 Correct 39 ms 6728 KB Output is correct
33 Correct 22 ms 6748 KB Output is correct
34 Correct 22 ms 6828 KB Output is correct
35 Correct 23 ms 6744 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6676 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6716 KB Output is correct
8 Correct 6 ms 6748 KB Output is correct
9 Correct 10 ms 7260 KB Output is correct
10 Correct 18 ms 6748 KB Output is correct
11 Correct 74 ms 8824 KB Output is correct
12 Correct 23 ms 7516 KB Output is correct
13 Correct 51 ms 8308 KB Output is correct
14 Correct 71 ms 10576 KB Output is correct
15 Correct 89 ms 12784 KB Output is correct
16 Correct 69 ms 13488 KB Output is correct
17 Correct 31 ms 7512 KB Output is correct
18 Correct 45 ms 9044 KB Output is correct
19 Correct 82 ms 14164 KB Output is correct
20 Correct 42 ms 12624 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6612 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6616 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6632 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 8 ms 6492 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 24 ms 6720 KB Output is correct
22 Correct 23 ms 6748 KB Output is correct
23 Correct 30 ms 6488 KB Output is correct
24 Correct 28 ms 6744 KB Output is correct
25 Correct 22 ms 6748 KB Output is correct
26 Correct 22 ms 6792 KB Output is correct
27 Correct 22 ms 6748 KB Output is correct
28 Correct 22 ms 6796 KB Output is correct
29 Correct 23 ms 7000 KB Output is correct
30 Correct 22 ms 6796 KB Output is correct
31 Correct 28 ms 6632 KB Output is correct
32 Correct 39 ms 6728 KB Output is correct
33 Correct 22 ms 6748 KB Output is correct
34 Correct 22 ms 6828 KB Output is correct
35 Correct 23 ms 6744 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6676 KB Output is correct
41 Correct 3 ms 6492 KB Output is correct
42 Correct 3 ms 6716 KB Output is correct
43 Correct 6 ms 6748 KB Output is correct
44 Correct 10 ms 7260 KB Output is correct
45 Correct 18 ms 6748 KB Output is correct
46 Correct 74 ms 8824 KB Output is correct
47 Correct 23 ms 7516 KB Output is correct
48 Correct 51 ms 8308 KB Output is correct
49 Correct 71 ms 10576 KB Output is correct
50 Correct 89 ms 12784 KB Output is correct
51 Correct 69 ms 13488 KB Output is correct
52 Correct 31 ms 7512 KB Output is correct
53 Correct 45 ms 9044 KB Output is correct
54 Correct 82 ms 14164 KB Output is correct
55 Correct 42 ms 12624 KB Output is correct
56 Correct 56 ms 6796 KB Output is correct
57 Correct 134 ms 7004 KB Output is correct
58 Correct 247 ms 7696 KB Output is correct
59 Correct 385 ms 8440 KB Output is correct
60 Correct 560 ms 8648 KB Output is correct
61 Correct 726 ms 8676 KB Output is correct
62 Correct 955 ms 8928 KB Output is correct
63 Correct 1661 ms 9416 KB Output is correct
64 Correct 2364 ms 9812 KB Output is correct
65 Correct 3318 ms 9484 KB Output is correct
66 Correct 2677 ms 9596 KB Output is correct
67 Correct 1911 ms 9808 KB Output is correct
68 Correct 1809 ms 10216 KB Output is correct
69 Correct 1891 ms 11504 KB Output is correct
70 Correct 1883 ms 12660 KB Output is correct
71 Correct 1963 ms 12068 KB Output is correct
72 Correct 1973 ms 11856 KB Output is correct
73 Correct 1975 ms 11676 KB Output is correct
74 Correct 1959 ms 11548 KB Output is correct
75 Correct 1934 ms 11428 KB Output is correct
76 Correct 1967 ms 11324 KB Output is correct
77 Correct 2008 ms 11252 KB Output is correct
78 Correct 1909 ms 11176 KB Output is correct
79 Correct 1905 ms 11112 KB Output is correct
80 Correct 3417 ms 10140 KB Output is correct