oj.uz

Submission #946586

# Submission time Handle Problem Language Result Execution time Memory
946586 2024-03-14T19:05:42 Z n3rm1n Gap (APIO16_gap) C++17
30 / 100
 166 ms 3460 KB 
#include<bits/stdc++.h>
#include "gap.h"

using namespace std;
const long long MAXN = 2e5 + 10;
long long a[MAXN];
long long findGap(int T, int N)
{
    if(T == 1)
    {
        long long s = 0, t = (long long)(1e18);
        long long mn, mx;
        long long n = N;
        long long filled0 = 0, filled1 = n+1;

        while(filled0 + 1 <= filled1 - 1)
        {

            MinMax(s, t, &mn, &mx);

            if(mn == mx)
            {
                filled0 ++;
                a[filled0] = mn;
                n --;
                break;
            }
            filled0 ++;
            filled1 --;
            n-= 2;
            a[filled0] = mn;
            a[filled1] = mx;

            s = mn + 1;
            t = mx - 1;
        }
        long long ans = -1;
        //cout << "n is " << n << endl;
        //cout << a[1] << " ";
        for (long long i = 2; i <= N; ++ i)
        {
            //cout << a[i] << " ";
            ans = max(ans, (long long) (a[i] - a[i-1]));
        }
        //cout << endl;
        //cout << ans << endl;
        return ans;
    }
    long long s = 0, t = (long long)(1e18), mn, mx;
    MinMax(s, t, &mn, &mx);
    long long curr = mn, last = mx;

    long long ans = 1;
    while(curr < last)
    {
       // cout << curr << endl;
       // cout << "* " << ans << endl;
        s = curr + 1;
        t = curr + ans;
        if(s < t)
        {
            MinMax(s, t, &mn, &mx);

        if(mn != -1 && mx != -1)
        {
            curr = mx;
            //cout << "move to " << curr << endl;
            continue;
        }
        }
        long long lf = ans, rth = last - curr, mid, newans = -1;
        long long found = 0;
        /// koga se e promenilo za pyrvi pyt
        while(lf <= rth)
        {
            mid = (rth - lf)/2 + lf;
            s = curr + 1;
            t = curr + mid + 1;
            MinMax(s, t, &mn, &mx);
            if(mn == -1 && mx == -1)
            {
                lf = mid + 1;
            }
            else
            {
                rth = mid - 1;
                found = mn;
                newans = mid;
            }
        }

       // cout << "found is " << found << endl;
        if(newans != -1)ans = max(ans, found - curr);
        else break;
        curr = found;

    }
    return ans;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 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 8 ms 2540 KB Output is correct
17 Correct 8 ms 2536 KB Output is correct
18 Correct 8 ms 2672 KB Output is correct
19 Correct 7 ms 2536 KB Output is correct
20 Correct 6 ms 2532 KB Output is correct
21 Correct 29 ms 3460 KB Output is correct
22 Correct 29 ms 3444 KB Output is correct
23 Correct 31 ms 3460 KB Output is correct
24 Correct 32 ms 3452 KB Output is correct
25 Correct 26 ms 3452 KB Output is correct
26 Correct 30 ms 3428 KB Output is correct
27 Correct 30 ms 3452 KB Output is correct
28 Correct 30 ms 3428 KB Output is correct
29 Correct 29 ms 3444 KB Output is correct
30 Correct 25 ms 3448 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2644 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2644 KB Partially correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2644 KB Partially correct
10 Partially correct 1 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 6 ms 2544 KB Partially correct
17 Partially correct 5 ms 2536 KB Partially correct
18 Partially correct 5 ms 2540 KB Partially correct
19 Partially correct 5 ms 2544 KB Partially correct
20 Partially correct 36 ms 2792 KB Partially correct
21 Partially correct 18 ms 2932 KB Partially correct
22 Partially correct 19 ms 2684 KB Partially correct
23 Partially correct 18 ms 2936 KB Partially correct
24 Partially correct 19 ms 2684 KB Partially correct
25 Partially correct 38 ms 2676 KB Partially correct
26 Partially correct 19 ms 2684 KB Partially correct
27 Partially correct 19 ms 2680 KB Partially correct
28 Partially correct 19 ms 2684 KB Partially correct
29 Partially correct 19 ms 2676 KB Partially correct
30 Incorrect 166 ms 2676 KB Expected int32, but "4438064721" found
31 Partially correct 1 ms 2392 KB Partially correct
32 Correct 1 ms 2392 KB Output is correct