oj.uz

답안 #916050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916050 2024-01-25T07:52:36 Z GrindMachine Gap (APIO16_gap) C++17
0 / 100
 17 ms 3020 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions a long time ago, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "gap.h"

ll go(ll l, ll r){
	if(l >= r) return 0;

	ll mid = (l+r) >> 1;
	ll lmn,lmx,rmn,rmx;
	MinMax(l,mid,&lmn,&lmx);
	MinMax(mid+1,r,&rmn,&rmx);
	
	ll ans = 0;
	if(lmx != -1 and rmn != -1){
		ans = rmn-lmx;
	}

	if(lmx != -1){
		amax(ans,go(l,mid));
	}
	if(rmn != -1){
		amax(ans,go(mid+1,r));
	}

	return ans;
}

long long findGap(int T, int n)
{
	return go(0,10);
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 1 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2492 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 4 ms 2752 KB Output isn't correct
17 Incorrect 4 ms 2580 KB Output isn't correct
18 Incorrect 4 ms 2584 KB Output isn't correct
19 Incorrect 4 ms 2752 KB Output isn't correct
20 Incorrect 2 ms 2568 KB Output isn't correct
21 Incorrect 17 ms 2856 KB Output isn't correct
22 Incorrect 14 ms 2856 KB Output isn't correct
23 Incorrect 14 ms 2860 KB Output isn't correct
24 Incorrect 13 ms 2852 KB Output isn't correct
25 Incorrect 10 ms 2848 KB Output isn't correct
26 Incorrect 13 ms 2856 KB Output isn't correct
27 Incorrect 16 ms 2788 KB Output isn't correct
28 Incorrect 13 ms 3020 KB Output isn't correct
29 Incorrect 13 ms 2860 KB Output isn't correct
30 Incorrect 8 ms 2848 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2392 KB Output isn't correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 1 ms 2644 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 1 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 4 ms 2584 KB Output isn't correct
17 Incorrect 4 ms 2752 KB Output isn't correct
18 Incorrect 4 ms 2592 KB Output isn't correct
19 Incorrect 4 ms 2572 KB Output isn't correct
20 Incorrect 2 ms 2572 KB Output isn't correct
21 Incorrect 17 ms 2844 KB Output isn't correct
22 Incorrect 13 ms 2848 KB Output isn't correct
23 Incorrect 13 ms 2852 KB Output isn't correct
24 Incorrect 13 ms 2648 KB Output isn't correct
25 Incorrect 10 ms 2848 KB Output isn't correct
26 Incorrect 15 ms 2856 KB Output isn't correct
27 Incorrect 14 ms 2852 KB Output isn't correct
28 Incorrect 14 ms 3012 KB Output isn't correct
29 Incorrect 14 ms 2852 KB Output isn't correct
30 Incorrect 8 ms 2852 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2392 KB Output isn't correct