제출 #406368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406368		maomao90	A Difficult(y) Choice (BOI21_books)	C++17	100 / 100	2 ms	328 KiB

books

#include <bits/stdc++.h> 
#include "books.h"
using namespace std;

#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 100005

ll x[MAXN];
int todo[15];

void solve(int n, int k, ll a, int s) {
	ll small = 0;
	REP (i, 1, k + 1) {
		x[i] = skim(i);
		small += x[i];
	}
	REP (i, 1, k + 1) {
		todo[i] = i;
	}
	if (small > 2 * a) {
	   	impossible();
		return;
	}
	if (small >= a) {
		vi ans;
		REP (i, 1, k + 1) {
			ans.pb(i);
		}
		answer(ans);
		return;
	}
	int lo = 1, hi = n, mid;
	while (lo <= hi) {
		mid = hi + lo >> 1;
		if (x[mid] == 0) x[mid] = skim(mid);
		if (x[mid] < a) {
			lo = mid + 1;
		} else {
			hi = mid - 1;
		}
	}
	REP (i, lo - k, lo) {
		x[i] = skim(i);
	}
	RREP (i, k, 1) {
		small -= x[i];
		int id = lo - (k - i) - 1;
		small += x[id];
		todo[i] = id;
		if (small >= a) {
			vi ans;
			REP (i, 1, k + 1) {
				ans.pb(todo[i]);
			}
			answer(ans);
			return;
		}
	}
	if (x[lo] == 0) x[lo] = skim(lo);
	REP (i, 1, k) {
		todo[i] = i;
	}
	todo[k] = lo;
	small = 0;
	REP (i, 1, k + 1) {
		small += x[todo[i]];
	}
	if (small >= a && small <= 2 * a) {
		vi ans;
		REP (i, 1, k + 1) {
			ans.pb(todo[i]);
		}
		answer(ans);
		return;
	}
	impossible();
}

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

books.cpp: In function 'void solve(int, int, ll, int)':
books.cpp:54:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |   mid = hi + lo >> 1;
      |         ~~~^~~~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 20 / 20
• Subtask 7: 20 / 20