| Task: | Kyselyt |
| Sender: | jhuun |
| Submission time: | 2025-10-19 18:31:41 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 10 |
| #2 | ACCEPTED | 20 |
| #3 | ACCEPTED | 30 |
| #4 | ACCEPTED | 40 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3, 4 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2, 3, 4 | details |
| #3 | ACCEPTED | 0.01 s | 1, 3, 4 | details |
| #4 | ACCEPTED | 0.08 s | 2, 3, 4 | details |
| #5 | ACCEPTED | 0.10 s | 2, 3, 4 | details |
| #6 | ACCEPTED | 0.57 s | 2, 3, 4 | details |
| #7 | ACCEPTED | 0.29 s | 3, 4 | details |
| #8 | ACCEPTED | 0.16 s | 4 | details |
| #9 | ACCEPTED | 0.20 s | 4 | details |
| #10 | ACCEPTED | 0.68 s | 4 | details |
| #11 | ACCEPTED | 0.26 s | 3, 4 | details |
| #12 | ACCEPTED | 0.42 s | 4 | details |
| #13 | ACCEPTED | 0.07 s | 3, 4 | details |
| #14 | ACCEPTED | 0.14 s | 4 | details |
| #15 | ACCEPTED | 0.15 s | 4 | details |
| #16 | ACCEPTED | 0.14 s | 4 | details |
Code
#include <bits/stdc++.h>
constexpr auto N = 200000;
std::vector<int> X(N);
std::vector<int> XMB(N);
std::vector<std::vector<int>> F(N);
std::random_device rd;
std::mt19937 mt(rd());
int brute(int a, int b) {
const auto len = (b - a + 1);
std::map<int, int> map;
for (; a <= b; ++a) {
++map[X[a]];
}
auto max_x = 0;
auto max_c = 0;
for (const auto [x, c] : map) {
if (c > max_c) {
max_c = c;
max_x = x;
}
}
return max_c >= len / 2 + 1 ? XMB[max_x] : -1;
}
inline int count(const std::vector<int>& pc, int a, int b) {
return upper_bound(pc.begin(), pc.end(), b) - lower_bound(pc.begin(), pc.end(), a);
}
int solve(int a, int b) {
const auto req = (b - a + 1) / 2 + 1;
std::uniform_int_distribution<int> dist(a, b);
for (auto i = 0; i < 32; ++i) {
const auto x = X[dist(mt)];
if (count(F[x], a, b) >= req) {
return XMB[x];
}
}
return -1;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n, q;
std::cin >> n >> q;
std::unordered_map<int, int> XM;
XM.reserve(n);
for (int i = 0, mi = 0, x; i < n; ++i) {
std::cin >> x;
if (const auto it = XM.find(x); it == XM.end()) {
X[i] = mi;
XMB[mi] = x;
F[mi].push_back(i);
XM[x] = mi++;
} else {
X[i] = it->second;
F[it->second].push_back(i);
}
}
for (int i = 0; i < q; ++i) {
int a, b;
std::cin >> a >> b;
if (b - a <= 32) {
std::cout << brute(a - 1, b - 1) << '\n';
} else {
std::cout << solve(a - 1, b - 1) << '\n';
}
}
}
Test details
Test 1
Group: 1, 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
Test 2
Group: 1, 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100 100 2 1 2 2 1 2 2 2 1 2 2 1 1 1 1 ... |
| correct output |
|---|
| 2 1 1 2 1 ... |
| user output |
|---|
| 2 1 1 2 1 ... |
Test 3
Group: 1, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100 100 5 19 44 88 14 79 50 44 14 99 7... |
| correct output |
|---|
| -1 -1 -1 -1 -1 ... |
| user output |
|---|
| -1 -1 -1 -1 -1 ... |
Test 4
Group: 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
Test 5
Group: 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 1 1 1 2 1 2 1 1 2 1 1 1 1 2 2 ... |
| correct output |
|---|
| 1 1 2 1 1 ... |
| user output |
|---|
| 1 1 2 1 1 ... |
Test 6
Group: 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 8 2 6 1 10 4 9 7 8 10 4 2 8 2 ... |
| correct output |
|---|
| -1 -1 -1 -1 -1 ... |
| user output |
|---|
| -1 -1 -1 -1 -1 ... |
Test 7
Group: 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 141307 493258596 365539511 222... |
| correct output |
|---|
| -1 -1 -1 -1 -1 ... |
| user output |
|---|
| -1 -1 -1 -1 -1 ... |
Test 8
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
Test 9
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 1 2 2 2 1 2 2 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 10
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 286470749 280175209 741317063 ... |
| correct output |
|---|
| -1 -1 -1 -1 -1 ... |
| user output |
|---|
| -1 -1 -1 -1 -1 ... |
Test 11
Group: 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 613084013 1000000000 411999902... |
| correct output |
|---|
| -1 -1 -1 -1 1000000000 ... |
| user output |
|---|
| -1 -1 -1 -1 1000000000 ... |
Test 12
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 613084013 1000000000 411999902... |
| correct output |
|---|
| 1000000000 1000000000 -1 1000000000 -1 ... |
| user output |
|---|
| 1000000000 1000000000 -1 1000000000 -1 ... |
Test 13
Group: 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 663307073 663307073 663307073 ... |
| correct output |
|---|
| 329574367 965067805 768744535 691214891 21873594 ... |
| user output |
|---|
| 329574367 965067805 768744535 691214891 21873594 ... |
Test 14
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 663307073 663307073 663307073 ... |
| correct output |
|---|
| 107596959 249558965 679275202 760593154 725418770 ... |
| user output |
|---|
| 107596959 249558965 679275202 760593154 725418770 ... |
Test 15
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 663307073 663307073 663307073 ... |
| correct output |
|---|
| 211070558 49212342 651109313 264549124 651109313 ... |
| user output |
|---|
| 211070558 49212342 651109313 264549124 651109313 ... |
Test 16
Group: 4
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 2 2 2 1 2 1 1 2 2 1 1 1 1 2 1 ... |
| correct output |
|---|
| 1 2 1 1 1 ... |
| user output |
|---|
| 1 2 1 1 1 ... |
