Submission #573969

# Submission time Handle Problem Language Result Execution time Memory
573969 2022-06-07T13:58:53 Z cadmiumsky Gap (APIO16_gap) C++14
70 / 100
52 ms 3220 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) {
    vector<ll> elem[2];
    while(l <= r) {
      MinMax(l, r, &l, &r);
      if(l == -1)
        break;
      elem[0].push_back(l);
      if(l != r)
        elem[1].push_back(r);
      l++;
      r--;
    }
    reverse(all(elem[1]));
    copy(all(elem[1]), back_inserter(elem[0]));
    ll mx = -1; 
    for(int i = 1; i < elem[0].size(); i++)
      mx = max(mx, elem[0][i] - elem[0][i - 1]);
    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:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i = 1; i < elem[0].size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~
gap.cpp:44: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]
   44 |   for(int i = 1; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Output isn't 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 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 1 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Correct 0 ms 208 KB Output is correct
11 Incorrect 1 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 1 ms 336 KB Output isn't correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Incorrect 8 ms 988 KB Output isn't correct
17 Incorrect 8 ms 936 KB Output isn't correct
18 Incorrect 9 ms 976 KB Output isn't correct
19 Incorrect 9 ms 932 KB Output isn't correct
20 Correct 8 ms 976 KB Output is correct
21 Incorrect 34 ms 2632 KB Output isn't correct
22 Incorrect 33 ms 2620 KB Output isn't correct
23 Incorrect 34 ms 2540 KB Output isn't correct
24 Incorrect 34 ms 2624 KB Output isn't correct
25 Incorrect 29 ms 2640 KB Output isn't correct
26 Incorrect 35 ms 2632 KB Output isn't correct
27 Incorrect 41 ms 2628 KB Output isn't correct
28 Incorrect 34 ms 2636 KB Output isn't correct
29 Incorrect 38 ms 2572 KB Output isn't correct
30 Correct 31 ms 2580 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is 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 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 868 KB Output is correct
17 Correct 12 ms 848 KB Output is correct
18 Correct 12 ms 840 KB Output is correct
19 Correct 12 ms 812 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 51 ms 2192 KB Output is correct
22 Correct 47 ms 2204 KB Output is correct
23 Correct 49 ms 2240 KB Output is correct
24 Correct 48 ms 2224 KB Output is correct
25 Correct 46 ms 3220 KB Output is correct
26 Correct 49 ms 2240 KB Output is correct
27 Correct 49 ms 2192 KB Output is correct
28 Correct 49 ms 2196 KB Output is correct
29 Correct 52 ms 2200 KB Output is correct
30 Correct 25 ms 1396 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct