QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#624302#6429. Let's Play CurlingAcetaminophenTL 0ms3644kbC++231.6kb2024-10-09 15:29:262024-10-09 15:29:26

Judging History

你现在查看的是最新测评结果

  • [2024-10-09 15:29:26]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:3644kb
  • [2024-10-09 15:29:26]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N],b[N];
int main(){
	// std::ios::sync_with_stdio(false);
	// std::cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        for(int i=1;i<=m;i++){
            cin>>b[i];
        }
        sort(a+1,a+n+1);
        sort(b+1,b+m+1);
        int j = 1;
        int ans = 0;
        int tmp = 0;
        for(int i=1;i<=n;){
            // cout<<tmp<<endl;
            // cout<<a[i]<<b[j]<<endl;
            if(j+1>m){
                break;
            }
            else{
                if(a[i]>b[j]&&a[i]<b[j+1]){
                    tmp++;
                    ans=max(ans,tmp);
                    i++;
                }
                else if(a[i]==b[j]){
                    i++;
                    continue;
                }
                else if(a[i]>b[j+1]){
                    ans=max(ans,tmp);
                    tmp = 0;
                    j++;
                    while(b[j]==b[j-1]){
                        j++;
                    }
                }
                else if(a[i]==b[j+1]){
                    j++;
                     while(b[j-1]==b[j]){
                        j++;
                    }
                    continue;
                }
            }
        }
        if(ans==0){
            cout<<"Impossible";
        }
        else{
            cout<<ans;
        }
        if(t){
            cout<<endl;
        }
    }

}
/*
3
2 2
2 3
1 4
6 5
2 5 3 7 1 7
3 4 3 1 10
1 1
7
7
*/

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3644kb

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
Time Limit Exceeded

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:

3
6

result: