답안 #143131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143131 2019-08-13T07:30:34 Z alextodoran Gap (APIO16_gap) C++14
30 / 100
60 ms 1948 KB
#include <bits/stdc++.h>

#define ll long long
#define N_MAX 100002

using namespace std;

const ll INF = 1000000000000000000;

void MinMax(long long s, long long t, long long *mn, long long *mx);

ll a[N_MAX];

ll mi, mx;

ll findGap (int t, int n)
{
    a[0] = -1;
    a[n + 1] = INF + 1;
    int x = 1, y = n;
    while(x <= y)
    {
        MinMax(a[x - 1] + 1, a[y + 1] - 1, &mi, &mx);
        a[x] = mi;
        a[y] = mx;
        x++;
        y--;
    }
    ll ans = 0;
    for(int i = 2; i <= n; i++)
        ans = max(ans, a[i] - a[i - 1]);
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 15 ms 760 KB Output is correct
17 Correct 18 ms 732 KB Output is correct
18 Correct 15 ms 760 KB Output is correct
19 Correct 15 ms 760 KB Output is correct
20 Correct 11 ms 760 KB Output is correct
21 Correct 55 ms 1912 KB Output is correct
22 Correct 55 ms 1908 KB Output is correct
23 Correct 55 ms 1912 KB Output is correct
24 Correct 56 ms 1912 KB Output is correct
25 Correct 48 ms 1932 KB Output is correct
26 Correct 55 ms 1912 KB Output is correct
27 Correct 55 ms 1912 KB Output is correct
28 Correct 55 ms 1916 KB Output is correct
29 Correct 59 ms 1948 KB Output is correct
30 Correct 41 ms 1912 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 280 KB Output is correct
2 Partially correct 2 ms 376 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 Partially correct 2 ms 380 KB Partially correct
11 Partially correct 3 ms 376 KB Partially correct
12 Partially correct 3 ms 376 KB Partially correct
13 Partially correct 3 ms 376 KB Partially correct
14 Partially correct 3 ms 376 KB Partially correct
15 Partially correct 2 ms 376 KB Partially correct
16 Partially correct 16 ms 760 KB Partially correct
17 Partially correct 16 ms 764 KB Partially correct
18 Partially correct 15 ms 732 KB Partially correct
19 Partially correct 15 ms 764 KB Partially correct
20 Partially correct 11 ms 760 KB Partially correct
21 Incorrect 55 ms 1912 KB Expected int32, but "2500100000" found
22 Incorrect 55 ms 1912 KB Expected int32, but "2500100000" found
23 Incorrect 55 ms 1888 KB Expected int32, but "2500100000" found
24 Incorrect 55 ms 1912 KB Expected int32, but "2500100000" found
25 Incorrect 47 ms 1872 KB Expected int32, but "2500100000" found
26 Incorrect 55 ms 1912 KB Expected int32, but "2500100000" found
27 Incorrect 55 ms 1912 KB Expected int32, but "2500100000" found
28 Incorrect 60 ms 1912 KB Expected int32, but "2500100000" found
29 Incorrect 56 ms 1912 KB Expected int32, but "2500100000" found
30 Incorrect 41 ms 1912 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 376 KB Partially correct
32 Partially correct 2 ms 376 KB Partially correct