Submission #1003700

# Submission time Handle Problem Language Result Execution time Memory
1003700 2024-06-20T15:49:36 Z MarwenElarbi Gap (APIO16_gap) C++17
0 / 100
32 ms 2800 KB
#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);
            }
            int cur=lst+ans;
            ans=a-lst;
            lst=cur;
        }else{
            lst=b;
        }
    }
    return ans;
}

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 2392 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 2392 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 1 ms 2392 KB Output is correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Correct 0 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Output isn't correct
16 Correct 5 ms 2392 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Incorrect 3 ms 600 KB Output isn't correct
21 Correct 23 ms 1112 KB Output is correct
22 Correct 26 ms 1112 KB Output is correct
23 Correct 21 ms 2648 KB Output is correct
24 Correct 28 ms 1112 KB Output is correct
25 Incorrect 29 ms 1112 KB Output isn't correct
26 Correct 20 ms 1232 KB Output is correct
27 Correct 18 ms 1112 KB Output is correct
28 Correct 25 ms 1112 KB Output is correct
29 Correct 24 ms 2800 KB Output is correct
30 Incorrect 15 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
# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Partially correct 0 ms 344 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 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 340 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 8 ms 600 KB Partially correct
17 Partially correct 8 ms 600 KB Partially correct
18 Partially correct 5 ms 600 KB Partially correct
19 Partially correct 8 ms 588 KB Partially correct
20 Incorrect 4 ms 600 KB Output isn't correct
21 Partially correct 20 ms 1112 KB Partially correct
22 Partially correct 30 ms 1112 KB Partially correct
23 Partially correct 31 ms 1112 KB Partially correct
24 Partially correct 25 ms 2648 KB Partially correct
25 Partially correct 32 ms 1112 KB Partially correct
26 Partially correct 21 ms 1112 KB Partially correct
27 Partially correct 29 ms 1112 KB Partially correct
28 Partially correct 27 ms 2800 KB Partially correct
29 Partially correct 21 ms 1112 KB Partially correct
30 Incorrect 15 ms 1240 KB Output isn't correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct