제출 #558016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
558016		hhhhaura	Gap (APIO16_gap)	C++14	0 / 100	42 ms	1148 KiB

gap

#include "gap.h"
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define ll long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#ifdef wiwihorz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("["+string(#a)+"] = ", a)
void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1,class ... T2>void kout(T1 a,T2 ... e){cerr<<a<<" ",kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif

void query(ll L, ll R, ll *mn, ll *mx) {
	if(L > R) *mn = -1, *mx = -1;
	else MinMax(L, R, mn, mx);
}
long long findGap(int T, int N) {
	if(T == 1) {
		ll ans = 1;
		ll L = 0, R = 1e18, l, r;
		query(L, R, &L, &R);
		while(L != R) {
			query(L + 1, R - 1, &l, &r);
			if(l == -1) {
				ans = max(ans, R - L);
				break;
			}
			ans = max({ans, l - L, R - r});
			L = l, R = r;
		}
		return ans;
	}
	else {
		ll L, R, cur = 1, x, y;
		query(0, 1e18, &L, &R);
		while(L < R) {
			while(query(L + 1, L + cur * 2, &x, &y), 
				x == -1) cur *= 2;
			cur = max(cur, x - L);
			L = y;
		}
		return cur;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp:6: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    6 | #pragma loop-opt(on)
      | 
gap.cpp:21:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |             ^~~~
gap.cpp:21:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |                    ^~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70