oj.uz

답안 #722831

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722831 2023-04-13T00:24:40 Z n0sk1ll Gap (APIO16_gap) C++14
100 / 100
 47 ms 1176 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=(r-l+n-1)/n,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 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 9 ms 516 KB Output is correct
17 Correct 10 ms 452 KB Output is correct
18 Correct 9 ms 464 KB Output is correct
19 Correct 11 ms 464 KB Output is correct
20 Correct 7 ms 464 KB Output is correct
21 Correct 36 ms 1176 KB Output is correct
22 Correct 35 ms 1048 KB Output is correct
23 Correct 35 ms 968 KB Output is correct
24 Correct 42 ms 1060 KB Output is correct
25 Correct 32 ms 1080 KB Output is correct
26 Correct 35 ms 1060 KB Output is correct
27 Correct 39 ms 1060 KB Output is correct
28 Correct 42 ms 1124 KB Output is correct
29 Correct 36 ms 1032 KB Output is correct
30 Correct 29 ms 1072 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 8 ms 428 KB Output is correct
17 Correct 7 ms 424 KB Output is correct
18 Correct 6 ms 464 KB Output is correct
19 Correct 6 ms 464 KB Output is correct
20 Correct 3 ms 464 KB Output is correct
21 Correct 26 ms 1052 KB Output is correct
22 Correct 25 ms 1060 KB Output is correct
23 Correct 23 ms 972 KB Output is correct
24 Correct 23 ms 1048 KB Output is correct
25 Correct 47 ms 984 KB Output is correct
26 Correct 30 ms 1088 KB Output is correct
27 Correct 22 ms 1052 KB Output is correct
28 Correct 24 ms 1084 KB Output is correct
29 Correct 22 ms 968 KB Output is correct
30 Correct 17 ms 1000 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct