QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#656841#6429. Let's Play CurlingLmR308WA 82ms5664kbC++171.2kb2024-10-19 13:46:112024-10-19 13:46:16

Judging History

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

  • [2024-10-19 13:46:16]
  • 评测
  • 测评结果:WA
  • 用时:82ms
  • 内存:5664kb
  • [2024-10-19 13:46:11]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int128 __int128_t
#define int long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fi first    
#define se second
#define lowbit(x) x & -x
#define all(x) x.begin(), x.end()
#define INF 0x3f3f3f3f3f3f3f3f
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define ull unsigned long long
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e6 + 10, M = 5e6 + 10, mod = 998244353;
const double eps = 1e-8;

int t, n, m, k;	
string sr;

void solve() {
	cin >> n >> m;
	vector<int> a(n), b(m);
	for (auto &x : a) cin >> x;
	for (auto &x : b) cin >> x;
	int res = 0, pos = 0, sum = 0;
	b.push_back(-INF), b.push_back(INF);
	sort(all(a)), sort(all(b));
	for (int i = 1; i <= m; i++) {
		while (pos < n && a[pos] < b[i]) {
			sum++;
			pos++;
		}
		res = max(res, sum);
		sum = 0;
		while (pos < n && a[pos] == b[i]) pos++;
	}
	if (res == 0) cout << "Impossible\n";
	else cout << res << "\n";
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	//cout.setf(ios::fixed), cout.precision(8);
	t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}	

詳細信息

Test #1:

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

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: 82ms
memory: 5664kb

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

result:

wrong answer 15th lines differ - expected: '11', found: '4'