#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = 1e18;
#include "gap.h"
long long findGap(int T, int N) {
if(T == 1) {
vector<long long> a(N);
long long mn, mx;
MinMax(0, inf, &mn, &mx);
a[0] = mn, a[N - 1] = mx;
long long lstMn = mn, lstMx = mx;
for(int i = 1; i < N / 2; i++) {
MinMax(lstMn + 1, lstMx - 1, &mn, &mx);
a[i] = mn, a[N - i - 1] = mx;
lstMn = mn, lstMx = mx;
}
if(N & 1) {
int mid = N / 2;
MinMax(lstMn + 1, max(lstMn + 1, lstMx - 1), &mn, &mx);
assert(mn == mx);
a[N / 2] = mn;
}
long long answ = 0;
for(int i = 1; i < N; i++) {
answ = max(answ, a[i] - a[i - 1]);
}
return answ;
} else {
vector<long long> a(N);
long long mn, mx;
MinMax(0, inf, &mn, &mx);
// N - 2
if(N == 2) {
return mx - mn;
}
long long size = mx - mn, i;
long long pos = (size + N - 2) / (N - 1), l = mn, answ = 0;
for(i = mn; i < mx; i += pos) {
// i: i + pos;
MinMax(i, i + pos, &mn, &mx);
assert(mn != -1);
answ = max(answ, mn - l);
l = mx;
}
answ = max(answ, mx - l);
return answ;
}
return 0;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:88:11: warning: unused variable 'mid' [-Wunused-variable]
88 | int mid = N / 2;
| ^~~
gap.cpp: In function 'void setIO(std::string)':
gap.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 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 |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
10 ms |
684 KB |
Output is correct |
| 17 |
Correct |
10 ms |
624 KB |
Output is correct |
| 18 |
Correct |
15 ms |
604 KB |
Output is correct |
| 19 |
Correct |
9 ms |
720 KB |
Output is correct |
| 20 |
Correct |
9 ms |
680 KB |
Output is correct |
| 21 |
Correct |
34 ms |
1832 KB |
Output is correct |
| 22 |
Correct |
34 ms |
1828 KB |
Output is correct |
| 23 |
Correct |
41 ms |
1864 KB |
Output is correct |
| 24 |
Correct |
37 ms |
1832 KB |
Output is correct |
| 25 |
Correct |
30 ms |
1812 KB |
Output is correct |
| 26 |
Correct |
35 ms |
1872 KB |
Output is correct |
| 27 |
Correct |
38 ms |
1864 KB |
Output is correct |
| 28 |
Correct |
36 ms |
1820 KB |
Output is correct |
| 29 |
Correct |
43 ms |
1820 KB |
Output is correct |
| 30 |
Correct |
30 ms |
1868 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
220 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
5 ms |
632 KB |
Output isn't correct |
| 17 |
Incorrect |
6 ms |
700 KB |
Output isn't correct |
| 18 |
Incorrect |
5 ms |
592 KB |
Output isn't correct |
| 19 |
Incorrect |
5 ms |
720 KB |
Output isn't correct |
| 20 |
Incorrect |
3 ms |
592 KB |
Output isn't correct |
| 21 |
Incorrect |
19 ms |
1824 KB |
Output isn't correct |
| 22 |
Incorrect |
23 ms |
1828 KB |
Output isn't correct |
| 23 |
Incorrect |
17 ms |
1844 KB |
Output isn't correct |
| 24 |
Incorrect |
22 ms |
1872 KB |
Output isn't correct |
| 25 |
Incorrect |
14 ms |
1872 KB |
Output isn't correct |
| 26 |
Incorrect |
18 ms |
1864 KB |
Output isn't correct |
| 27 |
Incorrect |
19 ms |
1804 KB |
Output isn't correct |
| 28 |
Incorrect |
19 ms |
1800 KB |
Output isn't correct |
| 29 |
Incorrect |
23 ms |
1828 KB |
Output isn't correct |
| 30 |
Incorrect |
14 ms |
1852 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
