結果
問題 | No.814 ジジ抜き |
ユーザー |
![]() |
提出日時 | 2019-04-12 22:16:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 335 ms / 3,000 ms |
コード長 | 2,963 bytes |
コンパイル時間 | 2,089 ms |
コンパイル使用メモリ | 197,332 KB |
最終ジャッジ日時 | 2025-01-07 01:52:50 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = 1e9 + 7;const int inf = (1 << 30) - 1;const int64 infll = (1LL << 61) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename T >struct edge {int src, to;T cost;edge(int to, T cost) : src(-1), to(to), cost(cost) {}edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template< typename T >using Edges = vector< edge< T > >;template< typename T >using WeightedGraph = vector< Edges< T > >;using UnWeightedGraph = vector< vector< int > >;template< typename T >using Matrix = vector< vector< T > >;int main() {int N;cin >> N;vector< int64 > K(N), L(N), D(N);for(int i = 0; i < N; i++) {cin >> K[i] >> L[i] >> D[i];}int64 ok = infll, ng = -1;vector< int64 > p(61);p[0] = 1;for(int i = 1; i < 61; i++) p[i] = p[i - 1] * 2;auto check = [&](int64 pos) { // pos以下のカードの個数bool add = false;for(int i = 0; i < N; i++) {// L[i]+(x-1)*p[i]≦pos// x≦(pos-L[i])/(p[i]if(pos < L[i]) continue;int64 latte = max(0LL, (pos - L[i]) / p[D[i]] + 1);chmin(latte, K[i]);if(latte & 1) add ^= 1;}return add;};while(ok - ng > 1) {int64 mid = (ok + ng) / 2;if(check(mid)) ok = mid;else ng = mid;}cout << ok << endl;}