QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#612623#6429. Let's Play Curlinglaing2122WA 98ms4912kbC++171.1kb2024-10-05 12:19:242024-10-05 12:19:28

Judging History

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

  • [2024-10-05 12:19:28]
  • 评测
  • 测评结果:WA
  • 用时:98ms
  • 内存:4912kb
  • [2024-10-05 12:19:24]
  • 提交

answer

#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<random>
#include<string>
#include<time.h>
#include<cstring>
#include<set>
#include<cmath>
#include<queue>
#define int long long
#define endl '\n'
#define F first
#define S second
#define sz size()
#define B begin()
#define pb push_back
#define D end()
#define pii pair<int,int> 
#define ln cout<<'\n'
using namespace std;
const int N=1e6+10;
const int P=1331;int n,q,m,k;
void solve()
{
int n,m;cin>>n>>m;
vector<int>a(n),b(m);
for(auto &c:a) cin>>c; 
for(auto &c:b) cin>>c;
sort(a.B,a.D);sort(b.B,b.D);
    if(a[0]>b[m-1]||a[n-1]<b[0])
    {
        cout<<n<<'\n';
        return ;
    }
int ans=0;
for(int i=0;i<m-1;i++)
{
    auto it=upper_bound(a.B,a.D,b[i])-a.B;
    auto is=lower_bound(a.B,a.D,b[i+1])-a.B;
    //cout<<is<<' '<<it<<'\n';
    int cnt=is-it;
    ans=max(ans,cnt);
}
if(ans==0)
{
    cout<<"Impossible"<<'\n';
    return ;
}
cout<<ans<<'\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tc=1;
    cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}

详细

Test #1:

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

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: 98ms
memory: 4912kb

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
1
Impossible
4
8
11
4
2
4
5
2
4
1
4
3
2
4
2
3
5
4
1
4
9
1
3
9
Impossible
2
1
1
5
1
2
Impossible
4
4
4
4
11
4
5
Impossible
3
5
4
4
5
Impossible
3
2
4
5
5
2
2
8
3
2
3
1
2
7
2
5
3
2
1
2
5
3
6
3
1
4
Impossible
1
Impossible
3
4
Impossible
9
1
2
Impossible
16
5
5
4
3
4
3
4
3
1
1
3
3
2
2
2
5
2
7
1
1
2
...

result:

wrong answer 3rd lines differ - expected: '4', found: '1'