| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 916051 |
2024-01-25T07:54:56 Z |
GrindMachine |
Gap (APIO16_gap) |
C++17 |
|
1159 ms |
3108 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, slightly remember some ideas
may have still solved it if not for those ideas
*/
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,inf2);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 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 |
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 |
13 ms |
2508 KB |
Output isn't correct |
| 12 |
Incorrect |
13 ms |
2392 KB |
Output isn't correct |
| 13 |
Incorrect |
13 ms |
2392 KB |
Output isn't correct |
| 14 |
Incorrect |
13 ms |
2392 KB |
Output isn't correct |
| 15 |
Incorrect |
7 ms |
2392 KB |
Output isn't correct |
| 16 |
Incorrect |
266 ms |
2588 KB |
Output isn't correct |
| 17 |
Incorrect |
265 ms |
2588 KB |
Output isn't correct |
| 18 |
Incorrect |
269 ms |
2588 KB |
Output isn't correct |
| 19 |
Incorrect |
264 ms |
2584 KB |
Output isn't correct |
| 20 |
Incorrect |
15 ms |
2572 KB |
Output isn't correct |
| 21 |
Incorrect |
1154 ms |
2856 KB |
Output isn't correct |
| 22 |
Incorrect |
1143 ms |
3020 KB |
Output isn't correct |
| 23 |
Incorrect |
1152 ms |
3104 KB |
Output isn't correct |
| 24 |
Incorrect |
1151 ms |
2856 KB |
Output isn't correct |
| 25 |
Incorrect |
603 ms |
2852 KB |
Output isn't correct |
| 26 |
Incorrect |
1151 ms |
2852 KB |
Output isn't correct |
| 27 |
Incorrect |
1159 ms |
2852 KB |
Output isn't correct |
| 28 |
Incorrect |
1151 ms |
3108 KB |
Output isn't correct |
| 29 |
Incorrect |
1158 ms |
2856 KB |
Output isn't correct |
| 30 |
Incorrect |
62 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 2 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 10 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
13 ms |
2500 KB |
Partially correct |
| 12 |
Partially correct |
13 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
13 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
16 ms |
2508 KB |
Partially correct |
| 15 |
Partially correct |
6 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
268 ms |
2580 KB |
Partially correct |
| 17 |
Partially correct |
267 ms |
2580 KB |
Partially correct |
| 18 |
Partially correct |
264 ms |
2588 KB |
Partially correct |
| 19 |
Partially correct |
267 ms |
2588 KB |
Partially correct |
| 20 |
Partially correct |
15 ms |
2576 KB |
Partially correct |
| 21 |
Partially correct |
1148 ms |
3100 KB |
Partially correct |
| 22 |
Partially correct |
1154 ms |
2980 KB |
Partially correct |
| 23 |
Partially correct |
1155 ms |
3104 KB |
Partially correct |
| 24 |
Partially correct |
1157 ms |
2856 KB |
Partially correct |
| 25 |
Partially correct |
609 ms |
2844 KB |
Partially correct |
| 26 |
Partially correct |
1146 ms |
2860 KB |
Partially correct |
| 27 |
Partially correct |
1157 ms |
2856 KB |
Partially correct |
| 28 |
Partially correct |
1154 ms |
2856 KB |
Partially correct |
| 29 |
Partially correct |
1154 ms |
2856 KB |
Partially correct |
| 30 |
Partially correct |
62 ms |
2832 KB |
Partially correct |
| 31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
