| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 949165 |
2024-03-19T03:10:03 Z |
steveonalex |
Gap (APIO16_gap) |
C++14 |
|
35 ms |
4008 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());
}
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;
}
}
ll findGap(int T, int N){
return Sub1::solve(N);
}
// int main(void){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// return 0;
// }
Compilation message
gap.cpp: In function 'll Sub1::solve(int)':
gap.cpp:61:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 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 |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 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 |
8 ms |
2840 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2836 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2844 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2840 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2840 KB |
Output is correct |
| 21 |
Correct |
33 ms |
4004 KB |
Output is correct |
| 22 |
Correct |
32 ms |
3996 KB |
Output is correct |
| 23 |
Correct |
32 ms |
3992 KB |
Output is correct |
| 24 |
Correct |
35 ms |
3988 KB |
Output is correct |
| 25 |
Correct |
28 ms |
3996 KB |
Output is correct |
| 26 |
Correct |
32 ms |
3992 KB |
Output is correct |
| 27 |
Correct |
33 ms |
3796 KB |
Output is correct |
| 28 |
Correct |
33 ms |
4000 KB |
Output is correct |
| 29 |
Correct |
32 ms |
3832 KB |
Output is correct |
| 30 |
Correct |
26 ms |
3988 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is 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 |
2644 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 |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
8 ms |
3012 KB |
Partially correct |
| 17 |
Partially correct |
8 ms |
2844 KB |
Partially correct |
| 18 |
Partially correct |
9 ms |
2848 KB |
Partially correct |
| 19 |
Partially correct |
9 ms |
2824 KB |
Partially correct |
| 20 |
Partially correct |
7 ms |
2836 KB |
Partially correct |
| 21 |
Incorrect |
34 ms |
3852 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
32 ms |
3912 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
33 ms |
3992 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
33 ms |
3992 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
29 ms |
3996 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
33 ms |
3972 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
32 ms |
4000 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
32 ms |
3912 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
32 ms |
3844 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
27 ms |
4008 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
