# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950899 | 2024-03-21T01:39:28 Z | pcc | A Difficult(y) Choice (BOI21_books) | C++17 | 1 ms | 608 KB |
#include <bits/stdc++.h> #include "books.h" #define ll long long #define pll pair<ll,ll> #define fs first #define sc second using namespace std; /* // // --- Sample implementation for the task books --- // // To compile this program with the sample grader, place: // books.h books_sample.cpp sample_grader.cpp // in a single folder and run: // g++ books_sample.cpp sample_grader.cpp // in this folder. // if (skim(2) == 42) { impossible(); } else { answer({1, 3}); } */ map<ll,ll> mp; ll ask(ll p){ if(mp.find(p) != mp.end())return mp[p]; else return mp[p] = skim(p); } void solve(int N, int K, long long A, int S) { vector<pll> v; ll sum = 0; for(int i = 1;i<=K;i++){ v.push_back(pll(i,ask(i))); } ll l = 1,r = N+1; while(l+1<r){ ll mid = (l+r)>>1; if(ask(mid)>=A)r = mid; else l = mid; } if(r != N+1){ ll sum = ask(r); int cnt = 1; vector<int> ans = {r}; for(int i = 1;i<=K;i++){ if(ans.size()>=K)break; if(i == ans[0])continue; ans.push_back(i); sum += ask(i); } if(sum>=A&&sum<=A*2){ answer(ans); return; } } for(int i = 1;i<=K;i++){ v.push_back(pll(r-i,ask(r-i))); } sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); for(int i = 0;i<(1<<v.size());i++){ if(__builtin_popcount(i) != K)continue; ll sum = 0; for(int j = 0;j<v.size();j++){ if(i&(1<<j))sum += v[j].sc; } if(sum>=A&&sum<=A*2){ vector<int> ans; for(int j = 0;j<v.size();j++){ if(i&(1<<j))ans.push_back(j); } answer(ans); return; } } impossible(); return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Incorrect |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Incorrect |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 600 KB | Output is correct |
3 | Correct | 0 ms | 608 KB | Output is correct |
4 | Runtime error | 1 ms | 432 KB | Execution killed with signal 13 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 600 KB | Output is correct |
3 | Correct | 0 ms | 608 KB | Output is correct |
4 | Runtime error | 1 ms | 432 KB | Execution killed with signal 13 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 600 KB | Output is correct |
3 | Correct | 0 ms | 608 KB | Output is correct |
4 | Runtime error | 1 ms | 432 KB | Execution killed with signal 13 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 600 KB | Output is correct |
3 | Correct | 0 ms | 608 KB | Output is correct |
4 | Runtime error | 1 ms | 432 KB | Execution killed with signal 13 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 600 KB | Output is correct |
3 | Correct | 0 ms | 608 KB | Output is correct |
4 | Runtime error | 1 ms | 432 KB | Execution killed with signal 13 |
5 | Halted | 0 ms | 0 KB | - |