답안 #875941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875941 2023-11-20T19:56:28 Z PagodePaiva Gap (APIO16_gap) C++17
30 / 100
32 ms 2240 KB
#include<bits/stdc++.h>
#define MAXN 100010

using namespace std;

#include "gap.h"

int query(long long a, long long b, long long &x, long long &y){
    MinMax(a, b, &x, &y);
    return 0;
}

long long res[MAXN];

long long findGap(int T, int n){
    long long l = 0, r = 1e18;

    for(int i = 0;i < (n+1)/2;i++){
        query(l, r, res[i], res[n-i-1]);
        // cout << res[i] << 
        l = res[i]+1;
        r = res[n-i-1]-1;
    }

    long long resp = 0;

    for(int i = 1;i < n;i++){
        resp = max(resp, res[i] - res[i-1]);
    }

    return resp;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 648 KB Output is correct
17 Correct 7 ms 636 KB Output is correct
18 Correct 7 ms 788 KB Output is correct
19 Correct 7 ms 812 KB Output is correct
20 Correct 6 ms 624 KB Output is correct
21 Correct 28 ms 1976 KB Output is correct
22 Correct 29 ms 1880 KB Output is correct
23 Correct 28 ms 1772 KB Output is correct
24 Correct 28 ms 1976 KB Output is correct
25 Correct 25 ms 1964 KB Output is correct
26 Correct 29 ms 1836 KB Output is correct
27 Correct 32 ms 1980 KB Output is correct
28 Correct 29 ms 1780 KB Output is correct
29 Correct 28 ms 2240 KB Output is correct
30 Correct 23 ms 1968 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 7 ms 856 KB Partially correct
17 Partially correct 7 ms 648 KB Partially correct
18 Partially correct 7 ms 644 KB Partially correct
19 Partially correct 7 ms 648 KB Partially correct
20 Partially correct 7 ms 800 KB Partially correct
21 Incorrect 29 ms 1980 KB Expected int32, but "2500100000" found
22 Incorrect 28 ms 1984 KB Expected int32, but "2500100000" found
23 Incorrect 28 ms 1960 KB Expected int32, but "2500100000" found
24 Incorrect 28 ms 1984 KB Expected int32, but "2500100000" found
25 Incorrect 29 ms 1960 KB Expected int32, but "2500100000" found
26 Incorrect 32 ms 1984 KB Expected int32, but "2500100000" found
27 Incorrect 28 ms 1988 KB Expected int32, but "2500100000" found
28 Incorrect 28 ms 1912 KB Expected int32, but "2500100000" found
29 Incorrect 28 ms 1984 KB Expected int32, but "2500100000" found
30 Incorrect 24 ms 2208 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct