답안 #843895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843895 2023-09-04T16:41:00 Z Elvin_Fritl Gap (APIO16_gap) C++17
30 / 100
36 ms 4236 KB
#include "gap.h"

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


long long findGap(int t, int n)
{
    long long mn = 0 , mx = 1e18;
    vector<long long>v;
    int tr = (n+1)/2;
    while(tr--)
    {
        MinMax(mn , mx , &mn , &mx);
        v.push_back(mn);
        if(mn != mx)
            v.push_back(mx);
        mn++;
        mx--;
    }
    sort(v.begin() , v.end());
    long long res = 0;
    for(int i=1;i<n;i++){
        res = max(v[i] - v[i-1] , res);
    }
	return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2844 KB Output is correct
17 Correct 8 ms 2844 KB Output is correct
18 Correct 8 ms 2840 KB Output is correct
19 Correct 8 ms 2840 KB Output is correct
20 Correct 7 ms 2828 KB Output is correct
21 Correct 32 ms 3988 KB Output is correct
22 Correct 32 ms 3856 KB Output is correct
23 Correct 33 ms 4000 KB Output is correct
24 Correct 32 ms 3996 KB Output is correct
25 Correct 30 ms 3992 KB Output is correct
26 Correct 32 ms 3996 KB Output is correct
27 Correct 32 ms 3992 KB Output is correct
28 Correct 32 ms 4168 KB Output is correct
29 Correct 35 ms 3936 KB Output is correct
30 Correct 28 ms 3972 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2552 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 1 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 8 ms 2840 KB Partially correct
17 Partially correct 8 ms 2836 KB Partially correct
18 Partially correct 8 ms 2844 KB Partially correct
19 Partially correct 8 ms 2836 KB Partially correct
20 Partially correct 7 ms 2820 KB Partially correct
21 Incorrect 36 ms 4236 KB Expected int32, but "2500100000" found
22 Incorrect 32 ms 4004 KB Expected int32, but "2500100000" found
23 Incorrect 31 ms 3808 KB Expected int32, but "2500100000" found
24 Incorrect 33 ms 3944 KB Expected int32, but "2500100000" found
25 Incorrect 29 ms 3996 KB Expected int32, but "2500100000" found
26 Incorrect 34 ms 4000 KB Expected int32, but "2500100000" found
27 Incorrect 32 ms 4044 KB Expected int32, but "2500100000" found
28 Incorrect 32 ms 4000 KB Expected int32, but "2500100000" found
29 Incorrect 32 ms 3992 KB Expected int32, but "2500100000" found
30 Incorrect 28 ms 3984 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct