Submission #1003699

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1003699	2024-06-20T15:48:28 Z	MarwenElarbi	Gap (APIO16_gap)	C++17	12.6461 / 100	32 ms	2868 KB

gap

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e3+5;
void MinMax(long long, long long, long long*, long long*);
long long findGap(int T, int N)
{
    long long lst,mx;
    MinMax(0,1e18,&lst,&mx);
    long long ans=1;
    while(mx!=lst){
        long long a,b;
        MinMax(lst+1,lst+ans,&a,&b);
        if(a==-1){
            while(a==-1){
                ans*=2;
                MinMax(lst+1,lst+ans,&a,&b);
            }
            ans=a-lst;
            lst=b;
        }else{
            lst=b;
        }
    }
    return ans;
}

Subtask #1

0 / 30.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	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	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Incorrect	1 ms	2392 KB	Output isn't correct
16	Correct	4 ms	2392 KB	Output is correct
17	Correct	4 ms	2480 KB	Output is correct
18	Correct	6 ms	600 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Correct	4 ms	600 KB	Output is correct
21	Correct	17 ms	1200 KB	Output is correct
22	Correct	17 ms	2648 KB	Output is correct
23	Correct	16 ms	1112 KB	Output is correct
24	Correct	17 ms	1112 KB	Output is correct
25	Incorrect	31 ms	1112 KB	Output isn't correct
26	Correct	16 ms	1112 KB	Output is correct
27	Correct	24 ms	1112 KB	Output is correct
28	Correct	18 ms	1112 KB	Output is correct
29	Correct	16 ms	1112 KB	Output is correct
30	Correct	17 ms	2648 KB	Output is correct
31	Incorrect	0 ms	344 KB	Output isn't correct
32	Incorrect	0 ms	344 KB	Output isn't correct

Subtask #2

12.6460549623 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	344 KB	Partially correct
2	Partially correct	0 ms	2392 KB	Partially correct
3	Partially correct	0 ms	344 KB	Partially correct
4	Partially correct	0 ms	344 KB	Partially correct
5	Partially correct	0 ms	344 KB	Partially 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	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	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Partially correct	0 ms	344 KB	Partially correct
16	Correct	6 ms	600 KB	Output is correct
17	Correct	6 ms	600 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	5 ms	600 KB	Output is correct
20	Correct	4 ms	600 KB	Output is correct
21	Correct	16 ms	1104 KB	Output is correct
22	Correct	21 ms	1112 KB	Output is correct
23	Correct	18 ms	1112 KB	Output is correct
24	Correct	16 ms	1112 KB	Output is correct
25	Partially correct	32 ms	2868 KB	Partially correct
26	Correct	21 ms	1316 KB	Output is correct
27	Correct	18 ms	1112 KB	Output is correct
28	Correct	23 ms	1112 KB	Output is correct
29	Correct	25 ms	1112 KB	Output is correct
30	Correct	14 ms	2648 KB	Output is correct
31	Partially correct	0 ms	344 KB	Partially correct
32	Correct	0 ms	344 KB	Output is correct