Submission #35677

# Submission time Handle Problem Language Result Execution time Memory
35677 2017-11-28T05:48:56 Z funcsr Gap (APIO16_gap) C++14
72.604 / 100
66 ms 7280 KB
#include "gap.h"
#include <iostream>
#include <vector>
#include <deque>
#include <cassert>
#include <algorithm>
#include <tuple>
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(xs) xs.begin(), xs.end()
#define pb push_back
using namespace std;
typedef pair<long long, long long> P;

P query(long long s, long long t) {
  long long mn, mx;
  MinMax(s, t, &mn, &mx);
  return P(mn, mx);
}

long long findGap(int T, int N) {
  //if (T == 1 || N <= 8) {
  if (T == 1 || N <= 30) {
    long long lo = 0, hi = 1000000000000000000LL;
    vector<long long> fr, br;
    rep(_, (N+1)/2) {
      long long a, b;
      tie(a, b) = query(lo, hi);
      lo = a+1, hi = b-1;
      fr.pb(a);
      if (a != b) br.pb(b);
    }
    reverse(all(br));
    for (long long x : br) fr.pb(x);
    //for (long long x: fr)cout<<x<<",";cout<<"\n";
    long long m = 0;
    rep(i, N-1) m = max(m, fr[i+1]-fr[i]);
    return m;
  }
  else {
    long long lo, hi;
    tie(lo, hi) = query(0, 1000000000000000000LL);
    long long m = 1, pos = lo+1;
    while (pos < hi) {
      //cout<<"pos="<<pos<<", m="<<m<<"\n";
      long long a, b;
      long long r = m;
      while (true) {
        tie(a, b) = query(pos, min(pos+r, hi));
        //cout<<"query("<<pos<<","<<pos+r<<") -> ("<<a<<","<<b<<")\n";
        if (a != -1) break;
        r *= 2;
      }
      //cout<<"a="<<a<<", b="<<b<<"\n";
      m = max(m, a-(pos-1));
      pos = b+1;
    }
    return m;
  }
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5140 KB Output is correct
2 Correct 0 ms 5140 KB Output is correct
3 Correct 0 ms 5140 KB Output is correct
4 Correct 0 ms 5140 KB Output is correct
5 Correct 0 ms 5140 KB Output is correct
6 Correct 0 ms 5140 KB Output is correct
7 Correct 0 ms 5140 KB Output is correct
8 Correct 0 ms 5140 KB Output is correct
9 Correct 0 ms 5140 KB Output is correct
10 Correct 0 ms 5140 KB Output is correct
11 Correct 0 ms 5140 KB Output is correct
12 Correct 0 ms 5140 KB Output is correct
13 Correct 0 ms 5140 KB Output is correct
14 Correct 0 ms 5140 KB Output is correct
15 Correct 0 ms 5140 KB Output is correct
16 Correct 9 ms 5692 KB Output is correct
17 Correct 13 ms 5692 KB Output is correct
18 Correct 13 ms 5692 KB Output is correct
19 Correct 13 ms 5692 KB Output is correct
20 Correct 3 ms 5692 KB Output is correct
21 Correct 56 ms 7280 KB Output is correct
22 Correct 46 ms 7280 KB Output is correct
23 Correct 56 ms 7280 KB Output is correct
24 Correct 43 ms 7280 KB Output is correct
25 Correct 43 ms 7280 KB Output is correct
26 Correct 59 ms 7280 KB Output is correct
27 Correct 59 ms 7280 KB Output is correct
28 Correct 56 ms 7280 KB Output is correct
29 Correct 49 ms 7280 KB Output is correct
30 Correct 36 ms 7280 KB Output is correct
31 Correct 0 ms 5140 KB Output is correct
32 Correct 0 ms 5140 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5140 KB Output is correct
2 Partially correct 0 ms 5140 KB Partially correct
3 Partially correct 0 ms 5140 KB Partially correct
4 Partially correct 0 ms 5140 KB Partially correct
5 Partially correct 0 ms 5140 KB Partially correct
6 Correct 0 ms 5140 KB Output is correct
7 Correct 0 ms 5140 KB Output is correct
8 Correct 0 ms 5140 KB Output is correct
9 Correct 0 ms 5140 KB Output is correct
10 Correct 0 ms 5140 KB Output is correct
11 Correct 0 ms 5140 KB Output is correct
12 Correct 0 ms 5140 KB Output is correct
13 Correct 0 ms 5140 KB Output is correct
14 Correct 0 ms 5140 KB Output is correct
15 Partially correct 0 ms 5140 KB Partially correct
16 Correct 3 ms 5140 KB Output is correct
17 Correct 6 ms 5140 KB Output is correct
18 Correct 3 ms 5140 KB Output is correct
19 Correct 9 ms 5140 KB Output is correct
20 Correct 6 ms 5140 KB Output is correct
21 Correct 33 ms 5140 KB Output is correct
22 Correct 29 ms 5140 KB Output is correct
23 Correct 33 ms 5140 KB Output is correct
24 Correct 33 ms 5140 KB Output is correct
25 Partially correct 66 ms 5140 KB Partially correct
26 Correct 33 ms 5140 KB Output is correct
27 Correct 39 ms 5140 KB Output is correct
28 Correct 36 ms 5140 KB Output is correct
29 Correct 26 ms 5140 KB Output is correct
30 Correct 19 ms 5140 KB Output is correct
31 Partially correct 0 ms 5140 KB Partially correct
32 Correct 0 ms 5140 KB Output is correct