Submission #1076454

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1076454	2024-08-26T14:03:17 Z	miguel_tp	Gap (APIO16_gap)	C++17	0 / 100	36 ms	1944 KB

gap

#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

long long part1(int N)
{
    long long mn = -1, mx = 1e18 + 2;
    vector<long long> arr (N);
    int i = 0, j = N-1;
    while(i <= j)
    {
        long long a = mn+1, b = mx-1;
        if(a > b)
            break;
        MinMax(a, b, &mn, &mx);

        arr[i] = mn;
        arr[j] = mx;
        i++;
        j--;
    }

    long long max_diff = 0;
    for(int i = 0; i < N-1; i++)
        max_diff = max(max_diff, arr[i+1] - arr[i]);

    return max_diff;
}


long long part2(int N)
{
    return 0;
}


long long findGap(int T, int N)
{
    if(T == 1)
        return part1(N);
    else
        return part2(N);
}

Subtask #1

0 / 30.0

#	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	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 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	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	9 ms	704 KB	Output is correct
17	Correct	6 ms	660 KB	Output is correct
18	Correct	9 ms	600 KB	Output is correct
19	Correct	7 ms	856 KB	Output is correct
20	Correct	5 ms	856 KB	Output is correct
21	Correct	25 ms	1880 KB	Output is correct
22	Correct	36 ms	1876 KB	Output is correct
23	Correct	25 ms	1880 KB	Output is correct
24	Correct	29 ms	1788 KB	Output is correct
25	Correct	25 ms	1880 KB	Output is correct
26	Correct	26 ms	1880 KB	Output is correct
27	Correct	27 ms	1880 KB	Output is correct
28	Correct	29 ms	1944 KB	Output is correct
29	Correct	25 ms	1880 KB	Output is correct
30	Correct	21 ms	1880 KB	Output is correct
31	Incorrect	1 ms	344 KB	Output isn't correct
32	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 70.0

#	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	1 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	1 ms	344 KB	Output isn't correct
12	Incorrect	1 ms	344 KB	Output isn't correct
13	Incorrect	1 ms	344 KB	Output isn't correct
14	Incorrect	0 ms	344 KB	Output isn't correct
15	Incorrect	1 ms	344 KB	Output isn't correct
16	Incorrect	4 ms	600 KB	Output isn't correct
17	Incorrect	3 ms	600 KB	Output isn't correct
18	Incorrect	4 ms	600 KB	Output isn't correct
19	Incorrect	3 ms	600 KB	Output isn't correct
20	Incorrect	2 ms	600 KB	Output isn't correct
21	Incorrect	12 ms	1172 KB	Output isn't correct
22	Incorrect	12 ms	1112 KB	Output isn't correct
23	Incorrect	13 ms	1112 KB	Output isn't correct
24	Incorrect	12 ms	1112 KB	Output isn't correct
25	Incorrect	10 ms	1112 KB	Output isn't correct
26	Incorrect	12 ms	1112 KB	Output isn't correct
27	Incorrect	12 ms	1112 KB	Output isn't correct
28	Incorrect	21 ms	1104 KB	Output isn't correct
29	Incorrect	20 ms	1112 KB	Output isn't correct
30	Incorrect	8 ms	1112 KB	Output isn't correct
31	Incorrect	1 ms	344 KB	Output isn't correct
32	Incorrect	0 ms	344 KB	Output isn't correct