Submission #1015139

# Submission time Handle Problem Language Result Execution time Memory
1015139 2024-07-06T06:36:41 Z vjudge1 Gap (APIO16_gap) C++17
30 / 100
35 ms 1880 KB
#include<bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

ll subtask1(int N)
{
  int i = 0, j = N - 1;
  ll s = 0, e = 1e18;
  ll *mn = new ll, *mx = new ll;

  vector<ll> v(N);
  
  while(i <= j && s <= e)
    {
      MinMax(s, e, mn, mx);
      v[i] = *mn;
      v[j] = *mx;
      i++, j--;
      s = *mn + 1;
      e = *mx - 1;
    }

  ll ans = 0;
  for(int i = 1; i < v.size(); i++)
    ans = max(ans, v[i] - v[i - 1]);
  // cerr << ans << endl;
  return ans;
}

ll findGap(int T, int N)
{
  if(T == 1)
    return subtask1(N);
  return 1ll * N;
}

Compilation message

gap.cpp: In function 'll subtask1(int)':
gap.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for(int i = 1; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 7 ms 660 KB Output is correct
18 Correct 6 ms 856 KB Output is correct
19 Correct 6 ms 856 KB Output is correct
20 Correct 5 ms 660 KB Output is correct
21 Correct 25 ms 1880 KB Output is correct
22 Correct 30 ms 1872 KB Output is correct
23 Correct 23 ms 1880 KB Output is correct
24 Correct 23 ms 1780 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 35 ms 1880 KB Output is correct
27 Correct 25 ms 1880 KB Output is correct
28 Correct 24 ms 1880 KB Output is correct
29 Correct 25 ms 1880 KB Output is correct
30 Correct 26 ms 1880 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Incorrect 0 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Incorrect 3 ms 600 KB Output isn't correct
17 Incorrect 3 ms 600 KB Output isn't correct
18 Incorrect 3 ms 608 KB Output isn't correct
19 Incorrect 3 ms 540 KB Output isn't correct
20 Incorrect 2 ms 852 KB Output isn't correct
21 Incorrect 17 ms 1200 KB Output isn't correct
22 Incorrect 10 ms 1112 KB Output isn't correct
23 Incorrect 12 ms 1112 KB Output isn't correct
24 Incorrect 12 ms 1112 KB Output isn't correct
25 Incorrect 8 ms 1112 KB Output isn't correct
26 Incorrect 17 ms 1120 KB Output isn't correct
27 Incorrect 12 ms 1112 KB Output isn't correct
28 Incorrect 12 ms 1080 KB Output isn't correct
29 Incorrect 12 ms 1364 KB Output isn't correct
30 Incorrect 7 ms 1112 KB Output isn't correct
31 Incorrect 0 ms 340 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct