QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#505976 | #6429. Let's Play Curling | naichakafei | WA | 267ms | 16032kb | C++20 | 1.4kb | 2024-08-05 14:22:13 | 2024-08-05 14:22:14 |
Judging History
answer
/*
/\_/\
(= ._.)
/ > \>
*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstdio>
#include <cmath>
#include <cassert>
#define int long long
#define double long double
using namespace std;
const int N = 1e5 + 10, M = 1e6 + 10, MOD = 1e9 + 7;
int a[N], b[N];
void solve() {
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];
map<pair<int, int>, int> mp;
for (int i = 1; i <= m; i++) {
mp[ {b[i], 1}]++;
}
for (int i = 1; i <= n; i++) {
if (mp[ {a[i], 1}] != 0) continue;
mp[ {a[i], 0}]++;
}
int ans = 0, res = 0;
for (auto i : mp) {
if (i.second == 0) continue;
//cout << i.first.first << ' ' << i.first.second << ' ' << i.second << '\n';
if (i.first.second == 0) {
res += i.second;
} else if (i.first.second == 1) {
ans = max(ans, res);
res = 0;
}
}
if (ans == 0) cout << "Impossible\n";
else cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TT = 1;
cin >> TT;
while (TT--) {
solve();
}
return 0;
}
/*
/\_/\
(= ._.)
/ > \>
3
2 2
2 3
1 4
6 5
1 2 3 5 7 7
1 3 3 4 10
1 1
7
7
*/
詳細信息
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: 267ms
memory: 16032kb
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'