제출 #976898

#제출 시각아이디문제언어결과실행 시간메모리
976898penguin133A Difficult(y) Choice (BOI21_books)C++17
10 / 100
1 ms600 KiB
#include<vector> #include<cstdio> #include<set> #include<cstdlib> #include<cstdarg> #include<cassert> #include"books.h" #include <bits/stdc++.h> using namespace std; #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve(int N, int K, long long A, int S) { long long lo = K, hi = N, tmp = N + 1, val = -1; while(lo <= hi){ int mid = (lo + hi) >> 1; long long tot = 0; for(int j = mid - K + 1; j <= mid; j++)tot += skim(j); if(tot >= A)tmp = mid, hi = mid - 1, val = tot; else lo = mid + 1; } if(val == -1 || val > 2 * A)impossible(); else { vector <int> v; for(int j = tmp - K + 1; j <= tmp; j++)v.push_back(j); answer(v); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...