| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 563746 |
2022-05-18T05:03:35 Z |
khangal |
Gap (APIO16_gap) |
C++14 |
|
2000 ms |
1880 KB |
#include "gap.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long, long long > pl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll N , n, m, mid, res,pos, mn, mx, sum, h1, h2, arr[3234567],arr1[1234567],k, i, j, h, a, x, y, z,par[1234567],ans;
bool used[1234567];
ll tp[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
//ll jump[22][223456];
//ll lvl[1234567];
//ll bit[1234567];
//ll timer;
//ll st[1234567],endd[1234567];
//ll dp[5005][5005];
ll findGap(int T, int n){
ll l=0,r=MAX,mn,mx;
if(T==1){
for(int i=1;i<=(n+1)/2;i++){
MinMax(l,r,&mn,&mx);
arr[i] = mn;
arr[n+1-i] = mx;
l = mn+1;
r = mx-1;
}
ans=0;
for(int i=1;i<n;i++)ans=max(ans,arr[i+1]-arr[i]);
return ans;
}
else{
MinMax(l,r,&mn,&mx);
ll ans = ceil((mx-mn+1)/n);
while(l!=r){
MinMax(l+1,l+ans,&mn,&mx);
if(mx != -1){
l=mx;
}
else{
x=ans;
while(mn!=-1){
x*=2;
MinMax(l+1,l+x,&mn,&mx);
}
ans = max(ans , mn-l);
l=mx;
}
}
return ans;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
10 ms |
692 KB |
Output is correct |
| 17 |
Correct |
11 ms |
652 KB |
Output is correct |
| 18 |
Correct |
9 ms |
720 KB |
Output is correct |
| 19 |
Correct |
12 ms |
688 KB |
Output is correct |
| 20 |
Correct |
8 ms |
708 KB |
Output is correct |
| 21 |
Correct |
48 ms |
1764 KB |
Output is correct |
| 22 |
Correct |
37 ms |
1860 KB |
Output is correct |
| 23 |
Correct |
38 ms |
1864 KB |
Output is correct |
| 24 |
Correct |
38 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
33 ms |
1808 KB |
Output is correct |
| 26 |
Correct |
38 ms |
1868 KB |
Output is correct |
| 27 |
Correct |
37 ms |
1832 KB |
Output is correct |
| 28 |
Correct |
38 ms |
1828 KB |
Output is correct |
| 29 |
Correct |
44 ms |
1828 KB |
Output is correct |
| 30 |
Correct |
33 ms |
1800 KB |
Output is correct |
| 31 |
Correct |
0 ms |
336 KB |
Output is correct |
| 32 |
Correct |
0 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3067 ms |
208 KB |
Time limit exceeded |
| 2 |
Execution timed out |
3076 ms |
336 KB |
Time limit exceeded |
| 3 |
Execution timed out |
3044 ms |
336 KB |
Time limit exceeded |
| 4 |
Execution timed out |
3081 ms |
336 KB |
Time limit exceeded |
| 5 |
Execution timed out |
3085 ms |
208 KB |
Time limit exceeded |
| 6 |
Execution timed out |
3051 ms |
208 KB |
Time limit exceeded |
| 7 |
Execution timed out |
3065 ms |
208 KB |
Time limit exceeded |
| 8 |
Execution timed out |
3040 ms |
208 KB |
Time limit exceeded |
| 9 |
Execution timed out |
3066 ms |
208 KB |
Time limit exceeded |
| 10 |
Execution timed out |
3063 ms |
208 KB |
Time limit exceeded |
| 11 |
Execution timed out |
3075 ms |
336 KB |
Time limit exceeded |
| 12 |
Execution timed out |
3076 ms |
336 KB |
Time limit exceeded |
| 13 |
Execution timed out |
3083 ms |
336 KB |
Time limit exceeded |
| 14 |
Execution timed out |
3086 ms |
336 KB |
Time limit exceeded |
| 15 |
Execution timed out |
3084 ms |
336 KB |
Time limit exceeded |
| 16 |
Execution timed out |
3074 ms |
464 KB |
Time limit exceeded |
| 17 |
Execution timed out |
3064 ms |
464 KB |
Time limit exceeded |
| 18 |
Execution timed out |
3078 ms |
464 KB |
Time limit exceeded |
| 19 |
Execution timed out |
3069 ms |
464 KB |
Time limit exceeded |
| 20 |
Execution timed out |
3088 ms |
464 KB |
Time limit exceeded |
| 21 |
Execution timed out |
3038 ms |
1064 KB |
Time limit exceeded |
| 22 |
Execution timed out |
3047 ms |
1060 KB |
Time limit exceeded |
| 23 |
Execution timed out |
3033 ms |
1068 KB |
Time limit exceeded |
| 24 |
Execution timed out |
3047 ms |
968 KB |
Time limit exceeded |
| 25 |
Execution timed out |
3056 ms |
1064 KB |
Time limit exceeded |
| 26 |
Execution timed out |
3042 ms |
1068 KB |
Time limit exceeded |
| 27 |
Execution timed out |
3039 ms |
1052 KB |
Time limit exceeded |
| 28 |
Execution timed out |
3024 ms |
1064 KB |
Time limit exceeded |
| 29 |
Execution timed out |
3024 ms |
1048 KB |
Time limit exceeded |
| 30 |
Execution timed out |
3061 ms |
1048 KB |
Time limit exceeded |
| 31 |
Execution timed out |
3080 ms |
336 KB |
Time limit exceeded |
| 32 |
Execution timed out |
3082 ms |
208 KB |
Time limit exceeded |
