oj.uz

답안 #1055808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055808 2024-08-13T05:41:33 Z thieunguyenhuy Gap (APIO16_gap) C++17
0 / 100
 45 ms 1248 KB 
#ifndef hwe
	#include "gap.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

#ifdef hwe
void MinMax(ll s, ll t, ll *mn, ll *mx) {}
#endif

int findGap(int t, int n) {
	ll mi = -1, ma = -1;
	MinMax(0, INF, &mi, &ma);

	ll L = ma - mi, block_size = (L + n - 2) / (n - 1);

	ll last_max = -1, ans = -INF;
	for (ll i = mi; i <= ma; i += block_size) {
		ll mn = -1, mx = -1;
		MinMax(i, min(i + block_size - 1, ma), &mn, &mx);
		if (mn != -1 && last_max != -1) maximize(ans, mi - last_max);
		if (mx != -1) last_max = mx;
	}

	return ans;
}

#ifdef hwe
signed main() {



    cerr << '\n'; return 0;
}
#endif

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Incorrect 8 ms 664 KB Output isn't correct
17 Incorrect 9 ms 600 KB Output isn't correct
18 Incorrect 7 ms 656 KB Output isn't correct
19 Incorrect 9 ms 600 KB Output isn't correct
20 Incorrect 5 ms 600 KB Output isn't correct
21 Incorrect 29 ms 1224 KB Output isn't correct
22 Incorrect 29 ms 1128 KB Output isn't correct
23 Incorrect 36 ms 1112 KB Output isn't correct
24 Incorrect 30 ms 1248 KB Output isn't correct
25 Incorrect 29 ms 1112 KB Output isn't correct
26 Incorrect 30 ms 1112 KB Output isn't correct
27 Incorrect 35 ms 1208 KB Output isn't correct
28 Incorrect 31 ms 1112 KB Output isn't correct
29 Incorrect 29 ms 1112 KB Output isn't correct
30 Incorrect 18 ms 1112 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Incorrect 0 ms 432 KB Output isn't correct
16 Incorrect 8 ms 600 KB Output isn't correct
17 Incorrect 7 ms 600 KB Output isn't correct
18 Incorrect 8 ms 600 KB Output isn't correct
19 Incorrect 7 ms 600 KB Output isn't correct
20 Incorrect 4 ms 656 KB Output isn't correct
21 Incorrect 42 ms 1112 KB Output isn't correct
22 Incorrect 45 ms 1220 KB Output isn't correct
23 Incorrect 33 ms 1172 KB Output isn't correct
24 Incorrect 29 ms 1112 KB Output isn't correct
25 Incorrect 39 ms 996 KB Output isn't correct
26 Incorrect 30 ms 1112 KB Output isn't correct
27 Incorrect 30 ms 1112 KB Output isn't correct
28 Incorrect 30 ms 1220 KB Output isn't correct
29 Incorrect 34 ms 1020 KB Output isn't correct
30 Incorrect 21 ms 1112 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct