Submission #947246

# Submission time Handle Problem Language Result Execution time Memory
947246 2024-03-15T18:36:53 Z NValchanov Gap (APIO16_gap) C++17
0 / 100
38 ms 3996 KB
#include <bits/stdc++.h>
#include "gap.h"

#define endl '\n'

using namespace std;

typedef long long ll;

const ll INF = 1e18;

ll t,n;

ll solve_t1()
{
    vector <ll> a;
    ll left = 0;
    ll right = INF;
    ll minel;
    ll maxel;
    ll cnt = 0;

    while(left <= right && 2 * cnt < n)
    {
        MinMax(left, right, &minel, &maxel);

        a.push_back(minel);
        a.push_back(maxel);

        cnt++;

        left = minel + 1;
        right = maxel - 1;
    }
    sort(a.begin(), a.end());
    ll ans = 0;
    for(int i = 1; i < n; i++)
    {
        ans = max(ans, a[i] - a[i - 1]);
    }
    return ans;
}

ll solve_t2()
{
    return -1;
}

ll findGap(int T, int N)
{
    t = T;
    n = N;
    if(t == 1)
        return solve_t1();
    else if(t == 2)
        return solve_t2();
    else
        assert(false);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2432 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 9 ms 2832 KB Output is correct
17 Correct 8 ms 2904 KB Output is correct
18 Correct 8 ms 2840 KB Output is correct
19 Correct 9 ms 2828 KB Output is correct
20 Correct 7 ms 2824 KB Output is correct
21 Correct 31 ms 3956 KB Output is correct
22 Correct 36 ms 3812 KB Output is correct
23 Correct 36 ms 3996 KB Output is correct
24 Correct 31 ms 3992 KB Output is correct
25 Correct 38 ms 3988 KB Output is correct
26 Correct 34 ms 3992 KB Output is correct
27 Correct 38 ms 3992 KB Output is correct
28 Correct 34 ms 3992 KB Output is correct
29 Correct 31 ms 3988 KB Output is correct
30 Correct 29 ms 3996 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 1 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2388 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 4 ms 2584 KB Output isn't correct
17 Incorrect 4 ms 2580 KB Output isn't correct
18 Incorrect 3 ms 2592 KB Output isn't correct
19 Incorrect 4 ms 2580 KB Output isn't correct
20 Incorrect 3 ms 2572 KB Output isn't correct
21 Incorrect 14 ms 2856 KB Output isn't correct
22 Incorrect 12 ms 3008 KB Output isn't correct
23 Incorrect 15 ms 2820 KB Output isn't correct
24 Incorrect 12 ms 2860 KB Output isn't correct
25 Incorrect 10 ms 2856 KB Output isn't correct
26 Incorrect 12 ms 2856 KB Output isn't correct
27 Incorrect 16 ms 3112 KB Output isn't correct
28 Incorrect 12 ms 2860 KB Output isn't correct
29 Incorrect 12 ms 2860 KB Output isn't correct
30 Incorrect 7 ms 2848 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2396 KB Output isn't correct