oj.uz

답안 #47285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47285 2018-04-30T06:21:17 Z Talant Gap (APIO16_gap) C++17
43.0082 / 100
 126 ms 6940 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 < 1e3) {
            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 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 16 ms 924 KB Output is correct
17 Correct 16 ms 1004 KB Output is correct
18 Correct 15 ms 1004 KB Output is correct
19 Correct 14 ms 1004 KB Output is correct
20 Correct 11 ms 1004 KB Output is correct
21 Correct 53 ms 2156 KB Output is correct
22 Correct 72 ms 2156 KB Output is correct
23 Correct 54 ms 2156 KB Output is correct
24 Correct 76 ms 2208 KB Output is correct
25 Correct 47 ms 2208 KB Output is correct
26 Correct 54 ms 2208 KB Output is correct
27 Correct 54 ms 2208 KB Output is correct
28 Correct 56 ms 2208 KB Output is correct
29 Correct 53 ms 2208 KB Output is correct
30 Correct 41 ms 2208 KB Output is correct
31 Correct 2 ms 2208 KB Output is correct
32 Correct 2 ms 2208 KB Output is correct

Subtask #2
13.008169338 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2208 KB Output is correct
2 Partially correct 2 ms 2208 KB Partially correct
3 Partially correct 2 ms 2208 KB Partially correct
4 Partially correct 2 ms 2208 KB Partially correct
5 Partially correct 2 ms 2208 KB Partially correct
6 Partially correct 2 ms 2208 KB Partially correct
7 Partially correct 2 ms 2208 KB Partially correct
8 Partially correct 2 ms 2208 KB Partially correct
9 Partially correct 2 ms 2208 KB Partially correct
10 Partially correct 2 ms 2208 KB Partially correct
11 Partially correct 4 ms 2208 KB Partially correct
12 Partially correct 3 ms 2208 KB Partially correct
13 Partially correct 3 ms 2208 KB Partially correct
14 Partially correct 3 ms 2208 KB Partially correct
15 Partially correct 3 ms 2208 KB Partially correct
16 Partially correct 35 ms 2208 KB Partially correct
17 Partially correct 27 ms 2208 KB Partially correct
18 Partially correct 39 ms 2208 KB Partially correct
19 Partially correct 27 ms 2208 KB Partially correct
20 Partially correct 17 ms 2208 KB Partially correct
21 Partially correct 109 ms 6908 KB Partially correct
22 Partially correct 119 ms 6940 KB Partially correct
23 Partially correct 126 ms 6940 KB Partially correct
24 Partially correct 114 ms 6940 KB Partially correct
25 Partially correct 122 ms 6940 KB Partially correct
26 Partially correct 116 ms 6940 KB Partially correct
27 Partially correct 109 ms 6940 KB Partially correct
28 Partially correct 108 ms 6940 KB Partially correct
29 Partially correct 120 ms 6940 KB Partially correct
30 Partially correct 70 ms 6940 KB Partially correct
31 Partially correct 2 ms 6940 KB Partially correct
32 Partially correct 2 ms 6940 KB Partially correct