| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 95591 |
2019-02-02T06:21:28 Z |
lyc |
Gap (APIO16_gap) |
C++14 |
|
2000 ms |
11028 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> solve(ll s, ll t) {
//cout << s << " " << t << endl;
ll mn, mx;
MinMax(s, t, &mn, &mx);
vector<ll> v;
if (mn != -1) {
ll p = rand()%(mx-mn+1) + mn;
//cout << mn << " " << p << " " << mx << endl;
v.push_back(mn);
if (mn+1 <= p) {
vector<ll> a = solve(mn+1, p);
for (auto x : a) v.push_back(x);
}
if (p <= mx-1) {
vector<ll> b = solve(p, mx-1);
for (auto x : b) v.push_back(x);
}
v.push_back(mx);
}
return move(v);
}
long long findGap(int T, int N)
{
ll ans = 0;
ll s, t, mn, mx;
if (T == 1) {
s = 0, t = (ll)1e18;
ll arr[N];
for (int i = 0; i < (N+1)/2; ++i) {
MinMax(s, t, &mn, &mx);
arr[i] = mn;
arr[N-1-i] = mx;
s = mn+1;
t = mx-1;
//cout << "FOUND " << mn << " " << mx << '\n';
}
//for (int i = 0; i < N; ++i) cout << arr[i] << ' ' ;cout << endl;
for (int i = 1; i < N; ++i) {
ans = max(ans, arr[i]-arr[i-1]);
}
}
else {
ll arr[N];
s = 0, t = (ll)1e18;
srand(482037893);
vector<ll> v = solve(s, t);
for (int i = 1; i < N; ++i) {
ans = max(ans, v[i]-v[i-1]);
}
}
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:12: warning: unused variable 'arr' [-Wunused-variable]
ll arr[N];
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
348 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
292 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
376 KB |
Output is correct |
| 16 |
Correct |
13 ms |
732 KB |
Output is correct |
| 17 |
Correct |
12 ms |
732 KB |
Output is correct |
| 18 |
Correct |
13 ms |
740 KB |
Output is correct |
| 19 |
Correct |
12 ms |
664 KB |
Output is correct |
| 20 |
Correct |
9 ms |
688 KB |
Output is correct |
| 21 |
Correct |
47 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
46 ms |
1904 KB |
Output is correct |
| 23 |
Correct |
47 ms |
1832 KB |
Output is correct |
| 24 |
Correct |
47 ms |
1868 KB |
Output is correct |
| 25 |
Correct |
40 ms |
1896 KB |
Output is correct |
| 26 |
Correct |
47 ms |
1852 KB |
Output is correct |
| 27 |
Correct |
46 ms |
1824 KB |
Output is correct |
| 28 |
Correct |
47 ms |
1920 KB |
Output is correct |
| 29 |
Correct |
46 ms |
1884 KB |
Output is correct |
| 30 |
Correct |
34 ms |
1912 KB |
Output is correct |
| 31 |
Correct |
2 ms |
376 KB |
Output is correct |
| 32 |
Correct |
2 ms |
380 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
348 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 10 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 11 |
Partially correct |
5 ms |
556 KB |
Partially correct |
| 12 |
Partially correct |
5 ms |
552 KB |
Partially correct |
| 13 |
Partially correct |
5 ms |
504 KB |
Partially correct |
| 14 |
Partially correct |
5 ms |
504 KB |
Partially correct |
| 15 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 16 |
Partially correct |
544 ms |
3316 KB |
Partially correct |
| 17 |
Partially correct |
545 ms |
3168 KB |
Partially correct |
| 18 |
Partially correct |
550 ms |
3152 KB |
Partially correct |
| 19 |
Partially correct |
546 ms |
3228 KB |
Partially correct |
| 20 |
Incorrect |
24 ms |
1696 KB |
Output isn't correct |
| 21 |
Execution timed out |
2048 ms |
10668 KB |
Time limit exceeded |
| 22 |
Execution timed out |
2045 ms |
10836 KB |
Time limit exceeded |
| 23 |
Execution timed out |
2057 ms |
10948 KB |
Time limit exceeded |
| 24 |
Execution timed out |
2063 ms |
10980 KB |
Time limit exceeded |
| 25 |
Partially correct |
117 ms |
4772 KB |
Partially correct |
| 26 |
Execution timed out |
2062 ms |
10896 KB |
Time limit exceeded |
| 27 |
Execution timed out |
2076 ms |
11028 KB |
Time limit exceeded |
| 28 |
Execution timed out |
2047 ms |
10768 KB |
Time limit exceeded |
| 29 |
Execution timed out |
2051 ms |
10688 KB |
Time limit exceeded |
| 30 |
Incorrect |
99 ms |
6244 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 32 |
Partially correct |
2 ms |
376 KB |
Partially correct |
