#include<iostream>
#include<algorithm>
#include<vector>
#include "gap.h"
using namespace std;
#define vel vector<long long>
#define ll long long
#define rep(i,n) for(__int128 i=0;i<n;i++)
int pr = 1000000007;
int ref(int &a) {
a = a % pr;
a += pr;
a = a % pr;
return a;
}
long long findGap(int t, int n) {
if (t == 1) {
vel a(n);
ll mn = 0; ll mx = (pr - 7);
mx *= mx;
rep(i, (n + 1) / 2) {
MinMax(mn, mx, &mn, &mx);
a[i] = mn;
a[n - 1 - i] = mx;
mn++; mx--;
}
ll ans = 0;
rep(i, n - 1) { ans = max(ans, a[i + 1] - a[i]); }
return ans;
}
if (t == 2) {
__int128 N = n;
long long a1; long long an;
long long INF = pr - 7;
INF *= INF;
MinMax(0, INF, &a1, &an);
__int128 X = an - a1 + 1;
long long now_min = a1;
long long ans = 0;
if (n == 2) { return an - a1; }
N--; n--;
rep(i, n) {
long long mn, mx;
__int128 j = i;
j++;
__int128 n1 = (X*i) / N;
__int128 n2 = (X*j) / N;
ll q1 = a1 + n1;
ll q2 = a1 + n2;
q2--;
MinMax(q1, q2, &mn, &mx);
if (mn != -1) {
ans = max(mn - now_min, ans);
now_min = mx;
}
}
return ans;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:59:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
3 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
484 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
15 ms |
768 KB |
Output is correct |
17 |
Correct |
17 ms |
768 KB |
Output is correct |
18 |
Correct |
18 ms |
768 KB |
Output is correct |
19 |
Correct |
15 ms |
768 KB |
Output is correct |
20 |
Correct |
10 ms |
768 KB |
Output is correct |
21 |
Correct |
47 ms |
1912 KB |
Output is correct |
22 |
Correct |
50 ms |
1920 KB |
Output is correct |
23 |
Correct |
47 ms |
1912 KB |
Output is correct |
24 |
Correct |
55 ms |
1912 KB |
Output is correct |
25 |
Correct |
46 ms |
1912 KB |
Output is correct |
26 |
Correct |
53 ms |
2040 KB |
Output is correct |
27 |
Correct |
55 ms |
2012 KB |
Output is correct |
28 |
Correct |
53 ms |
1912 KB |
Output is correct |
29 |
Correct |
50 ms |
1920 KB |
Output is correct |
30 |
Correct |
36 ms |
1920 KB |
Output is correct |
31 |
Correct |
2 ms |
384 KB |
Output is correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
3 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
284 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
21 ms |
512 KB |
Output is correct |
17 |
Correct |
22 ms |
640 KB |
Output is correct |
18 |
Correct |
19 ms |
512 KB |
Output is correct |
19 |
Correct |
21 ms |
512 KB |
Output is correct |
20 |
Correct |
10 ms |
512 KB |
Output is correct |
21 |
Correct |
74 ms |
1152 KB |
Output is correct |
22 |
Correct |
89 ms |
1272 KB |
Output is correct |
23 |
Correct |
73 ms |
1144 KB |
Output is correct |
24 |
Correct |
68 ms |
1144 KB |
Output is correct |
25 |
Correct |
57 ms |
1152 KB |
Output is correct |
26 |
Correct |
71 ms |
1144 KB |
Output is correct |
27 |
Correct |
67 ms |
1148 KB |
Output is correct |
28 |
Correct |
72 ms |
1144 KB |
Output is correct |
29 |
Correct |
68 ms |
1200 KB |
Output is correct |
30 |
Correct |
35 ms |
1152 KB |
Output is correct |
31 |
Correct |
2 ms |
384 KB |
Output is correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |