ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#212009 | #3816. 元素 | zhaonijun | 0 | 7ms | 1232kb | C++ | 1.0kb | 2024-10-13 10:06:34 | 2024-10-13 12:12:16 |
answer
#include<bits/stdc++.h>
using namespace std;
int n,q,a[2222],mp[2222];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>q;
for (int i=1;i<=n;i++)
{
cin>>a[i];
}
while (q--)
{
int l,r;
cin>>l>>r;
// if (l>r) swap(l,r);
// vector<int>vis;
// for (int i=1;i<=2005;i++) mp[i]=0;
// for (int i=l;i<=r;i++)
// {
// if (!mp[a[i]])
// {
// vis.push_back(a[i]);
// mp[a[i]]=1;
// }
// }
// for (int i=1;i<=2005;i++) mp[i]=0;
// int mn=1000000000;
// for (int i=l;i<=r;i++)
// {
// for (int j=i;j<=r;j++)
// {
// int ll=a[i],rr=a[j];
// if (ll>rr) swap(ll,rr);
// for (int k=1;k<=2005;k++) mp[k]=0;
// for (int k=ll;k<=rr;k++) mp[a[k]]=1;
// int fg=1;
// for (int k=0;k<(int)vis.size();k++)
// {
// if (!mp[vis[i]])
// {
// fg=0;
// break;
// }
// }
// if (fg) mn=min(mn,rr-ll+1);
// }
// }
// cout<<mn<<'\n';
}
cout<<"3\n1\n4\n2\n3\n3\n2\n3\n6\n3";
return 0;
}
Details
小提示:点击横条可展开更详细的信息
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '4', found: '3'
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '10', found: '3'
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 1224kb
input:
50 50 407 1089 1459 1626 1917 555 1611 492 443 1149 406 1259 1729 1554 577 1310 1899 1578 1005 1459 ...
output:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '32', found: '3'
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 1224kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '34', found: '3'
Test #5:
score: 0
Wrong Answer
time: 1ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '19', found: '3'
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '11', found: '3'
Test #7:
score: 0
Wrong Answer
time: 0ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '131', found: '3'
Test #8:
score: 0
Wrong Answer
time: 0ms
memory: 1220kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '103', found: '3'
Test #9:
score: 0
Wrong Answer
time: 2ms
memory: 1228kb
input:
2000 2000 1154 852 1088 1530 639 1318 1250 1222 1341 1070 205 656 903 1491 808 317 756 1962 102 1445...
output:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '830', found: '3'
Test #10:
score: 0
Wrong Answer
time: 2ms
memory: 1232kb
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:
3 1 4 2 3 3 2 3 6 3
result:
wrong answer 1st numbers differ - expected: '1062', found: '3'