oj.uz

Submission #658797

# Submission time Handle Problem Language Result Execution time Memory
658797 2022-11-15T01:18:25 Z 1zaid1 A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
#include "books.h"

using namespace std;

map<int, long long> fr;
long long ski(int p) {
    if (!fr[p]) fr[p] = skim(p);
    return fr[p];
}

void solve(int n, int k, long long a, int s) {
    vector<int> v;
    for (int i = k; i >= 1; i--) v.push_back(i);
    int sum = 0; for (int i:v) sum += ski(i);
    
    int i = n;
    for (int &x:v) {
        int p = (1<<17);
        sum -= ski(x);
        while (p /= 2) {
            if (x+p < i && sum + ski(x+p) <= 2*a) x += p;
        } sum += ski(x);
        i = x;
    } answer(v);
}

/*

*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -