Submission #1005942

# Submission time Handle Problem Language Result Execution time Memory
1005942 2024-06-23T08:36:18 Z vjudge1 Gap (APIO16_gap) C++17
30 / 100
43 ms 2272 KB
#include<bits/stdc++.h>
#include "gap.h"
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int mxn=3e5+5;
/*multiset<ll>ms;
void MinMax(ll x,ll y,ll &x1,ll &y1){
    x1=*ms.lower_bound(x);
    y1=*prev(ms.upper_bound(y));
}*/
ll sol1(int n){
    ll mn=0,mx=1e18;
    int l=1,r=n;
    ll a[n+1];
    while(l<=r){
        ll s,t;
        MinMax(mn,mx,&s,&t);
        a[l++]=s;a[r--]=t;
        mn=s+1,mx=t-1;
    }ll ans=0;
    for(int i=2;i<=n;i++)ans=max(ans,a[i]-a[i-1]);
    return ans;
}
ll sol2(int n){
    ll mn=0,mx=1e18;
    ll s,t;MinMax(mn,mx,&s,&t);
    ll add = (t-s)/(n-1);
    ll ans=add;ll cs=s;
    while(s<t){
        ll cmn=cs,cmx=cs;
        ll tt=2;
        while(1){
            ll cl=cmn,cr=cmx;
            if(s+(tt-1)*add>t)break;
            MinMax(s+(tt-1)*add,s+tt*add,&cl,&cr);
            if(cl==-1&&cr==-1){tt++;continue;}
            cmn=cl,cmx=cr;break;
        }
        ans=max(ans,cmx-cmn);
        ans=max(ans,cmn-cs);
        s+=(tt)*add;cs=cmx;
    }return ans;
}
long long findGap(int T, int N){
    if(T==1)return sol1(N);
    else return sol2(N);
}
/*int main(){
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        int x;cin>>x;ms.insert(x);
    }for(auto it : ms)cout<<it<<' ';cout<<'\n';
    cout<<findGap(2,n);
}*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 9 ms 600 KB Output is correct
17 Correct 6 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 7 ms 620 KB Output is correct
21 Correct 26 ms 1880 KB Output is correct
22 Correct 30 ms 1880 KB Output is correct
23 Correct 36 ms 2220 KB Output is correct
24 Correct 43 ms 1872 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 34 ms 1872 KB Output is correct
27 Correct 30 ms 1876 KB Output is correct
28 Correct 35 ms 1880 KB Output is correct
29 Correct 23 ms 2272 KB Output is correct
30 Correct 26 ms 1888 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 1 ms 352 KB Output isn't correct
4 Incorrect 0 ms 352 KB Output isn't correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 1 ms 352 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Incorrect 8 ms 600 KB Output isn't correct
17 Correct 7 ms 600 KB Output is correct
18 Incorrect 8 ms 600 KB Output isn't correct
19 Incorrect 7 ms 604 KB Output isn't correct
20 Incorrect 5 ms 608 KB Output isn't correct
21 Correct 31 ms 1200 KB Output is correct
22 Correct 31 ms 1116 KB Output is correct
23 Incorrect 31 ms 1368 KB Output isn't correct
24 Incorrect 28 ms 1124 KB Output isn't correct
25 Correct 25 ms 1376 KB Output is correct
26 Correct 31 ms 1124 KB Output is correct
27 Incorrect 28 ms 1124 KB Output isn't correct
28 Incorrect 33 ms 1112 KB Output isn't correct
29 Correct 28 ms 1112 KB Output is correct
30 Incorrect 23 ms 1112 KB Output isn't correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct