답안 #565502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565502 2022-05-21T02:22:22 Z Spade1 Gap (APIO16_gap) C++14
83.5083 / 100
66 ms 1992 KB
#include<bits/stdc++.h>
#include "gap.h"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int NN = 1e5 + 10;


ll a[NN];
int cnt = 0;

ll findGap(int T, int N) {
    if (T == 1) {
        ll mn, mx;
        ll l = 0, r = 1e18;
        for (ll i = 0; i < (N+1)/2; ++i) {
            MinMax(l, r, &mn, &mx);
            a[cnt++] = mn;
            a[cnt++] = mx;
            l = mn+1, r = mx - 1;
        }
        sort(a, a+N);
        ll ans = 0;
        for (int i = 1; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
        return ans;
    }
    else {
        ll mn, mx;
        MinMax(0, 1e18, &mn, &mx);
        ll step = (mx - mn + N - 2)/(N - 1);
        ll ans = step;
        ll x, y, i, l = mn;
        for (; i + step < mx; i += step+1) {
            MinMax(i, i+step, &x, &y);
            if (x != -1) {
                ans = max(ans, x-l);
                l = y;
            }
        }
        MinMax(i, mx, &x, &y);
        if (x != -1) ans = max(ans, x-l);
        return ans;
    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:40:18: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
   40 |         for (; i + step < mx; i += step+1) {
      |                ~~^~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 12 ms 680 KB Output is correct
17 Correct 12 ms 592 KB Output is correct
18 Correct 12 ms 592 KB Output is correct
19 Correct 11 ms 592 KB Output is correct
20 Correct 8 ms 592 KB Output is correct
21 Correct 42 ms 1776 KB Output is correct
22 Correct 41 ms 1840 KB Output is correct
23 Correct 41 ms 1992 KB Output is correct
24 Correct 43 ms 1864 KB Output is correct
25 Correct 46 ms 1828 KB Output is correct
26 Correct 40 ms 1768 KB Output is correct
27 Correct 41 ms 1868 KB Output is correct
28 Correct 39 ms 1864 KB Output is correct
29 Correct 45 ms 1864 KB Output is correct
30 Correct 34 ms 1924 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 208 KB Partially correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Partially correct 1 ms 320 KB Partially correct
6 Partially correct 0 ms 208 KB Partially correct
7 Partially correct 0 ms 208 KB Partially correct
8 Partially correct 0 ms 208 KB Partially correct
9 Partially correct 0 ms 208 KB Partially correct
10 Correct 0 ms 208 KB Output is correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Partially correct 1 ms 336 KB Partially correct
16 Partially correct 12 ms 524 KB Partially correct
17 Partially correct 12 ms 544 KB Partially correct
18 Partially correct 13 ms 520 KB Partially correct
19 Partially correct 11 ms 512 KB Partially correct
20 Correct 6 ms 464 KB Output is correct
21 Partially correct 52 ms 1084 KB Partially correct
22 Partially correct 55 ms 1012 KB Partially correct
23 Partially correct 61 ms 1060 KB Partially correct
24 Partially correct 66 ms 1088 KB Partially correct
25 Partially correct 46 ms 1092 KB Partially correct
26 Partially correct 53 ms 1028 KB Partially correct
27 Partially correct 51 ms 1088 KB Partially correct
28 Partially correct 48 ms 1092 KB Partially correct
29 Partially correct 54 ms 1060 KB Partially correct
30 Correct 26 ms 976 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct