답안 #1036289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036289 2024-07-27T08:14:20 Z trucmai A Difficult(y) Choice (BOI21_books) C++17
45 / 100
1 ms 596 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 ull unsigned long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;

map<int, ull> a;
ull 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;
        ull 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;
        if (ask(m) >= A) {
            pos = m;
            r = m - 1;
        } else
            l = m + 1;
    }
    if (pos != -1) {
        ull sum = ask(pos);
        for (int i = 1; i <= K - 1; ++i)
            sum += ask(i);
        if (sum >= A && sum <= 2 * A) {
            vector<int> res;
            for (int i = 1; i <= K - 1; ++i)
                res.emplace_back(i);
            res.emplace_back(pos);
            answer(res);
        }
    }
    impossible();
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:33:21: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   33 |             if (sum > 2 * A)
      |                 ~~~~^~~~~~~
books.cpp:37:17: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   37 |         if (sum >= A && sum <= 2 * A) {
      |             ~~~~^~~~
books.cpp:37:29: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   37 |         if (sum >= A && sum <= 2 * A) {
      |                         ~~~~^~~~~~~~
books.cpp:43:17: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   43 |         if (sum < A)
      |             ~~~~^~~
books.cpp:45:17: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   45 |         if (sum > 2 * A)
      |             ~~~~^~~~~~~
books.cpp:53:20: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   53 |         if (ask(m) >= A) {
      |             ~~~~~~~^~~~
books.cpp:63:17: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   63 |         if (sum >= A && sum <= 2 * A) {
      |             ~~~~^~~~
books.cpp:63:29: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   63 |         if (sum >= A && sum <= 2 * A) {
      |                         ~~~~^~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 1 ms 436 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
# 결과 실행 시간 메모리 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 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 1 ms 436 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 436 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 432 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 436 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 436 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 440 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Incorrect 1 ms 436 KB Incorrect
50 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 1 ms 436 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 432 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 428 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 428 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 432 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 432 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Runtime error 0 ms 344 KB Execution killed with signal 13
47 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 1 ms 436 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 436 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 432 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 436 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 436 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 440 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Incorrect 1 ms 436 KB Incorrect
50 Halted 0 ms 0 KB -