답안 #95568

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95568	2019-02-02T05:57:50 Z	lyc	Gap (APIO16_gap)	C++14	30 / 100	47 ms	1932 KB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

long long findGap(int T, int N)
{
    ll s, t, mn, mx;
    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;

    ll ans = 0;
    for (int i = 1; i < N; ++i) {
        ans = max(ans, arr[i]-arr[i-1]);
    }
	return ans;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	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	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	3 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	13 ms	760 KB	Output is correct
17	Correct	12 ms	760 KB	Output is correct
18	Correct	13 ms	760 KB	Output is correct
19	Correct	13 ms	760 KB	Output is correct
20	Correct	10 ms	772 KB	Output is correct
21	Correct	46 ms	1912 KB	Output is correct
22	Correct	46 ms	1916 KB	Output is correct
23	Correct	47 ms	1912 KB	Output is correct
24	Correct	46 ms	1912 KB	Output is correct
25	Correct	40 ms	1912 KB	Output is correct
26	Correct	46 ms	1912 KB	Output is correct
27	Correct	46 ms	1912 KB	Output is correct
28	Correct	46 ms	1824 KB	Output is correct
29	Correct	44 ms	1912 KB	Output is correct
30	Correct	33 ms	1912 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Partially correct	2 ms	380 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	376 KB	Partially correct
11	Partially correct	2 ms	376 KB	Partially correct
12	Partially correct	2 ms	376 KB	Partially correct
13	Partially correct	2 ms	376 KB	Partially correct
14	Partially correct	2 ms	376 KB	Partially correct
15	Partially correct	3 ms	376 KB	Partially correct
16	Partially correct	12 ms	760 KB	Partially correct
17	Partially correct	13 ms	760 KB	Partially correct
18	Partially correct	13 ms	760 KB	Partially correct
19	Partially correct	13 ms	760 KB	Partially correct
20	Partially correct	10 ms	760 KB	Partially correct
21	Incorrect	46 ms	1932 KB	Expected int32, but "2500100000" found
22	Incorrect	47 ms	1912 KB	Expected int32, but "2500100000" found
23	Incorrect	46 ms	1912 KB	Expected int32, but "2500100000" found
24	Incorrect	47 ms	1912 KB	Expected int32, but "2500100000" found
25	Incorrect	39 ms	1916 KB	Expected int32, but "2500100000" found
26	Incorrect	46 ms	1912 KB	Expected int32, but "2500100000" found
27	Incorrect	45 ms	1912 KB	Expected int32, but "2500100000" found
28	Incorrect	46 ms	1912 KB	Expected int32, but "2500100000" found
29	Incorrect	46 ms	1912 KB	Expected int32, but "2500100000" found
30	Incorrect	34 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