Submission details
Task:Kyselyt
Sender:tykkipeli
Submission time:2025-10-17 19:43:02 +0300
Language:C++ (C++20)
Status:READY
Result:60
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#3ACCEPTED30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3, 4details
#2ACCEPTED0.00 s1, 2, 3, 4details
#3ACCEPTED0.00 s1, 3, 4details
#4ACCEPTED0.20 s2, 3, 4details
#5ACCEPTED0.26 s2, 3, 4details
#6ACCEPTED0.23 s2, 3, 4details
#7ACCEPTED0.13 s3, 4details
#8ACCEPTED0.45 s4details
#9ACCEPTED0.42 s4details
#10ACCEPTED0.27 s4details
#11ACCEPTED0.26 s3, 4details
#120.53 s4details
#13ACCEPTED0.08 s3, 4details
#14ACCEPTED0.16 s4details
#15ACCEPTED0.86 s4details
#16ACCEPTED0.37 s4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;


int N = 700;
int x[200002];
map<int,int> m;
int mrev[200002]; 
int cnts[200002];
vector<int> commons;
int pref[200002][580];


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n,q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> x[i];
    vector<int> v;
    for (int i = 1; i <= n; i++) v.push_back(x[i]);
    sort(v.begin(), v.end());
    int k = 0;
    for (int i = 0; i < v.size(); i++) {
        if (i == 0 || v[i] != v[i-1]) {
            k++;
            mrev[k] = v[i];
            m[v[i]] = k;
        }
    }
    for (int i = 1; i <= n; i++) x[i] = m[x[i]];
    for (int i = 1; i <= n; i++)  cnts[x[i]]++;
    for (int i = 1; i <= 200000; i++) {
        if (cnts[i] >= N/2) commons.push_back(i);
    }

    for (int a : commons) {
        for (int i = 1; i <= n; i++) {
            pref[i][a] = pref[i-1][a];
            if (x[i] == a) pref[i][a]++;
        }
    }

    for (int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b;
        int cmn = 0;
        int cmncnt = 0;
        if (b-a+1 <= N) {
            for (int j = a; j <= b; j++) cnts[x[j]] = 0;
            for (int j = a; j <= b; j++) {
                cnts[x[j]]++;
                if (cnts[x[j]] > cmncnt) {
                    cmncnt = cnts[x[j]];
                    cmn = x[j];
                }
            }
        } else {
            for (int z : commons) {
                int cntt = pref[b][z] - pref[a-1][z];
                if (cntt > cmncnt) {
                    cmncnt = cntt;
                    cmn = z;
                }
            }
        }
        if (2*cmncnt > b-a+1) {
            cout << mrev[cmn] << "\n";
        } else {
            cout << -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:

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
...