답안 #304760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304760 2020-09-21T20:31:04 Z rocks03 Gap (APIO16_gap) C++14
30 / 100
57 ms 1964 KB
#include<bits/stdc++.h>
#define ll long long
using namespace std;

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

long long findGap(int T, int N){
	ll arr[N];
    ll l = 0, r = LLONG_MAX;
    for(int i = 0, j = N-1; i <= j; i++, j--){
        MinMax(l, r, &arr[i], &arr[j]);
    	l = arr[i] + 1, r = arr[j] - 1;
    }
    ll ans = 0;
   	for(int i = 1; i < N; i++){
    	ans = max(ans, arr[i] - arr[i-1]);
    }
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 15 ms 660 KB Output is correct
17 Correct 12 ms 768 KB Output is correct
18 Correct 13 ms 768 KB Output is correct
19 Correct 13 ms 768 KB Output is correct
20 Correct 9 ms 768 KB Output is correct
21 Correct 49 ms 1912 KB Output is correct
22 Correct 57 ms 1912 KB Output is correct
23 Correct 50 ms 1964 KB Output is correct
24 Correct 51 ms 1940 KB Output is correct
25 Correct 49 ms 1912 KB Output is correct
26 Correct 52 ms 1912 KB Output is correct
27 Correct 54 ms 1912 KB Output is correct
28 Correct 49 ms 1912 KB Output is correct
29 Correct 50 ms 1912 KB Output is correct
30 Correct 38 ms 1896 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Partially correct 0 ms 384 KB Partially correct
3 Partially correct 0 ms 384 KB Partially correct
4 Partially correct 0 ms 384 KB Partially correct
5 Partially correct 0 ms 384 KB Partially correct
6 Partially correct 0 ms 384 KB Partially correct
7 Partially correct 0 ms 384 KB Partially correct
8 Partially correct 0 ms 384 KB Partially correct
9 Partially correct 0 ms 384 KB Partially correct
10 Partially correct 0 ms 384 KB Partially correct
11 Partially correct 1 ms 384 KB Partially correct
12 Partially correct 2 ms 384 KB Partially correct
13 Partially correct 1 ms 384 KB Partially correct
14 Partially correct 1 ms 384 KB Partially correct
15 Partially correct 1 ms 384 KB Partially correct
16 Partially correct 12 ms 768 KB Partially correct
17 Partially correct 16 ms 768 KB Partially correct
18 Partially correct 12 ms 768 KB Partially correct
19 Partially correct 13 ms 768 KB Partially correct
20 Partially correct 9 ms 768 KB Partially correct
21 Incorrect 51 ms 1828 KB Expected int32, but "2500100000" found
22 Incorrect 54 ms 1864 KB Expected int32, but "2500100000" found
23 Incorrect 50 ms 1912 KB Expected int32, but "2500100000" found
24 Incorrect 51 ms 1912 KB Expected int32, but "2500100000" found
25 Incorrect 49 ms 1912 KB Expected int32, but "2500100000" found
26 Incorrect 49 ms 1912 KB Expected int32, but "2500100000" found
27 Incorrect 50 ms 1948 KB Expected int32, but "2500100000" found
28 Incorrect 51 ms 1912 KB Expected int32, but "2500100000" found
29 Incorrect 50 ms 1912 KB Expected int32, but "2500100000" found
30 Incorrect 37 ms 1912 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 384 KB Partially correct
32 Partially correct 0 ms 384 KB Partially correct