답안 #1076764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076764 2024-08-26T16:20:02 Z TFF Gap (APIO16_gap) C++17
30 / 100
36 ms 2176 KB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int t, int n) {
    long long mn, mx, left, right;
    left = 0;
    right = 1000000000000000000;
    mn = mx = 0;
    vector<long long> arr1, arr2;
    for (int i = 0; i < (n + 1) / 2; i++) {
        MinMax(left, right, &mn, &mx);
        arr1.push_back(mn);
        arr2.push_back(mx);
        left = mn + 1;
        right = mx - 1;
    }
    long long ans = arr2.back() - arr1.back();
    for (int i = 0; i < (int)arr1.size() - 1; i++) {
        ans = max(ans, arr1[i + 1] - arr1[i]);
    }
    for (int i = (int)arr2.size() - 2; i >= 0; i--) {
        ans = max(ans, arr2[i] - arr2[i + 1]);
    }
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 344 KB Output is correct
12 Correct 1 ms 596 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 344 KB Output is correct
16 Correct 9 ms 856 KB Output is correct
17 Correct 7 ms 948 KB Output is correct
18 Correct 7 ms 856 KB Output is correct
19 Correct 7 ms 856 KB Output is correct
20 Correct 6 ms 956 KB Output is correct
21 Correct 25 ms 2172 KB Output is correct
22 Correct 26 ms 1916 KB Output is correct
23 Correct 34 ms 1916 KB Output is correct
24 Correct 36 ms 2176 KB Output is correct
25 Correct 23 ms 2088 KB Output is correct
26 Correct 29 ms 1916 KB Output is correct
27 Correct 26 ms 1924 KB Output is correct
28 Correct 26 ms 1916 KB Output is correct
29 Correct 25 ms 1924 KB Output is correct
30 Correct 23 ms 1924 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 1 ms 344 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 0 ms 344 KB Partially correct
14 Partially correct 0 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 856 KB Partially correct
18 Partially correct 6 ms 856 KB Partially correct
19 Partially correct 8 ms 856 KB Partially correct
20 Partially correct 6 ms 964 KB Partially correct
21 Incorrect 25 ms 1924 KB Expected int32, but "2500100000" found
22 Incorrect 34 ms 1972 KB Expected int32, but "2500100000" found
23 Incorrect 26 ms 1924 KB Expected int32, but "2500100000" found
24 Incorrect 26 ms 1916 KB Expected int32, but "2500100000" found
25 Incorrect 25 ms 1924 KB Expected int32, but "2500100000" found
26 Incorrect 35 ms 1916 KB Expected int32, but "2500100000" found
27 Incorrect 35 ms 1916 KB Expected int32, but "2500100000" found
28 Incorrect 26 ms 2108 KB Expected int32, but "2500100000" found
29 Incorrect 26 ms 1924 KB Expected int32, but "2500100000" found
30 Incorrect 21 ms 2120 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct