제출 #645394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
645394		ghostwriter	운세 보기 2 (JOI14_fortune_telling2)	C++14	100 / 100	219 ms	13368 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int N = 4e5 + 5;
int n, k, f[N], f1[N];
vi v;
pi a[N], t[N];
ll rs = 0;
bool cmp(pi &a, pi &b) { return max(a.st, a.nd) < max(b.st, b.nd); }
bool cmp1(pi &a, pi &b) { return a.st < b.st; }
int getpos(int x) { return lb(all(v), x) - v.bg(); }
void upd(int pos, int v) { for (int i = pos; i < N; i += (i & -i)) f[i] += v; }
int get(int pos) { int rs = 0; for (int i = pos; i >= 1; i -= (i & -i)) rs += f[i]; return rs; }
void upd1(int pos, int v) { for (int i = pos; i >= 1; i -= (i & -i)) f1[i] = max(f1[i], v); }
int get1(int pos) { int rs = 0; for (int i = pos; i < N; i += (i & -i)) rs = max(rs, f1[i]); return rs; }
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> k;
    v.pb(-1);
    FOR(i, 1, n) {
    	cin >> a[i].st >> a[i].nd;
    	v.pb(min(a[i].st, a[i].nd));
    }
    FOR(i, 1, k) {
    	cin >> t[i].st;
    	t[i].nd = i;
    	v.pb(t[i].st);
    }
    sort(all(v));
    sort(a + 1, a + 1 + n, cmp);
    sort(t + 1, t + 1 + k, cmp1);
    FOR(i, 1, k) upd(t[i].nd, 1);
    int l = 1;
    FOR(i, 1, n) {
    	WHILE(l <= k && t[l].st < max(a[i].st, a[i].nd)) {
    		upd(t[l].nd, -1);
    		upd1(getpos(t[l].st), t[l].nd);
    		++l;
    	}
    	int pos = get1(getpos(min(a[i].st, a[i].nd)));
    	if (!pos) {
    		int cnt = get(N - 1);
    		if (cnt & 1) rs += a[i].nd;
    		else rs += a[i].st;
    	}
    	else {
    		int cnt = get(N - 1) - get(pos - 1);
    		if (cnt & 1) rs += min(a[i].st, a[i].nd);
    		else rs += max(a[i].st, a[i].nd);
    	}
    }
    cout << rs;
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

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

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
fortune_telling2.cpp:67:5: note: in expansion of macro 'FOR'
   67 |     FOR(i, 1, n) {
      |     ^~~
fortune_telling2.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
fortune_telling2.cpp:71:5: note: in expansion of macro 'FOR'
   71 |     FOR(i, 1, k) {
      |     ^~~
fortune_telling2.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
fortune_telling2.cpp:79:5: note: in expansion of macro 'FOR'
   79 |     FOR(i, 1, k) upd(t[i].nd, 1);
      |     ^~~
fortune_telling2.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
fortune_telling2.cpp:81:5: note: in expansion of macro 'FOR'
   81 |     FOR(i, 1, n) {
      |     ^~~

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