CSES - Leirikisa 6.3.2017 - Results
Submission details
Task:Lista
Sender:Senpai
Submission time:2017-03-06 17:30:08 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED25
#2ACCEPTED75
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.03 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.04 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.10 s2details
#13ACCEPTED0.10 s2details
#14ACCEPTED0.11 s2details
#15ACCEPTED0.14 s2details
#16ACCEPTED0.14 s2details
#17ACCEPTED0.11 s2details
#18ACCEPTED0.12 s2details
#19ACCEPTED0.11 s2details
#20ACCEPTED0.12 s2details

Code

# include <bits/stdc++.h>

using namespace std;
vector <pair<int,int>> v;
unordered_set <int> s;
int n,x,e,minimi,d,c,maksimi;
int main(){
cin>>n;
minimi=100000;
for(int i=1; i<=n; i++){
cin>>x;
c=s.count(x);
maksimi=max(c,maksimi);
s.insert(x);
v.push_back({x,i});
}

if(maksimi==0)cout<<n-1;
else{
sort(v.begin(),v.end());
d=v[0].second;
for(int i=0; i<n-1; i++){
if(v[i].first!=v[i+1].first){
d=v[i+1].second;
continue;}
else{
e=n-v[i+1].second+d-1;
minimi=min(e,minimi);
}
}
cout<<minimi;
}
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
0

user output
0

Test 2

Group: 1

Verdict: ACCEPTED

input
100
100 100 100 100 100 100 100 10...

correct output
0

user output
0

Test 3

Group: 1

Verdict: ACCEPTED

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
99

user output
99

Test 4

Group: 1

Verdict: ACCEPTED

input
100
87 26 53 26 74 50 42 59 36 97 ...

correct output
7

user output
7

Test 5

Group: 1

Verdict: ACCEPTED

input
100
8 13 46 3 85 40 62 70 14 29 88...

correct output
2

user output
2

Test 6

Group: 1

Verdict: ACCEPTED

input
100
33 30 73 66 8 42 68 41 56 26 3...

correct output
6

user output
6

Test 7

Group: 1

Verdict: ACCEPTED

input
100
16 41 11 93 19 59 1 35 1 79 45...

correct output
18

user output
18

Test 8

Group: 1

Verdict: ACCEPTED

input
100
32 5 78 9 53 6 23 99 98 38 29 ...

correct output
11

user output
11

Test 9

Group: 1

Verdict: ACCEPTED

input
100
70 43 99 91 87 5 26 33 3 97 60...

correct output
11

user output
11

Test 10

Group: 1

Verdict: ACCEPTED

input
100
80 15 67 8 19 2 47 2 51 79 34 ...

correct output
23

user output
23

Test 11

Group: 2

Verdict: ACCEPTED

input
100000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
0

user output
0

Test 12

Group: 2

Verdict: ACCEPTED

input
100000
1000000000 1000000000 10000000...

correct output
0

user output
0

Test 13

Group: 2

Verdict: ACCEPTED

input
100000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
99999

user output
99999

Test 14

Group: 2

Verdict: ACCEPTED

input
100000
368557660 202067774 869767532 ...

correct output
45422

user output
45422

Test 15

Group: 2

Verdict: ACCEPTED

input
100000
279796163 249838695 918802148 ...

correct output
58055

user output
58055

Test 16

Group: 2

Verdict: ACCEPTED

input
100000
652215128 684591779 146182625 ...

correct output
30508

user output
30508

Test 17

Group: 2

Verdict: ACCEPTED

input
100000
912992845 719581379 126326667 ...

correct output
54978

user output
54978

Test 18

Group: 2

Verdict: ACCEPTED

input
100000
974161548 952419593 431337025 ...

correct output
1637

user output
1637

Test 19

Group: 2

Verdict: ACCEPTED

input
100000
912344935 691159511 836812179 ...

correct output
57759

user output
57759

Test 20

Group: 2

Verdict: ACCEPTED

input
100000
752551555 857180406 698838947 ...

correct output
18067

user output
18067