ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#212045 | #3816. 元素 | OS_AC | 0 | 69ms | 1212kb | C++ | 910b | 2024-10-13 10:38:24 | 2024-10-13 12:16:51 |
answer
#include<bits/stdc++.h>
using namespace std;
void cleancin_n(){
cin.ignore(numeric_limits<streamsize>::max(),'\n');
}
int a[1000001];
int check(int L,int R,int x,int y){
bool mp[10001]={0};
for(int i=L;i<=R;i++){
mp[a[i]]=true;
}
for(int i=x;i<=y;i++){
mp[a[i]]=false;
}
for(int i=1;i<=10001;i++){
if(mp[i]==true){
return false;
}
}
return true;
}
int getans(int L,int R){
int minn=INT_MAX-1;
for(int x=L;x<=R;x++){
for(int y=x;y<=R;y++){
cout<<x<<" "<<y<<endl;
if(check(L,R,x,y)){
minn=min(minn,y-x+1);
cout<<minn<<endl;
}
}
}
return (minn==INT_MAX-1)?-1:minn;
}
int l[10001],r[10001];
signed main(){
int n,q;
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=q;i++){
cin>>l[i]>>r[i];
}
for(int i=1;i<=q;i++){
cout<<l[i]<<" "<<r[i]<<endl;
cout<<getans(l[i],r[i])<<endl;
}
return 0;
}
Details
小提示:点击横条可展开更详细的信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 1208kb
input:
10 10 492 1887 1028 1209 252 1860 1527 699 1656 928 6 9 2 8 3 10 2 3 1 8 6 9 3 5 4 7 1 4 2 7
output:
6 9 6 6 6 7 6 8 6 9 7 7 7 8 7 9 8 8 8 9 9 9 -1 2 8 2 2 2 3 2 4 2 5 2 6 2 7 2 8 3 3 3 4 3 5 3 6 3 7 3...
result:
wrong answer 1st numbers differ - expected: '4', found: '6'
Test #2:
score: 0
Wrong Answer
time: 14ms
memory: 1208kb
input:
50 50 413 1208 1780 279 1403 1706 11 1583 333 355 1068 1270 1835 1042 957 423 1140 1153 1709 284 281...
output:
35 44 35 35 35 36 35 37 35 38 35 39 35 40 35 41 35 42 35 43 35 44 36 36 36 37 36 38 36 39 36 40 36 4...
result:
wrong answer 1st numbers differ - expected: '10', found: '35'
Test #3:
score: 0
Wrong Answer
time: 20ms
memory: 1208kb
input:
50 50 407 1089 1459 1626 1917 555 1611 492 443 1149 406 1259 1729 1554 577 1310 1899 1578 1005 1459 ...
output:
2 33 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 2...
result:
wrong answer 1st numbers differ - expected: '32', found: '2'
Test #4:
score: 0
Wrong Answer
time: 18ms
memory: 1212kb
input:
50 50 1792 843 1272 547 698 1086 1174 1607 1277 1055 506 881 1445 372 1076 1770 647 1086 320 1912 18...
output:
12 45 12 12 12 13 12 14 12 15 12 16 12 17 12 18 12 19 12 20 12 21 12 22 12 23 12 24 12 25 12 26 12 2...
result:
wrong answer 1st numbers differ - expected: '34', found: '12'
Test #5:
score: 0
Wrong Answer
time: 9ms
memory: 1212kb
input:
50 50 44 1463 245 1177 1728 1335 768 475 790 623 1466 98 672 230 339 1428 872 1905 405 1260 1503 813...
output:
14 32 14 14 14 15 14 16 14 17 14 18 14 19 14 20 14 21 14 22 14 23 14 24 14 25 14 26 14 27 14 28 14 2...
result:
wrong answer 1st numbers differ - expected: '19', found: '14'
Test #6:
score: 0
Wrong Answer
time: 7ms
memory: 1208kb
input:
50 50 695 974 1078 231 500 498 1308 1666 1925 766 1994 1776 1955 1766 1191 1021 1581 1202 615 1230 1...
output:
29 39 29 29 29 30 29 31 29 32 29 33 29 34 29 35 29 36 29 37 29 38 29 39 30 30 30 31 30 32 30 33 30 3...
result:
wrong answer 1st numbers differ - expected: '11', found: '29'
Test #7:
score: 0
Time Limit Exceeded
input:
200 200 403 329 389 1103 695 1865 818 671 750 1868 1422 422 1186 1431 172 1569 460 1580 406 1049 138...
output:
46 176 46 46 46 47 46 48 46 49 46 50 46 51 46 52 46 53 46 54 46 55 46 56 46 57 46 58 46 59 46 60 46 ...
result:
Test #8:
score: 0
Time Limit Exceeded
input:
200 200 147 1386 1788 1493 1919 1136 861 871 1895 1006 1776 346 381 1666 296 289 568 1616 1535 531 2...
output:
82 184 82 82 82 83 82 84 82 85 82 86 82 87 82 88 82 89 82 90 82 91 82 92 82 93 82 94 82 95 82 96 82 ...
result:
Test #9:
score: 0
Time Limit Exceeded
input:
2000 2000 1154 852 1088 1530 639 1318 1250 1222 1341 1070 205 656 903 1491 808 317 756 1962 102 1445...
output:
251 1080 251 251 251 252 251 253 251 254 251 255 251 256 251 257 251 258 251 259 251 260 251 261 251...
result:
Test #10:
score: 0
Time Limit Exceeded
input:
2000 2000 1232 731 1651 991 1681 1739 776 240 829 1337 493 248 214 1852 716 325 1280 1207 380 724 11...
output:
587 1653 587 587 587 588 587 589 587 590 587 591 587 592 587 593 587 594 587 595 587 596 587 597 587...