Submission #574221

# Submission time Handle Problem Language Result Execution time Memory
574221 2022-06-08T08:08:08 Z cadmiumsky Gap (APIO16_gap) C++14
70 / 100
91 ms 5780 KB
#include "gap.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll findGap(int t, int n) {
  // cerr << t << ' ' << n << '\n';
    ll l = 0, r = 1e18;
  if(t == 1) {
    set<ll> elem;
    for(int i = 1; i <= n; i++)
      MinMax(l, r, &l, &r);
    l--;
    r++;
    while(l <= r && n > 0) {
      if(l + 1 > r - 1)
        break;
      MinMax(l + 1, r - 1, &l, &r);
      if(l == -1)
        break;
      elem.insert(l);
      elem.insert(r);
      n -= 1 + (l != r);
      // cerr << n << ' ' ;
    }
    auto it = elem.begin();
    it++;
    ll mx = - 1;
    for(auto i = next(it); i != elem.end(); i++)
      mx = max(mx, *it - *prev(it));
    return mx;
  }
  MinMax(l, r, &l, &r);
  ll mx = r;
  vector<pii> v;
  ll minl = (r - l + n - 2) / (n - 1);
  v.emplace_back(l, l);
  // cerr << l << ' ' << r << ' ' << minl << '\n';
  for(ll i = l; i < mx; i += minl) {
    // cerr << i << ' ' << i + minl << ' ' << mx << '\n';
    MinMax(i, min(mx, i + minl) - 1, &l, &r);
    if(l == -1)
      continue;
    v.emplace_back(l, r);
  }
  v.emplace_back(mx, mx);
  mx = -1;
  for(int i = 1; i < v.size(); i++)
    mx = max(v[i].first - v[i - 1].second, mx);
	return mx;
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int i = 1; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Incorrect 0 ms 208 KB Output isn't correct
3 Incorrect 1 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 1 ms 208 KB Output isn't correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Incorrect 1 ms 208 KB Output isn't correct
11 Incorrect 2 ms 336 KB Output isn't correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 2 ms 336 KB Output isn't correct
15 Incorrect 2 ms 336 KB Output isn't correct
16 Incorrect 17 ms 1668 KB Output isn't correct
17 Incorrect 17 ms 1580 KB Output isn't correct
18 Incorrect 17 ms 1588 KB Output isn't correct
19 Incorrect 21 ms 1608 KB Output isn't correct
20 Incorrect 17 ms 1684 KB Output isn't correct
21 Incorrect 91 ms 5780 KB Output isn't correct
22 Incorrect 72 ms 5672 KB Output isn't correct
23 Incorrect 85 ms 5664 KB Output isn't correct
24 Incorrect 84 ms 5780 KB Output isn't correct
25 Incorrect 69 ms 5664 KB Output isn't correct
26 Incorrect 74 ms 5704 KB Output isn't correct
27 Incorrect 71 ms 5664 KB Output isn't correct
28 Incorrect 75 ms 5704 KB Output isn't correct
29 Incorrect 77 ms 5708 KB Output isn't correct
30 Incorrect 66 ms 5704 KB Output isn't correct
31 Incorrect 1 ms 208 KB Output isn't correct
32 Incorrect 1 ms 208 KB Output isn't correct
# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 13 ms 892 KB Output is correct
17 Correct 15 ms 808 KB Output is correct
18 Correct 13 ms 888 KB Output is correct
19 Correct 16 ms 876 KB Output is correct
20 Correct 6 ms 532 KB Output is correct
21 Correct 52 ms 2236 KB Output is correct
22 Correct 51 ms 2168 KB Output is correct
23 Correct 51 ms 2244 KB Output is correct
24 Correct 63 ms 2228 KB Output is correct
25 Correct 54 ms 3236 KB Output is correct
26 Correct 52 ms 2240 KB Output is correct
27 Correct 54 ms 2232 KB Output is correct
28 Correct 64 ms 2164 KB Output is correct
29 Correct 55 ms 2204 KB Output is correct
30 Correct 28 ms 1468 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct