Submission #591363

# Submission time Handle Problem Language Result Execution time Memory
591363 2022-07-07T10:46:03 Z MohamedFaresNebili Gap (APIO16_gap) C++14
30 / 100
2000 ms 1872 KB
#include <bits/stdc++.h>
#include "gap.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
            using namespace std;
 
            using ll = long long;
            using ld = long double;
 
            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
 
            ll findGap(int T, int N) {
                if(T == 1) {
                    vector<ll> A(N + 2);
                    A[0] = -1ll, A[N + 1] = 1000000000ll * 1000000000ll + 1ll;
                    for(ll l = 1; l <= (N + 1) / 2; l++) {
                        MinMax(A[l - 1] + 1, A[N - l + 2] - 1, &A[l], &A[N - l + 1]);
                    }
                    ll res = 0;
                    for(ll l = 2; l <= N; l++)
                        res = max(res, A[l] - A[l - 1]);
                    return res;
                }
                vector<ll> S; ll mn, mx, res = 0;
                MinMax(0ll, 1000000000000000000ll, &mn, &mx);
                ll L = mn, R = mx; ll md = (R - L + N) / N;
                S.push_back(L);
                while(L < R) {
                    MinMax(L + 1, min(R - 1, L + md), &mn, &mx);
                    if(mx == -1 || mx == -1) continue;
                    S.push_back(mn); S.push_back(mx); L += md;
                }
                S.push_back(R);
                for(int l = 1; l < S.size(); l++)
                    res = max(res, S[l] - S[l - 1]);
                return res;
            }

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:40:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 for(int l = 1; l < S.size(); l++)
      |                                ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 9 ms 716 KB Output is correct
17 Correct 9 ms 720 KB Output is correct
18 Correct 9 ms 632 KB Output is correct
19 Correct 9 ms 688 KB Output is correct
20 Correct 7 ms 612 KB Output is correct
21 Correct 36 ms 1824 KB Output is correct
22 Correct 43 ms 1828 KB Output is correct
23 Correct 34 ms 1864 KB Output is correct
24 Correct 36 ms 1852 KB Output is correct
25 Correct 37 ms 1768 KB Output is correct
26 Correct 36 ms 1824 KB Output is correct
27 Correct 34 ms 1832 KB Output is correct
28 Correct 34 ms 1872 KB Output is correct
29 Correct 32 ms 1860 KB Output is correct
30 Correct 29 ms 1784 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3064 ms 208 KB Time limit exceeded
2 Execution timed out 3080 ms 208 KB Time limit exceeded
3 Execution timed out 3089 ms 208 KB Time limit exceeded
4 Execution timed out 3060 ms 208 KB Time limit exceeded
5 Execution timed out 3064 ms 208 KB Time limit exceeded
6 Execution timed out 3073 ms 228 KB Time limit exceeded
7 Execution timed out 3054 ms 256 KB Time limit exceeded
8 Execution timed out 3083 ms 208 KB Time limit exceeded
9 Execution timed out 3048 ms 208 KB Time limit exceeded
10 Execution timed out 3079 ms 208 KB Time limit exceeded
11 Execution timed out 3058 ms 208 KB Time limit exceeded
12 Execution timed out 3028 ms 208 KB Time limit exceeded
13 Execution timed out 3068 ms 208 KB Time limit exceeded
14 Execution timed out 3069 ms 208 KB Time limit exceeded
15 Execution timed out 3070 ms 208 KB Time limit exceeded
16 Execution timed out 3076 ms 548 KB Time limit exceeded
17 Execution timed out 3061 ms 464 KB Time limit exceeded
18 Execution timed out 3054 ms 464 KB Time limit exceeded
19 Execution timed out 3056 ms 464 KB Time limit exceeded
20 Execution timed out 3075 ms 464 KB Time limit exceeded
21 Execution timed out 3057 ms 1056 KB Time limit exceeded
22 Execution timed out 3050 ms 1048 KB Time limit exceeded
23 Execution timed out 3055 ms 968 KB Time limit exceeded
24 Execution timed out 3051 ms 1056 KB Time limit exceeded
25 Execution timed out 3039 ms 1060 KB Time limit exceeded
26 Execution timed out 3035 ms 960 KB Time limit exceeded
27 Execution timed out 3058 ms 996 KB Time limit exceeded
28 Execution timed out 3073 ms 1056 KB Time limit exceeded
29 Execution timed out 3036 ms 976 KB Time limit exceeded
30 Execution timed out 3042 ms 1104 KB Time limit exceeded
31 Execution timed out 3081 ms 208 KB Time limit exceeded
32 Execution timed out 3096 ms 208 KB Time limit exceeded