QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#208614 | #6429. Let's Play Curling | zzzyzzz | WA | 64ms | 6296kb | C++17 | 1.8kb | 2023-10-09 19:24:42 | 2023-10-09 19:24:42 |
Judging History
answer
#include<bits/stdc++.h>
#include<sstream>
#include<cassert>
#define fi first
#define se second
#define i128 __int128
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7,mod1=998244353;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
int a[N],b[N];
int get1(int x) {
int l=1,r=n;
while(l<r) {
int mid=l+r+1>>1;
if(a[mid]<x) l=mid;
else r=mid-1;
}
return l;
}
int get2(int x) {
int l=1,r=n;
while(l<r) {
int mid=l+r>>1;
if(a[mid]>x) r=mid;
else l=mid+1;
}
return l;
}
void solve() {
n=read(),m=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=m;i++) b[i]=read();
sort(a+1,a+1+n);
sort(b+1,b+1+m);
int res=0;
for(int i=2;i<=m;i++) {
if(b[i]==b[i-1]) continue;
res=max(res,get1(b[i])-get2(b[i-1])+1);
}
if(res==0) printf("Impossible\n");
else printf("%d\n",res);
}
int main() {
// init();
// stin();
// ios::sync_with_stdio(false);
scanf("%d",&T);
// T=1;
while(T--) hackT++,solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5924kb
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: 64ms
memory: 6296kb
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 1 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 1 3 4 Impossible 9 1 2 Impossible 16 5 1 4 3 4 3 4 3 1 1 3 3 2 2 2 5 2 7 1 1 2 4 Impossible 2 3 7...
result:
wrong answer 3rd lines differ - expected: '4', found: '1'