oj.uz

Submission #789717

# Submission time Handle Problem Language Result Execution time Memory
789717 2023-07-21T20:22:54 Z IBory 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 13640 KB 
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int MAX = 100007, SQ = 8;
ll X[MAX], ans[MAX], cnt[MAX], S[MAX];
multiset<ll> cand;

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[MAX];

void Add(int idx) {
	if (cnt[S[idx]]) cand.erase(cand.find(X[idx] * cnt[S[idx]]));
	cand.insert(X[idx] * (++cnt[S[idx]]));
}

void Sub(int idx) {
	cand.erase(cand.find(X[idx] * cnt[S[idx]]));
	if (--cnt[S[idx]]) cand.insert(X[idx] * cnt[S[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 i = 0; i < Q; ++i) {
		auto [s, e, id] = QS[i];
		while (R < e) Add(++R);
		while (s < L) Add(--L);
		while (e < R) Sub(R--);
		while (L < s) Sub(L++);
		ans[id] = *cand.rbegin();
	}

	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 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1504 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1420 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1508 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1504 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1420 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1508 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 4 ms 1492 KB Output is correct
18 Correct 7 ms 1524 KB Output is correct
19 Correct 16 ms 1620 KB Output is correct
20 Correct 35 ms 1684 KB Output is correct
21 Correct 55 ms 1748 KB Output is correct
22 Correct 60 ms 1772 KB Output is correct
23 Correct 46 ms 1716 KB Output is correct
24 Correct 46 ms 1708 KB Output is correct
25 Correct 60 ms 1904 KB Output is correct
26 Correct 57 ms 1884 KB Output is correct
27 Correct 58 ms 1888 KB Output is correct
28 Correct 59 ms 1868 KB Output is correct
29 Correct 61 ms 1868 KB Output is correct
30 Correct 60 ms 1848 KB Output is correct
31 Correct 50 ms 1756 KB Output is correct
32 Correct 25 ms 1728 KB Output is correct
33 Correct 59 ms 1852 KB Output is correct
34 Correct 55 ms 1876 KB Output is correct
35 Correct 53 ms 1956 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 2 ms 1576 KB Output is correct
6 Correct 3 ms 1620 KB Output is correct
7 Correct 7 ms 1728 KB Output is correct
8 Correct 7 ms 2168 KB Output is correct
9 Correct 14 ms 2688 KB Output is correct
10 Correct 11 ms 2540 KB Output is correct
11 Correct 71 ms 5868 KB Output is correct
12 Correct 37 ms 4068 KB Output is correct
13 Correct 81 ms 5664 KB Output is correct
14 Correct 91 ms 8212 KB Output is correct
15 Correct 99 ms 10448 KB Output is correct
16 Correct 111 ms 13340 KB Output is correct
17 Correct 40 ms 4044 KB Output is correct
18 Correct 71 ms 5964 KB Output is correct
19 Correct 82 ms 12780 KB Output is correct
20 Correct 55 ms 13640 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1504 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1420 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1508 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 4 ms 1492 KB Output is correct
18 Correct 7 ms 1524 KB Output is correct
19 Correct 16 ms 1620 KB Output is correct
20 Correct 35 ms 1684 KB Output is correct
21 Correct 55 ms 1748 KB Output is correct
22 Correct 60 ms 1772 KB Output is correct
23 Correct 46 ms 1716 KB Output is correct
24 Correct 46 ms 1708 KB Output is correct
25 Correct 60 ms 1904 KB Output is correct
26 Correct 57 ms 1884 KB Output is correct
27 Correct 58 ms 1888 KB Output is correct
28 Correct 59 ms 1868 KB Output is correct
29 Correct 61 ms 1868 KB Output is correct
30 Correct 60 ms 1848 KB Output is correct
31 Correct 50 ms 1756 KB Output is correct
32 Correct 25 ms 1728 KB Output is correct
33 Correct 59 ms 1852 KB Output is correct
34 Correct 55 ms 1876 KB Output is correct
35 Correct 53 ms 1956 KB Output is correct
36 Correct 1 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 2 ms 1576 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 7 ms 1728 KB Output is correct
43 Correct 7 ms 2168 KB Output is correct
44 Correct 14 ms 2688 KB Output is correct
45 Correct 11 ms 2540 KB Output is correct
46 Correct 71 ms 5868 KB Output is correct
47 Correct 37 ms 4068 KB Output is correct
48 Correct 81 ms 5664 KB Output is correct
49 Correct 91 ms 8212 KB Output is correct
50 Correct 99 ms 10448 KB Output is correct
51 Correct 111 ms 13340 KB Output is correct
52 Correct 40 ms 4044 KB Output is correct
53 Correct 71 ms 5964 KB Output is correct
54 Correct 82 ms 12780 KB Output is correct
55 Correct 55 ms 13640 KB Output is correct
56 Correct 116 ms 2024 KB Output is correct
57 Correct 412 ms 2672 KB Output is correct
58 Correct 914 ms 3788 KB Output is correct
59 Correct 1694 ms 4900 KB Output is correct
60 Correct 2592 ms 5964 KB Output is correct
61 Correct 3163 ms 5804 KB Output is correct
62 Correct 2954 ms 5696 KB Output is correct
63 Correct 2535 ms 6220 KB Output is correct
64 Correct 2143 ms 6760 KB Output is correct
65 Correct 1471 ms 6624 KB Output is correct
66 Correct 3019 ms 6764 KB Output is correct
67 Execution timed out 4043 ms 6024 KB Time limit exceeded
68 Halted 0 ms 0 KB -