Submission #1005912

# Submission time Handle Problem Language Result Execution time Memory
1005912 2024-06-23T07:49:23 Z vjudge1 Gap (APIO16_gap) C++17
0 / 100
49 ms 3644 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-1)/(n-1)+1;
    ll ans=0;
    while(s<t){
        ll cmn=s,cmx=s;
        ll tt=1;
        while(1){
            MinMax(s,s+tt*add,&cmn,&cmx);
            if(cmn!=cmx)break;
            tt++;
        }ll cmn2=cmn,cmx2=cmx;
        MinMax(s+(tt-1)*add,s+tt*add,&cmn2,&cmx2);
        if(cmn2==cmx2)cmn2=cmn;
        ans=max(ans,cmx2-cmn2);
        s=cmx2;
    }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 Incorrect 0 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 0 ms 2392 KB Output isn't correct
5 Incorrect 0 ms 2392 KB Output isn't correct
6 Correct 0 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 Correct 0 ms 2392 KB Output is 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 Correct 1 ms 2392 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 8 ms 2648 KB Output is correct
18 Correct 7 ms 2784 KB Output is correct
19 Correct 6 ms 2648 KB Output is correct
20 Correct 5 ms 2648 KB Output is correct
21 Correct 25 ms 3416 KB Output is correct
22 Correct 25 ms 3416 KB Output is correct
23 Correct 25 ms 3644 KB Output is correct
24 Correct 25 ms 3416 KB Output is correct
25 Correct 30 ms 3536 KB Output is correct
26 Correct 25 ms 3416 KB Output is correct
27 Correct 25 ms 3416 KB Output is correct
28 Correct 24 ms 3416 KB Output is correct
29 Correct 25 ms 3416 KB Output is correct
30 Correct 21 ms 3640 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 Partially correct 1 ms 2392 KB Partially correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 0 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Partially correct 1 ms 2484 KB Partially correct
16 Partially correct 11 ms 2392 KB Partially correct
17 Partially correct 12 ms 2588 KB Partially correct
18 Partially correct 14 ms 2392 KB Partially correct
19 Incorrect 11 ms 2392 KB Output isn't correct
20 Incorrect 5 ms 2392 KB Output isn't correct
21 Incorrect 48 ms 2844 KB Output isn't correct
22 Incorrect 49 ms 2840 KB Output isn't correct
23 Incorrect 48 ms 2648 KB Output isn't correct
24 Partially correct 48 ms 2644 KB Partially correct
25 Partially correct 45 ms 2648 KB Partially correct
26 Partially correct 48 ms 2804 KB Partially correct
27 Incorrect 47 ms 2648 KB Output isn't correct
28 Partially correct 49 ms 2648 KB Partially correct
29 Incorrect 49 ms 2648 KB Output isn't correct
30 Incorrect 22 ms 2648 KB Output isn't correct
31 Partially correct 0 ms 2392 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct