oj.uz

Submission #581174

# Submission time Handle Problem Language Result Execution time Memory
581174 2022-06-22T10:10:59 Z l_reho A Difficult(y) Choice (BOI21_books) C++14
20 / 100
 242 ms 796 KB 
#include <bits/stdc++.h>

#include "books.h"

#include<vector>
#include<cstdio>
#include<set>
#include<cstdlib>
#include<cstdarg>
#include<cassert>


#include<bits/stdc++.h>

typedef long long ll;

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.
//


void solve(int N, int K, long long A, int S) {
    // TODO implement this function
    vector<long long> vals;
    
    for(int i = 1; i <= N; i++){
		long long curr_diff = skim(i);
		vals.push_back(curr_diff);
	}
	

	ll sum = 0;
	
	deque<int> ans;
	vector<int> res;
	
	for(int i = 0; i < K; i++){
		ans.push_back(i+1);
		sum += vals[i];
	}
		
	if(sum >= A && sum <= 2*A){
	
		for(int i = 0; i < K; i++) res.push_back(ans[i]);
		answer(res);
	}
		
	ans.pop_back();
	sum -= vals[K-1];
	
	int last = N;
	
	for(int j = 0; j <= last-K; j++){
		// cout<<sum<<endl;
		if(sum + vals[last-1] >= A){
			
			for(int i = j+K-1; i < last; i++){
				sum += vals[i];
				ans.push_back(i+1);
				// test
				if(sum >= A && sum <= 2*A){
					for(int k = 0; k < K; k++) res.push_back(ans[k]);
					answer(res);
				}
						
				sum -= vals[i];
				ans.pop_back();
					
				if(sum+vals[i] > 2*A){
					last = i;
					break;
				}
				
			}
		}
		
		sum -= vals[j];
		ans.pop_front();
		
		sum += vals[j+K-1];
		ans.push_back(j+K);
		
	}
	
	
	impossible();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 9 ms 300 KB Output is correct
3 Correct 9 ms 304 KB Output is correct
4 Correct 6 ms 300 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 11 ms 296 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 8 ms 308 KB Output is correct
5 Correct 9 ms 296 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 11 ms 300 KB Output is correct
8 Correct 12 ms 208 KB Output is correct
9 Correct 232 ms 776 KB Output is correct
10 Correct 197 ms 664 KB Output is correct
11 Correct 242 ms 644 KB Output is correct
12 Correct 230 ms 668 KB Output is correct
13 Correct 228 ms 648 KB Output is correct
14 Correct 227 ms 740 KB Output is correct
15 Correct 233 ms 656 KB Output is correct
16 Correct 140 ms 796 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 280 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 280 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 280 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 280 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 280 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -