Submission #1122922

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122922		gdragon	Fortune Telling 2 (JOI14_fortune_telling2)	C++20	0 / 100	1 ms	320 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
struct Fenwick {
    int n;
    vector<long long> v;
    Fenwick(int _n = 0) {
        n = _n;
        v.assign(n + 2, 0);
    } 
    void update(int x, int c) {
        for(; x <= n; x += x & -x) v[x] += c;
    }
    long long get(int x) {
        long long ans = 0;
        for(; x > 0; x -= x & -x) ans += v[x];
        return ans;
    }
    long long get(int l, int r) {
        return get(r) - get(l - 1);
    }
    long long getFull() {
        return get(n);
    }
} fw;
struct FenwickMax {
    int n;
    vector<long long> v;
    FenwickMax(int _n = 0) {
        n = _n;
        v.assign(n + 2, 0);
    } 
    void update(int x, long long c) {
        for(; x > 0; x -= x & -x) v[x] = max(v[x], c);
    }
    long long get(int x) {
        long long ans = 0;
        for(; x <= n; x += x & -x) ans = max(ans, v[x]);
        return ans;
    }
} fw1;
int n, q;
pair<int, int> a[N], query[N];
vector<int> val;
void read() {
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
    for(int i = 1; i <= q; i++) {
        cin >> query[i].fi;
        query[i].se = i;
    }
}
void solve() {
    for(int i = 1; i <= n; i++) val.push_back(min(a[i].fi, a[i].se));
    for(int i = 1; i <= q; i++) val.push_back(query[i].fi);
    sort(ALL(val));
    auto getPos = [&](int x) -> int {
        return lower_bound(ALL(val), x) - val.begin() + 1;
    };
    sort(a + 1, a + n + 1, [&](const ii &x, const ii &y) {
        return max(x.fi, x.se) < max(y.fi, y.se);
    });
    sort(query + 1, query + q + 1);
    fw = Fenwick(q);
    fw1 = FenwickMax(SZ(val));
    for(int i = 1; i <= q; i++) fw.update(i, 1);
    long long ans = 0;
    for(int i = 1, j = 1; i <= n; i++) {
        int mx = max(a[i].fi, a[i].se);
        while(j <= q && query[j].fi < mx) {
            fw.update(query[j].se, -1);
            fw1.update(getPos(query[j].fi), query[j].se);
            ++j;
        }
        int pos = fw1.get(min(a[i].fi, a[i].se));
        if (pos == 0) {
            int cnt = fw.getFull();
            if (cnt & 1) ans += a[i].se;
            else ans += a[i].fi;
        }
        else {
            int cnt = fw.get(pos, q);
            if (cnt & 1) ans += min(a[i].fi, a[i].se);
            else ans += max(a[i].fi, a[i].se);
        }
    }
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

Compilation message (stderr)

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

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