oj.uz

답안 #1036280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036280 2024-07-27T08:08:42 Z trucmai A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 344 KB 
#include "books.h"
#include <bits/stdc++.h>
#ifdef LOCAL
#include "/home/trcmai/code/tools.h"
#define debug(x...)                                                           \
    cerr << "\e[91m" << __func__ << ":" << __LINE__ << " [" << #x << "] = ["; \
    _print(x);                                                                \
    cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;

map<int, ll> a;
ll ask(int i)
{
    return (a.count(i) ? a[i] : a[i] = skim(i));
}
void solve(int N, int K, long long A, int S)
{
    int l = 1, r = N - K + 1;
    // Check xem ton tai doan lien tiep nao thoa man khong
    while (l <= r) {
        int m = (r + l) >> 1;
        ll sum = 0;
        for (int i = m; i <= m - K + 1; ++i) {
            if (sum > 2 * A)
                break;
            sum += ask(i);
        }
        if (sum >= A && sum <= 2 * A) {
            vector<int> res;
            for (int i = m; i <= m - K + 1; ++i)
                res.emplace_back(i);
            answer(res);
        }
        if (sum < A)
            l = m + 1;
        if (sum > 2 * A)
            r = m - 1;
    }
    // Neu khong ton tai, check xem doan [1,k - 1] co ghep duoc voi vi tri ith thoa man khong
    l = K, r = N - K + 1;
    int pos = -1;
    while (l <= r) {
        int m = (r + l) >> 1;
        ll val = ask(m);
        if (val >= A) {
            pos = m;
            r = m - 1;
        } else
            l = m + 1;
    }
    if (pos != -1) {
        vector<int> res;
        ll sum = ask(pos);
        for (int i = 1; i <= K - 1; ++i) {
            sum += ask(i);
        }
        if (sum >= A && sum <= 2 * A) {
            for (int i = 1; i <= K - 1; ++i)
                res.emplace_back(i);
            res.emplace_back(pos);
            answer(res);
        }
    }
    impossible();
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 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 #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -