QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#505967 | #6429. Let's Play Curling | pagohia | TL | 1ms | 5120kb | C++14 | 1.4kb | 2024-08-05 14:15:29 | 2024-08-05 14:15:30 |
Judging History
answer
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define MAXN ((int) 2e5)
const int N = 1e5 + 10;
const int M = 5e4 + 10;
typedef long long ll;
typedef double db;
typedef pair<int, int>pii;
typedef pair<long, long>pll;
int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int mod = 1e9 + 7;
inline long long read()
{
long long w = 1;
long long q = 0;
char ch = ' ';
while (ch != '-' && (ch < '0' || ch>'9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9')
q = q * 10 + ch - '0', ch = getchar();
return w * q;
}
int n, m;
long long arr[N];
long long brr[N];
void solve()
{
cin >> n >> m;
memset(arr, 0, sizeof(arr));
memset(brr, 0, sizeof(brr));
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = 1; i <= m; i++)
{
cin >> brr[i];
}
sort(arr + 1, arr + n + 1);
sort(brr + 1, brr + m + 1);
int ans = 0;
long long flag = 0;
for (int i = 1; i <= n; i++)
{
if (arr[i] == arr[i - 1]) continue;
for (int j = 1; j <= m; j++)
{
if (brr[j - 1] < arr[i] && brr[j] > arr[i])
{
ans++;
break;
}
}
}
if (ans == 0)cout << "Impossible" << endl;
else cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tcase = 1;
cin >> tcase;
while (tcase--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5120kb
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:
5 8 4 2 17 13 10 10 3 7 10 5 9 2 6 5 10 4 6 12 5 7 4 9 16 1 5 9 2 3 1 1 5 10 7 Impossible 13 16 5 9 13 20 10 6 5 18 8 8 10 1 10 11 17 19 6 3 8 14 19 3 12 2 1 16 2 10 10 6 3 6 12 3 7 6 2 5 1 3 1 1 7 7 11 2 2 3 16 16 4 5 8 14 12 14 5 5 2 4 6 9 3 6 16 4 19 2 1 3 16 Impossible 11 15 19 5 1 2 4 9 5 10 1 ...