oj.uz

Submission #984707

# Submission time Handle Problem Language Result Execution time Memory
984707 2024-05-17T03:12:18 Z gaga999 Gap (APIO16_gap) C++17
0 / 100
 13 ms 3176 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define inin(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef unsigned long long ull;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

void MinMax(llt, llt, llt *, llt *);

llt findGap(int t, int n)
{
    llt l, r;
    MinMax(0, 1e18, &l, &r);
    llt mx = 0;
    return 0;
}

Compilation message

gap.cpp: In function 'llt findGap(int, int)':
gap.cpp:89:9: warning: unused variable 'mx' [-Wunused-variable]
   89 |     llt mx = 0;
      |         ^~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 1 ms 2644 KB Output isn't correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 0 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2400 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 3 ms 2588 KB Output isn't correct
17 Incorrect 3 ms 2588 KB Output isn't correct
18 Incorrect 4 ms 2572 KB Output isn't correct
19 Incorrect 3 ms 2576 KB Output isn't correct
20 Incorrect 2 ms 2572 KB Output isn't correct
21 Incorrect 12 ms 2968 KB Output isn't correct
22 Incorrect 12 ms 3104 KB Output isn't correct
23 Incorrect 12 ms 3024 KB Output isn't correct
24 Incorrect 12 ms 2852 KB Output isn't correct
25 Incorrect 9 ms 2852 KB Output isn't correct
26 Incorrect 12 ms 2852 KB Output isn't correct
27 Incorrect 12 ms 2860 KB Output isn't correct
28 Incorrect 12 ms 2852 KB Output isn't correct
29 Incorrect 12 ms 2852 KB Output isn't correct
30 Incorrect 7 ms 2844 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2488 KB Output isn't correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Incorrect 0 ms 2392 KB Output isn't correct
5 Incorrect 0 ms 2392 KB Output isn't correct
6 Incorrect 0 ms 2392 KB Output isn't correct
7 Incorrect 1 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 0 ms 2392 KB Output isn't correct
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 3 ms 2724 KB Output isn't correct
17 Incorrect 4 ms 2584 KB Output isn't correct
18 Incorrect 3 ms 2588 KB Output isn't correct
19 Incorrect 4 ms 2580 KB Output isn't correct
20 Incorrect 2 ms 2572 KB Output isn't correct
21 Incorrect 13 ms 2648 KB Output isn't correct
22 Incorrect 12 ms 2852 KB Output isn't correct
23 Incorrect 12 ms 2852 KB Output isn't correct
24 Incorrect 12 ms 2864 KB Output isn't correct
25 Incorrect 10 ms 3176 KB Output isn't correct
26 Incorrect 12 ms 2856 KB Output isn't correct
27 Incorrect 12 ms 3024 KB Output isn't correct
28 Incorrect 12 ms 2856 KB Output isn't correct
29 Incorrect 12 ms 2852 KB Output isn't correct
30 Incorrect 7 ms 3100 KB Output isn't correct
31 Incorrect 0 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2392 KB Output isn't correct