oj.uz

답안 #47287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47287 2018-04-30T06:23:07 Z Talant Gap (APIO16_gap) C++17
30 / 100
 131 ms 6956 KB 
#include <bits/stdc++.h>

#include "gap.h"
//#include "grader.cpp"

using namespace std;

const long long M = (1e6 + 5);

long long ans = 0;
long long a[M];
long long l,r = 1e18;
long long ll,rr;
set<long long> st;

void f (long long mn,long long mx) {
      if (mn != -1)
            st.insert(mn);
      if (mx != -1)
            st.insert(mx);
      if (mn >= mx)
            return;

      if (mx - mn < 4) {
            if (mn + 1 <= mx - 1) {
                  long long l = 0,r = 0;
                  MinMax(mn + 1,mx - 1,&l,&r);
                  f(l,r);
            }
            return;
      }
      long long m = mn + (mx - mn) / 3;
      long long m1 = mx - (mx - mn) / 3;

      if (mn + 1 <= m - 1) {
            long long l = 0,r = 0;
            MinMax(mn + 1,m - 1,&l,&r);
            f(l,r);
      }
      if (m <= m1) {
            long long l = 0,r = 0;
            MinMax(m,m1,&l,&r);
            f(l,r);
      }
      if (m1 + 1 <= mx - 1) {
            long long l = 0,r = 0;
            MinMax(m1 + 1,mx - 1,&l,&r);
            f(l,r);
      }
}
long long findGap(int T, int N)
{
      if (T == 1 || N < 1e2) {
            long long o = (N + 1) / 2;
            ll = 1,rr = N;
            while (o --) {
                  MinMax(l,r,&a[ll],&a[rr]);
                  l = a[ll] + 1,r = a[rr] - 1;
                  ll ++,rr --;
            }
            for (long long i = 1; i < N; i ++)
                  ans = max(ans,a[i + 1] - a[i]);
            return ans;
      }
      else {
            long long l = 0,r = 0;
            MinMax(0,1e18,&l,&r);
            f(l,r);

            for (auto to : st) {
                  a[ll] = to;
                  ll ++;
            }
            for (long long i = 1; i < N; i ++)
                  ans = max(ans,a[i + 1] - a[i]);
            return ans;
      }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 644 KB Output is correct
7 Correct 2 ms 644 KB Output is correct
8 Correct 2 ms 644 KB Output is correct
9 Correct 2 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 3 ms 644 KB Output is correct
12 Correct 3 ms 644 KB Output is correct
13 Correct 3 ms 644 KB Output is correct
14 Correct 3 ms 644 KB Output is correct
15 Correct 3 ms 644 KB Output is correct
16 Correct 15 ms 856 KB Output is correct
17 Correct 15 ms 904 KB Output is correct
18 Correct 19 ms 904 KB Output is correct
19 Correct 15 ms 904 KB Output is correct
20 Correct 11 ms 904 KB Output is correct
21 Correct 53 ms 2056 KB Output is correct
22 Correct 64 ms 2064 KB Output is correct
23 Correct 53 ms 2132 KB Output is correct
24 Correct 54 ms 2132 KB Output is correct
25 Correct 46 ms 2132 KB Output is correct
26 Correct 56 ms 2192 KB Output is correct
27 Correct 57 ms 2192 KB Output is correct
28 Correct 54 ms 2192 KB Output is correct
29 Correct 53 ms 2192 KB Output is correct
30 Correct 40 ms 2192 KB Output is correct
31 Correct 2 ms 2192 KB Output is correct
32 Correct 2 ms 2192 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2192 KB Output is correct
2 Partially correct 2 ms 2192 KB Partially correct
3 Partially correct 2 ms 2192 KB Partially correct
4 Partially correct 2 ms 2192 KB Partially correct
5 Partially correct 2 ms 2192 KB Partially correct
6 Partially correct 2 ms 2192 KB Partially correct
7 Partially correct 2 ms 2192 KB Partially correct
8 Partially correct 2 ms 2192 KB Partially correct
9 Partially correct 2 ms 2192 KB Partially correct
10 Partially correct 2 ms 2192 KB Partially correct
11 Partially correct 3 ms 2192 KB Partially correct
12 Partially correct 3 ms 2192 KB Partially correct
13 Partially correct 3 ms 2192 KB Partially correct
14 Partially correct 3 ms 2192 KB Partially correct
15 Partially correct 3 ms 2192 KB Partially correct
16 Partially correct 29 ms 2192 KB Partially correct
17 Partially correct 28 ms 2192 KB Partially correct
18 Partially correct 29 ms 2192 KB Partially correct
19 Partially correct 32 ms 2192 KB Partially correct
20 Partially correct 18 ms 2192 KB Partially correct
21 Partially correct 122 ms 6908 KB Partially correct
22 Partially correct 131 ms 6908 KB Partially correct
23 Partially correct 111 ms 6908 KB Partially correct
24 Partially correct 114 ms 6908 KB Partially correct
25 Partially correct 108 ms 6908 KB Partially correct
26 Partially correct 109 ms 6908 KB Partially correct
27 Partially correct 106 ms 6908 KB Partially correct
28 Partially correct 111 ms 6908 KB Partially correct
29 Partially correct 123 ms 6956 KB Partially correct
30 Partially correct 73 ms 6956 KB Partially correct
31 Partially correct 2 ms 6956 KB Partially correct
32 Incorrect 2 ms 6956 KB Output isn't correct