QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#268538#6429. Let's Play Curlingyujie3WA 99ms4896kbC++20705b2023-11-28 18:17:252023-11-28 18:17:26

Judging History

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

  • [2023-11-28 18:17:26]
  • 评测
  • 测评结果:WA
  • 用时:99ms
  • 内存:4896kb
  • [2023-11-28 18:17:25]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 1e5 + 7;
int n,m,k;
int a[N],b[N];

void solve(){
	cin >> n >> m;
	for(int i = 1;i <= n;i ++) cin >> a[i];
	for(int i = 1;i <= m;i ++) cin >> b[i];
	b[0] = 0,b[m + 1] = 1e9;
	sort(a,a + n),sort(b,b + m);
	int ans = 0;
	for(int i = 0;i <= m;i ++){
		int l = upper_bound(a + 1,a + 1 + n,b[i]) - a;
		int r = lower_bound(a + 1,a + 1 + n,b[i + 1]) - a - 1;
		ans = max(ans,r - l + 1);
	} if(ans) cout << ans << endl;
	else cout << "Impossible" << endl;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	int _; cin >> _;
	while(_ --){
		solve();
	} return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3360kb

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: 99ms
memory: 4896kb

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:

9
4
4
2
8
8
16
17
3
10
11
2
9
1
17
4
3
13
2
8
6
4
2
9
8
1
4
10
2
3
1
5
4
12
2
5
9
5
10
4
11
9
9
7
11
6
4
5
8
3
6
10
19
15
4
5
5
15
12
8
3
3
5
6
5
9
7
8
3
3
16
2
5
8
2
7
4
3
2
3
4
6
9
2
2
3
19
16
5
5
10
5
5
4
4
3
8
3
13
3
3
3
10
4
7
2
1
2
4
7
3
4
13
13
1
1
3
5
7
10
1
3
5
13
13
2
3
14
4
9
10
6
10
11
2...

result:

wrong answer 1st lines differ - expected: '1', found: '9'