| Task: | Kyselyt |
| Sender: | jubidubi |
| Submission time: | 2025-10-19 19:31:34 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 60 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 10 |
| #2 | ACCEPTED | 20 |
| #3 | ACCEPTED | 30 |
| #4 | TIME LIMIT EXCEEDED | 0 |
| 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.47 s | 2, 3, 4 | details |
| #5 | ACCEPTED | 0.53 s | 2, 3, 4 | details |
| #6 | ACCEPTED | 0.55 s | 2, 3, 4 | details |
| #7 | ACCEPTED | 0.57 s | 3, 4 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #11 | ACCEPTED | 0.70 s | 3, 4 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #13 | ACCEPTED | 0.45 s | 3, 4 | details |
| #14 | ACCEPTED | 0.94 s | 4 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #16 | ACCEPTED | 0.93 s | 4 | details |
Code
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 202020;
set<pair<int, int>> s[N];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool check[N];
int numm[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
map<int, int> m;
map<int, int> rm;
{
int x = 1;
for (int i = 0; i < n; ++i) {
if (m[v[i]] == 0) {
rm[x] = v[i];
m[v[i]] = x++;
}
v[i] = m[v[i]];
}
}
for (int i = 0; i < n; ++i) s[v[i]].insert({i, s[v[i]].size()});
while (q--) {
int a, b;
cin >> a >> b;
--a;
--b;
vector<int> c;
for (int i = 0; i < 80; ++i) {
int j = a + (rng() % (b - a + 1));
++numm[v[j]];
if (!check[v[j]]) {
c.push_back(v[j]);
check[v[j]] = 1;
}
}
vector<pair<int, int>> c2;
for (int x : c) {
if (numm[x] > 10) c2.push_back({numm[x], x});
numm[x] = 0;
check[x] = 0;
}
sort(c2.rbegin(), c2.rend());
while (c2.size() > 2) c2.pop_back();
bool found = 0;
for (auto p : c2) {
int x = p.second;
auto it = s[x].lower_bound({a, 0});
auto it2 = s[x].lower_bound({b + 1, 0});
--it2;
int num = it2->second - it->second + 1;
if (num >= (b - a + 1) / 2 + 1) {
cout << rm[x] << endl;
found = 1;
}
}
if (!found) cout << "-1" << endl;
}
}
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: TIME LIMIT EXCEEDED
| 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 |
|---|
| (empty) |
Test 9
Group: 4
Verdict: TIME LIMIT EXCEEDED
| 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 |
|---|
| (empty) |
Test 10
Group: 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 200000 286470749 280175209 741317063 ... |
| correct output |
|---|
| -1 -1 -1 -1 -1 ... |
| user output |
|---|
| (empty) |
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: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 200000 613084013 1000000000 411999902... |
| correct output |
|---|
| 1000000000 1000000000 -1 1000000000 -1 ... |
| user output |
|---|
| (empty) |
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: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 200000 663307073 663307073 663307073 ... |
| correct output |
|---|
| 211070558 49212342 651109313 264549124 651109313 ... |
| user output |
|---|
| (empty) |
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 ... |
