QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#624640 | #9427. Collect the Coins | Idtwtei# | WA | 15ms | 5928kb | C++14 | 875b | 2024-10-09 16:18:00 | 2024-10-09 16:18:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+100,INF=1e9;
#define gc getchar()
#define rd read()
inline int read(){
int x=0,f=0; char c=gc;
for(;c<'0'||c>'9';c=gc) f|=(c=='-');
for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
return f?-x:x;
}
int n,t[N],x[N];
int chk(int v){
int p=x[1],l=-INF,r=INF;
for(int i=2,dt,l0,r0;i<=n;++i){
dt=(t[i]-t[i-1])*v,l0=INF,r0=-INF;
if(p-dt<=x[i]&&x[i]<=p+dt) l0=min(l0,l-dt),r0=max(r0,r+dt);
if(l-dt<=x[i]&&x[i]<=r+dt) l0=min(l0,p-dt),r0=max(r0,p+dt);
p=x[i],l=l0,r=r0;
}
return l<=r;
}
void solve(){
n=rd; for(int i=1;i<=n;++i) t[i]=rd,x[i]=rd;
int l=0,r=INF;
while(l<r){
int mid=l+r>>1;
if(chk(mid)) r=mid;
else l=mid+1;
}
printf("%lld\n", l==INF?-1:l);
}
signed main(){
int T=rd;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5812kb
input:
3 5 1 1 3 7 3 4 4 3 5 10 1 10 100 3 10 100 10 1000 10 10000
output:
2 0 -1
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 15ms
memory: 5928kb
input:
1135 2 6 5 8 8 8 2 9 2 10 4 4 5 3 6 2 6 8 8 2 8 7 1 9 1 6 4 6 6 1 6 2 9 10 10 1 10 7 5 1 6 2 5 6 7 8 6 10 3 8 1 10 5 4 5 7 6 1 6 6 8 4 9 1 9 4 8 1 1 1 3 2 9 3 3 5 9 6 10 9 7 10 7 3 5 8 6 6 10 6 7 2 9 4 7 5 10 6 3 6 7 8 9 10 1 6 1 4 2 8 5 9 7 10 9 1 10 5 9 2 7 4 5 5 9 6 10 7 4 9 4 9 9 10 3 10 7 1 3 1...
output:
0 3 0 3 1 3 6 0 3 2 2 0 2 5 0 1 5 1 2 0 0 0 1 4 2 0 2 1 3 0 3 2 3 2 5 3 1 1 0 1 1 1 0 2 0 1 0 1 0 2 1 0 2 3 4 4 1 1 1 0 1 3 0 1 4 4 3 0 0 2 2 6 4 2 1 0 0 1 0 2 1 2 0 1 1 3 0 0 1 2 0 3 0 2 2 2 1 0 0 0 5 1 2 0 6 1 1 1 2 2 2 0 3 1 4 3 6 0 8 1 1 3 0 2 2 4 1 1 0 0 0 7 2 2 1 0 0 3 1 2 1 1 2 5 3 0 3 3 3 5 ...
result:
wrong answer 401st lines differ - expected: '10', found: '3'