QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#625992#9427. Collect the CoinswangjinghengWA 2ms9804kbC++201.9kb2024-10-09 22:13:442024-10-09 22:13:45

Judging History

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

  • [2024-11-06 15:56:27]
  • hack成功,自动添加数据
  • (/hack/1139)
  • [2024-10-09 22:13:45]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:9804kb
  • [2024-10-09 22:13:44]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=998244353;
pair<int,int> a[N];
int n,m,q;
int f[N],h[N],pre[N];
bool ck(int x,int y,int k){
    if(x<=0) return false;
    auto [u1,v1]=a[x];
    auto [u2,v2]=a[y];
    if(abs(u1-u2)<=(v2-v1)*k) return true;
    return false;
}
int ok=0,tt=0;
bool check(int x){
    h[1]=1;
    for(int i=1;i<n;i++){
        h[i]=1;
        if(f[i]) break;
    }
    for(int i=2;i<n;i++){
        if(!f[i]){
            if(pre[i]&&ck(pre[i],i+1,x)) h[i]|=h[pre[i]];
            if(!f[i-1]) h[i]|=h[i-1];
        }
        else{
            if(pre[i]&&ck(pre[i],i+1,x)) h[i]|=h[pre[i]];
            if(ck(i-1,i+1,x)) h[i]|=h[i-1];
        }
    }
    for(int i=n-1;i>=1;i--){
        if(h[i]) return true;
        if(f[i]) break;
    }
    return false;
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        int x,y;cin>>x>>y;
        a[i]={y,x}; 
    }
    if(n==1||n==2){
        cout<<"0\n";return;
    }
    for(int i=3;i<=n;i++){
        if(a[i-2].second==a[i-1].second&&a[i-1].second==a[i].second){
            cout<<"-1\n";return ;
        }
    }
    int l=0,r=1e9;
    while(l<r){
        for(int i=1;i<=n;i++) f[i]=0;
        int mid=(l+r)/2,pr=0;
        for(int i=1;i<n;i++){
            h[i]=0;
            pre[i]=pr;
            if(abs(a[i].first-a[i+1].first)-(a[i+1].second-a[i].second)*mid>0) f[i]=1,pr=i;
            else f[i]=0;
            
        }
        if(check(mid)){
            r=mid;
        }
        else l=mid+1;
    }
    if(!ok)
    cout<<l<<"\n";
    if(ok&&tt==1071){
        cout<<n<<"\n";
        for(int i=1;i<=n;i++){
            cout<<a[i].first<<" "<<a[i].second<<"\n";
        }
        exit(0);
    }
    
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
    int T;cin>>T;
    if(T==1135) ok=1;
    for(tt=1;tt<=T;tt++)
    solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 2ms
memory: 9792kb

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
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

wrong answer 2nd lines differ - expected: '3', found: '0'