| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 984706 |
2024-05-17T03:12:04 Z |
gaga999 |
Gap (APIO16_gap) |
C++17 |
|
0 ms |
0 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 mn, llt mx);
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:88:21: error: invalid conversion from 'llt*' {aka 'long long int*'} to 'llt' {aka 'long long int'} [-fpermissive]
88 | MinMax(0, 1e18, &l, &r);
| ^~
| |
| llt* {aka long long int*}
gap.cpp:83:27: note: initializing argument 3 of 'void MinMax(llt, llt, llt, llt)'
83 | void MinMax(llt, llt, llt mn, llt mx);
| ~~~~^~
gap.cpp:88:25: error: invalid conversion from 'llt*' {aka 'long long int*'} to 'llt' {aka 'long long int'} [-fpermissive]
88 | MinMax(0, 1e18, &l, &r);
| ^~
| |
| llt* {aka long long int*}
gap.cpp:83:35: note: initializing argument 4 of 'void MinMax(llt, llt, llt, llt)'
83 | void MinMax(llt, llt, llt mn, llt mx);
| ~~~~^~
gap.cpp:89:9: warning: unused variable 'mx' [-Wunused-variable]
89 | llt mx = 0;
| ^~
