제출 #598429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598429		MohamedFaresNebili	커다란 상품 (IOI17_prize)	C++14	0 / 100	100 ms	1824 KiB

prize

#include <bits/stdc++.h>
#include "prize.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

                using namespace std;

                using ll = long long;
                using ld = long double;
                using ii = pair<ll, ll>;
                using vi = vector<int>;

                #define ff first
                #define ss second
                #define pb push_back
                #define all(x) (x).begin(), (x).end()
                #define lb lower_bound

                const int MOD = 1e9 + 7;

                int A[200005][2];
                int curr = 0, res = -1;

                vector<int> query(int k) {
                    if(A[k][0] != -1)
                        return {A[k][0], A[k][1]};
                    return ask(k);
                }
                void solve(int l, int r) {
                    if(res != -1) return;
                    int md = (l + r) / 2;
                    vector<int> V = query(r);
                    query(l), query(md);
                    if(V[0] + V[1] == curr && V[0] == A[l][0])
                        return;
                    if(l == r) {
                        if(A[l][0] + A[l][1] == 0)
                            res = l;
                        return;
                    }
                    solve(l, md); solve(md + 1, r);
                }

                int find_best(int N) {
                    memset(A, -1, sizeof A); int i = 0;
                    for(int l = 0; l < min(N, 474); l++) {
                        vector<int> V = query(l);
                        if(V[0] + V[1] > curr) i = l;
                        curr = max(curr, V[0] + V[1]);
                    }
                    solve(i, N - 1);
                    return res;
                }

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80