Submission #900933

#TimeUsernameProblemLanguageResultExecution timeMemory
900933simona1230A Difficult(y) Choice (BOI21_books)C++17
20 / 100
155 ms1252 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; long long n,k,a,s; long long x[120001]; void solve(int N,int K,long long A,int S) { n=N; k=K; a=A; s=S; for(long long i=1;i<=n;i++) { x[i]=skim(i); } long long fk=0,fs=0,fsidx=0; for(int i=1;i<=n;i++) { if(i<k)fk+=x[i]; if(x[i]>=a) { fs=x[i]; fsidx=i; break; } } if(fs+fk>=a&&fs+fk<=2*a) { vector<int> ans; for(int i=1;i<k;i++) ans.push_back(i); ans.push_back(fsidx); answer(ans); return; } long long sum=0; for(int i=1;i<=n;i++) { sum+=x[i]; if(i>k)sum-=x[i-k]; if(i>=k&&sum>=a&&sum<=2*a) { vector<int> ans; for(int j=i-k+1;j<=i;j++) ans.push_back(j); answer(ans); return; } } impossible(); }
#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...