oj.uz

답안 #904199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
904199 2024-01-11T22:28:04 Z n0sk1ll Gap (APIO16_gap) C++17
64.6316 / 100
 40 ms 3092 KB 
    #include <bits/stdc++.h>
     
    #define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
    #define mp make_pair
    #define xx first
    #define yy second
    #define pb push_back
    #define pf push_front
    #define popb pop_back
    #define popf pop_front
    #define all(x) x.begin(),x.end()
    #define ff(i,a,b) for (int i = a; i < b; i++)
    #define fff(i,a,b) for (int i = a; i <= b; i++)
    #define bff(i,a,b) for (int i = b-1; i >= a; i--)
    #define bfff(i,a,b) for (int i = b; i >= a; i--)
     
    using namespace std;
    long double typedef ld;
    unsigned int typedef ui;
    long long int typedef li;
    pair<int,int> typedef pii;
    pair<li,li> typedef pli;
    pair<ld,ld> typedef pld;
    vector<vector<int>> typedef graph;
    unsigned long long int typedef ull;
    //const int mod = 998244353;
    const int mod = 1000000007;
     
     
     
     
     
     
     
    //Note to self: Check for overflow
     
    #include "gap.h"
     
    li solve3v(int n)
    {
        li ans=0;
        li l=-1,r=1'000'000'000'000'000'001ll;
        ff(i,0,(n+1)/2)
        {
            li mn,mx;
            MinMax(l+1,r-1,&mn,&mx);
            if (l!=-1) ans=max(ans,max(mn-l,r-mx));
            //cout<<": "<<l<<" "<<mn<<" "<<mx<<" "<<r<<endl;
            l=mn,r=mx;
        }
        return max(ans,r-l);
    }
     
    li solve(int n)
    {
        li l=-1,r=1'000'000'000'000'000'001ll;
        li mn,mx; MinMax(l+1,r+1,&mn,&mx);
        if (n==2) return mx-mn;
        l=mn,r=mx;
     
        li gap=1,maygap;
        while (true)
        {
            maygap=gap;
            while (true)
            {
                maygap=min(maygap,r-l);
                MinMax(l+1,l+maygap,&mn,&mx);
                if (mx==-1) maygap*=2;
                else
                {
                    gap=max(gap,mn-l);
                    l=mx; break;
                }
            }
            if (l>=r) break;
        }
     
        return gap;
    }
     
    li findGap(int T, int N)
    {
    	if (T==1) return solve3v(N);
    	return solve(N);
    }
     
    /*
     
    2 4
    2 3 6 8
     
    */

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2468 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 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 8 ms 2588 KB Output is correct
17 Correct 8 ms 2588 KB Output is correct
18 Correct 8 ms 2584 KB Output is correct
19 Correct 10 ms 2584 KB Output is correct
20 Correct 7 ms 2572 KB Output is correct
21 Correct 31 ms 2828 KB Output is correct
22 Correct 30 ms 2852 KB Output is correct
23 Correct 31 ms 2864 KB Output is correct
24 Correct 31 ms 2864 KB Output is correct
25 Correct 28 ms 2848 KB Output is correct
26 Correct 33 ms 2840 KB Output is correct
27 Correct 30 ms 2856 KB Output is correct
28 Correct 30 ms 2856 KB Output is correct
29 Correct 30 ms 3092 KB Output is correct
30 Correct 25 ms 2852 KB Output is correct
31 Correct 1 ms 2588 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
34.6316307611 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 1 ms 2644 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 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 Partially correct 2 ms 2392 KB Partially correct
16 Correct 6 ms 2584 KB Output is correct
17 Correct 6 ms 2588 KB Output is correct
18 Correct 6 ms 2588 KB Output is correct
19 Correct 6 ms 2752 KB Output is correct
20 Correct 6 ms 2544 KB Output is correct
21 Correct 19 ms 2820 KB Output is correct
22 Correct 20 ms 2856 KB Output is correct
23 Correct 19 ms 2856 KB Output is correct
24 Correct 20 ms 2912 KB Output is correct
25 Partially correct 40 ms 2848 KB Partially correct
26 Correct 20 ms 3020 KB Output is correct
27 Correct 21 ms 2860 KB Output is correct
28 Correct 20 ms 2860 KB Output is correct
29 Correct 20 ms 2856 KB Output is correct
30 Correct 19 ms 2860 KB Output is correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Correct 1 ms 2392 KB Output is correct