제출 #673674

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673674		stanislavpolyn	A Difficult(y) Choice (BOI21_books)	C++17	컴파일 에러	0 ms	0 KiB

books

#include <bits/stdc++.h>

#include "books.h"

#define fr(i, a, b) for (int i = (a); i <= (b); i++)
#define rf(i, a, b) for (int i = (a); i >= (b); i--)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

using namespace std;

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

void solve(int N, int K, long long A, int S) {
    int l = 1;
    int r = N;
    while (l < r) {
        int mid = l + ((r - l) >> 1);

        if (skim(mid) >= A) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    {
        ll sum = 0;
        sum += skim(l);
        if (sum >= A && l > k - 1) {
            ll sum = 0;
            fr (i, 1, k - 1) sum += skim(i);

            if (sum <= 2 * A) {
                ve<int> ans;
                fr (i, 1, k - 1) ans.pb(i);
                ans.pb(l);
                answer(ans);
            }
        }
    }

    ve<int> what(N + 1);

    fr (i, 1, k) {
        what[i] = skim(i);
    }

    fr (i, l - k, l - 1) {
        what[i] = skim(i);
    }

    ve<pii> v;
    fr (i, 1, N) {
        if (what[i]) {
            v.pb({what[i], i});
        }
    }

    fr (i, 0, sz(v) - k) {
        ll sum = 0;
        fr (j, i + 1, i + k - 1) {
            sum += v[j].fi;
        }
        if (sum >= A && sum <= 2 * A) {
            ve<int> ans;
            fr (j, i + 1, i + k - 1) {
                ans.pb(j);
            }
            answer(ans);
        }
    }

    impossible();
}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:61:29: error: 'k' was not declared in this scope
   61 |         if (sum >= A && l > k - 1) {
      |                             ^
books.cpp:76:15: error: 'k' was not declared in this scope
   76 |     fr (i, 1, k) {
      |               ^
books.cpp:5:45: note: in definition of macro 'fr'
    5 | #define fr(i, a, b) for (int i = (a); i <= (b); i++)
      |                                             ^
books.cpp:80:16: error: 'k' was not declared in this scope
   80 |     fr (i, l - k, l - 1) {
      |                ^
books.cpp:5:35: note: in definition of macro 'fr'
    5 | #define fr(i, a, b) for (int i = (a); i <= (b); i++)
      |                                   ^
books.cpp:91:23: error: 'k' was not declared in this scope
   91 |     fr (i, 0, sz(v) - k) {
      |                       ^
books.cpp:5:45: note: in definition of macro 'fr'
    5 | #define fr(i, a, b) for (int i = (a); i <= (b); i++)
      |                                             ^