Submission #1005949

# Submission time Handle Problem Language Result Execution time Memory
1005949 2024-06-23T08:53:39 Z vjudge1 Gap (APIO16_gap) C++17
30 / 100
41 ms 3612 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;s+=add;
    while(s<t){
        ll cmn=cs,cmx=cs;
        ll tt=1;
        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;s=max(s,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 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 0 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 5 ms 2564 KB Output is correct
17 Correct 8 ms 2564 KB Output is correct
18 Correct 5 ms 2596 KB Output is correct
19 Correct 5 ms 2648 KB Output is correct
20 Correct 5 ms 2648 KB Output is correct
21 Correct 22 ms 3480 KB Output is correct
22 Correct 34 ms 3416 KB Output is correct
23 Correct 24 ms 3416 KB Output is correct
24 Correct 23 ms 3416 KB Output is correct
25 Correct 20 ms 3416 KB Output is correct
26 Correct 25 ms 3416 KB Output is correct
27 Correct 24 ms 3416 KB Output is correct
28 Correct 34 ms 3416 KB Output is correct
29 Correct 28 ms 3612 KB Output is correct
30 Correct 23 ms 3416 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Correct 10 ms 2564 KB Output is correct
17 Correct 8 ms 2392 KB Output is correct
18 Correct 11 ms 2392 KB Output is correct
19 Correct 10 ms 2392 KB Output is correct
20 Partially correct 5 ms 2392 KB Partially correct
21 Correct 35 ms 2740 KB Output is correct
22 Correct 34 ms 2648 KB Output is correct
23 Correct 41 ms 2648 KB Output is correct
24 Correct 34 ms 2648 KB Output is correct
25 Partially correct 34 ms 2648 KB Partially correct
26 Correct 39 ms 2648 KB Output is correct
27 Correct 33 ms 2868 KB Output is correct
28 Correct 38 ms 2648 KB Output is correct
29 Correct 35 ms 2648 KB Output is correct
30 Partially correct 22 ms 2648 KB Partially correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct