oj.uz

Submission #950092

# Submission time Handle Problem Language Result Execution time Memory
950092 2024-03-20T05:14:09 Z pcc A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
//
// --- 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});
}

*/

void solve(int N, int K, long long A, int S) {
    // TODO implement this function
	vector<pll> v;
	ll sum = 0;
	for(int i = 1;i<=K;i++){
		v.push_back(pll(i,skim(i)));
		sum += v.back().sc;
	}
	if(sum>=A*2){
		impossible();
		return;
	}
	for(int i = K-1;i>=0;i--){
		if(sum>=A&&sum<=A*2)break;
		ll l = i+1,r = (i+1==v.size()?N:v.back().fs-1);
		while(l != r){
			ll mid = (l+r)>>1;
			if(skim(mid)+sum-v[i].sc>=A)r = mid;
			else l = mid+1;
		}
		sum -= v[i].sc;
		v[i] = pll(l,skim(l));
		sum += v[i].sc;
	}
	vector<int> ans;
	for(auto &i:v)ans.push_back(i.fs);
	answer(ans);
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   ll l = i+1,r = (i+1==v.size()?N:v.back().fs-1);
      |                   ~~~^~~~~~~~~~

Subtask #1
0 / 5.0

# 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 -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 1 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -