QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#226598 | #6429. Let's Play Curling | kokomiisbest | WA | 213ms | 4404kb | C++14 | 840b | 2023-10-26 09:54:10 | 2023-10-26 09:54:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//\xb5÷\xd6\xcaǾ߱\xb8\xb6\xfe\xb7\xd6\xd0Եģ\xac\xb5\xab\xc8\xe7\xba\xcecheck\xa3\xbf
const int N=1e5+10;
int a[N],b[N];
int n,m;
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int j=1;j<=m;j++) cin>>b[j];
sort(a+1,a+1+n);
sort(b+1,b+1+m);
b[m+1]=1e9+10;
//\xbc\xc7¼ÿ\xb8\xf6b֮\xbc\xe4\xbcж\xe0\xc9ٸ\xf6a\xbc\xb4\xbfɣ\xa1\xa3\xa1\xa3\xa1
int ans=0;
int i=1,j=1;
while(j<=m+1){
int tmp=0;
while(a[i]<b[j]&&a[i]>b[j-1]){
// cout<<i<<endl;
i++;
tmp++;
}
j++;
if(a[i]==b[j-1]) i++;
ans=max(tmp,ans);
}
// if(i<=n){
// ans=max(ans,n-i+1);
// }
// cout<<(ans==0)?"Impossible":ans;
if(ans==0) cout<<"Impossible";
else cout<<ans;
cout<<"\n";
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
3 2 2 2 3 1 4 6 5 2 5 3 7 1 7 3 4 3 1 10 1 1 7 7
output:
2 3 Impossible
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 213ms
memory: 4404kb
input:
5553 12 19 8 8 11 18 12 9 15 38 6 32 30 30 17 28 33 2 37 20 11 38 36 18 18 30 20 33 13 31 33 37 8 12 6 7 12 14 2 19 2 17 7 4 20 1 13 7 18 23 22 1 16 8 7 5 2 4 2 4 5 8 12 13 16 6 6 5 16 11 5 7 5 13 3 8 3 11 6 9 11 13 8 11 17 19 944782509 244117333 140979583 661724696 617847780 321687699 418677763 725...
output:
1 3 4 3 4 8 11 4 2 4 5 5 4 1 12 2 2 Impossible 2 3 5 9 1 2 9 14 3 9 14 4 19 18 11 12 2 18 4 5 2 4 11 4 7 7 3 5 4 4 5 1 3 2 4 5 8 2 9 8 3 16 3 2 15 7 16 8 7 4 17 3 2 3 6 7 1 4 1 1 2 3 4 7 9 1 15 3 16 5 15 4 4 4 5 4 3 1 1 15 1 2 2 2 5 10 7 1 1 17 4 20 2 3 7 12 1 1 1 5 Impossible 4 4 3 2 4 5 20 17 5 4 ...
result:
wrong answer 12th lines differ - expected: '2', found: '5'