Submission #530266

#TimeUsernameProblemLanguageResultExecution timeMemory
530266huangqrA Difficult(y) Choice (BOI21_books)C++14
0 / 100
12 ms1864 KiB
#include <bits/stdc++.h>

#include "books.h"

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.
//
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(int N, int K, long long A, int S) {
    // TODO implement this function
    vector<ll>a(N+1,0),ps(N+1,0);
    for(int i=1;i<=N;i++)a[i]=skim(i),ps[i]=a[i]+ps[i-1];
    for(int i=K;i<=N;i++){
    	//cout<<"ps["<<i<<"] - ps["<<i-K<<"]: "<<ps[i]-ps[i-K]<<"\n";
    	if(ps[i]-ps[i-K]>=A&&ps[i]-ps[i-K]<=2*A){
    		vector<int>ret;
    		for(int j=i-K+1;j<=i;j++)ret.push_back(j);
    		answer(ret);
    		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...