이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |