oj.uz

답안 #949247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949247 2024-03-19T04:08:17 Z steveonalex Gap (APIO16_gap) C++14
100 / 100
 44 ms 4964 KB 
#include <bits/stdc++.h>
#include "gap.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int n;
// vector<ll> a;
// ll cost = 0;

// void MinMax(ll l, ll r, ll *mn, ll *mx){
//     cout << "? " << l << " " << r << "\n";
//     ll idx1 = lower_bound(ALL(a), l) - a.begin();
//     ll idx2 = upper_bound(ALL(a), r) - a.begin() - 1;
//     cost += max(idx2 - idx1 + 1, 0) + 1;
//     if (idx1 > idx2){
//         *mn = -1;
//         *mx = -1;
//     }
//     *mn = a[idx1];
//     *mx = a[idx2];
// }

namespace Sub1{
    ll solve(int n){
        vector<ll> a;
        ll l = 0, r = 1e18;
        for(int i = 0; i<n; i += 2){
            ll L, R;
            MinMax(l, r, &L, &R);
            a.push_back(L); a.push_back(R);
            l = L + 1, r = R - 1;
        }
        sort(ALL(a));

        ll ans = 0;
        for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
        return ans;
    }
}

namespace Sub2{
    vector<pair<ll, ll>> a;
    ll cap = 0;

    ll solve(int n){
        a.clear();
        ll l = 0, r = 1e18;
        ll L, R;
        MinMax(l, r, &L, &R);
        l = L, r = R;
        cap = (r - l) / n;
        if (cap * n < r - l) cap++;

        a.push_back({l, l});
        l++;

        while(l <= r){
            MinMax(l, l + cap -1 , &L, &R);
            if (L != -1) a.push_back({L, R});
            l += cap;
        }

        ll ans = 0;
        for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
        return ans;
    }
}

ll findGap(int T, int N){
    if (T == 1) return Sub1::solve(N);
    return Sub2::solve(N);
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     cin >> n;
//     a.resize(n);
//     for(int i= 0; i<n; ++i) cin >> a[i];

//     cout << findGap(2, n) << "\n";
//     cout << cost << "\n";

//     return 0;
// }

Compilation message

gap.cpp: In function 'll Sub1::solve(int)':
gap.cpp:78:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
      |                        ~^~~~~~~~~
gap.cpp: In function 'll Sub2::solve(int)':
gap.cpp:106:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |         for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
      |                        ~^~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 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 2536 KB Output is correct
16 Correct 11 ms 2844 KB Output is correct
17 Correct 9 ms 2900 KB Output is correct
18 Correct 9 ms 2980 KB Output is correct
19 Correct 9 ms 2848 KB Output is correct
20 Correct 7 ms 2836 KB Output is correct
21 Correct 33 ms 3932 KB Output is correct
22 Correct 32 ms 3856 KB Output is correct
23 Correct 39 ms 3876 KB Output is correct
24 Correct 35 ms 4016 KB Output is correct
25 Correct 37 ms 3976 KB Output is correct
26 Correct 35 ms 3944 KB Output is correct
27 Correct 37 ms 3988 KB Output is correct
28 Correct 36 ms 4056 KB Output is correct
29 Correct 32 ms 3996 KB Output is correct
30 Correct 28 ms 3968 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 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 2552 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 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 2 ms 2392 KB Output is correct
16 Correct 12 ms 2956 KB Output is correct
17 Correct 11 ms 2964 KB Output is correct
18 Correct 14 ms 2956 KB Output is correct
19 Correct 10 ms 2960 KB Output is correct
20 Correct 5 ms 2832 KB Output is correct
21 Correct 44 ms 4000 KB Output is correct
22 Correct 40 ms 3980 KB Output is correct
23 Correct 41 ms 3972 KB Output is correct
24 Correct 41 ms 3984 KB Output is correct
25 Correct 42 ms 4964 KB Output is correct
26 Correct 42 ms 3864 KB Output is correct
27 Correct 40 ms 3980 KB Output is correct
28 Correct 40 ms 3972 KB Output is correct
29 Correct 43 ms 3944 KB Output is correct
30 Correct 22 ms 3072 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct