제출 #1278758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1278758		thaibeo123	운세 보기 2 (JOI14_fortune_telling2)	C++20	100 / 100	280 ms	59408 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;

#define NAME "A"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define MASK(x) (1ll << (x))
#define BIT(x, i) (((x) >> (i)) & 1)

const int N = 6e5 + 5;
const int LG = 19;

struct FenwickTree {
    int n;
    vector<int> fen;

    FenwickTree(int n): n(n), fen(n + 1) {}

    void update(int x, int v) {
        for (int i = x; i <= n; i += i & -i) {
            fen[i] += v;
        }
    }

    int get(int x) {
        int res = 0;
        for (int i = x; i > 0; i -= i & -i) {
            res += fen[i];
        }
        return res;
    }

    int get(int l, int r) {
        return get(r) - get(l - 1);
    }
};

int n, k;
int a[N], b[N], T[N], res[N];
int st[N][21];
vector<int> vals;
vector<int> que[N];

int getid(int x) {
    return lower_bound(all(vals), x) - vals.begin();
}

int getmax(int l, int r) {
    if (l > r) return 0;
    int k = __lg(r - l + 1);
    return max(st[l][k], st[r - MASK(k) + 1][k]);
}

void input() {
    cin >> n >> k;
    vals.pb(0);
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        if (a[i] > b[i]) {
            swap(a[i], b[i]);
            res[i] = 1;
        }
        vals.pb(a[i]);
        vals.pb(b[i]);
    }
    for (int i = 1; i <= k; i++) {
        cin >> T[i];
        vals.pb(T[i]);
    }
    sort(all(vals));
    vals.erase(unique(all(vals)), vals.end());
    for (int i = 1; i <= n; i++) {
        a[i] = getid(a[i]);
        b[i] = getid(b[i]);
    }
    for (int i = 1; i <= k; i++) {
        T[i] = getid(T[i]);
        st[T[i]][0] = i;
    }
    for (int j = 1; j <= LG; j++) {
        for (int i = 1; i + MASK(j) - 1 <= (int)vals.size(); i++) {
            st[i][j] = max(st[i][j - 1], st[i + MASK(j - 1)][j - 1]);
        }
    }
}

void solve() {
    for (int i = 1; i <= n; i++) {
        int cur = getmax(a[i], b[i] - 1);
        if (cur && res[i] == 0) {
            res[i]++;
        }
        que[cur + 1].pb(i);
    }

    FenwickTree fen(vals.size());
    for (int i = k; i >= 1; i--) {
        fen.update(T[i], 1);
        for (int id : que[i]) {
            res[id] += fen.get(b[id], vals.size());
        }
    }
    ll sum = 0;
    for (int i = 1; i <= n; i++) {
        if (res[i] & 1) {
            sum += vals[b[i]];
        }
        else {
            sum += vals[a[i]];
        }
    }
    cout << sum;
}

signed main() {
    if (fopen(NAME".INP", "r")) {
        freopen(NAME".INP", "r", stdin);
        freopen(NAME".OUT", "w", stdout);
    }
    cin.tie(0)->sync_with_stdio(0);

    input();
    solve();

    return 0;
}

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

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:120:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |         freopen(NAME".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:121:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |         freopen(NAME".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 31 / 31
• Subtask 3: 65 / 65