답안 #876451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876451	2023-11-21T18:54:16 Z	AlphaMale06	Gap (APIO16_gap)	C++14	30 / 100	31 ms	3792 KB

gap

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

long long findGap(int subt, int n){
    if(subt==1){
        ll mn=0;
        ll mx=1e18;
        ll a[n];
        for(int i=0; i< (n+1)/2; i++){
            MinMax(mn, mx, &mn, &mx);
            a[i]=mn;
            a[n-i-1]=mx;
            mn++;
            mx--;
        }
        ll ans=0;
        for(int i=1; i<n; i++){
            ans=max(ans, a[i]-a[i-1]);
        }
        return ans;
    }
    else{

    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	2392 KB	Output is correct
5	Correct	0 ms	2644 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Correct	1 ms	2388 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 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	2392 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	7 ms	2580 KB	Output is correct
17	Correct	7 ms	2588 KB	Output is correct
18	Correct	7 ms	2752 KB	Output is correct
19	Correct	7 ms	2588 KB	Output is correct
20	Correct	6 ms	2572 KB	Output is correct
21	Correct	28 ms	3588 KB	Output is correct
22	Correct	27 ms	3632 KB	Output is correct
23	Correct	28 ms	3628 KB	Output is correct
24	Correct	27 ms	3632 KB	Output is correct
25	Correct	24 ms	3620 KB	Output is correct
26	Correct	27 ms	3620 KB	Output is correct
27	Correct	27 ms	3624 KB	Output is correct
28	Correct	27 ms	3652 KB	Output is correct
29	Correct	27 ms	3792 KB	Output is correct
30	Correct	22 ms	3620 KB	Output is correct
31	Correct	0 ms	2392 KB	Output is correct
32	Correct	0 ms	2392 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Partially correct	0 ms	2392 KB	Partially correct
3	Partially correct	0 ms	2392 KB	Partially correct
4	Partially correct	0 ms	2392 KB	Partially correct
5	Partially correct	0 ms	2392 KB	Partially correct
6	Partially correct	1 ms	2392 KB	Partially correct
7	Partially correct	0 ms	2644 KB	Partially correct
8	Partially correct	0 ms	2392 KB	Partially correct
9	Partially correct	1 ms	2392 KB	Partially correct
10	Partially correct	1 ms	2392 KB	Partially correct
11	Partially correct	1 ms	2500 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	7 ms	2696 KB	Partially correct
17	Partially correct	7 ms	2584 KB	Partially correct
18	Partially correct	7 ms	2588 KB	Partially correct
19	Partially correct	7 ms	2736 KB	Partially correct
20	Partially correct	6 ms	2568 KB	Partially correct
21	Incorrect	28 ms	3628 KB	Expected int32, but "2500100000" found
22	Incorrect	31 ms	3624 KB	Expected int32, but "2500100000" found
23	Incorrect	27 ms	3628 KB	Expected int32, but "2500100000" found
24	Incorrect	27 ms	3632 KB	Expected int32, but "2500100000" found
25	Incorrect	24 ms	3624 KB	Expected int32, but "2500100000" found
26	Incorrect	27 ms	3624 KB	Expected int32, but "2500100000" found
27	Incorrect	27 ms	3632 KB	Expected int32, but "2500100000" found
28	Incorrect	27 ms	3628 KB	Expected int32, but "2500100000" found
29	Incorrect	27 ms	3624 KB	Expected int32, but "2500100000" found
30	Incorrect	22 ms	3628 KB	Expected int32, but "2500100000" found
31	Partially correct	1 ms	2644 KB	Partially correct
32	Partially correct	0 ms	2392 KB	Partially correct