oj.uz

답안 #645394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
645394 2022-09-27T04:14:34 Z ghostwriter 운세 보기 2 (JOI14_fortune_telling2) C++14
100 / 100
 219 ms 13368 KB 
#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
----------------------------------------------------------------
*/

Compilation message

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.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 352 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 352 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1140 KB Output is correct
15 Correct 18 ms 1744 KB Output is correct
16 Correct 27 ms 2320 KB Output is correct
17 Correct 36 ms 2984 KB Output is correct
18 Correct 38 ms 3064 KB Output is correct
19 Correct 35 ms 2964 KB Output is correct
20 Correct 36 ms 3028 KB Output is correct
21 Correct 36 ms 3016 KB Output is correct
22 Correct 27 ms 2512 KB Output is correct
23 Correct 26 ms 2516 KB Output is correct
24 Correct 27 ms 2480 KB Output is correct
25 Correct 26 ms 2584 KB Output is correct
26 Correct 27 ms 2764 KB Output is correct
27 Correct 33 ms 2964 KB Output is correct
28 Correct 29 ms 2856 KB Output is correct
29 Correct 34 ms 3024 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 352 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1140 KB Output is correct
15 Correct 18 ms 1744 KB Output is correct
16 Correct 27 ms 2320 KB Output is correct
17 Correct 36 ms 2984 KB Output is correct
18 Correct 38 ms 3064 KB Output is correct
19 Correct 35 ms 2964 KB Output is correct
20 Correct 36 ms 3028 KB Output is correct
21 Correct 36 ms 3016 KB Output is correct
22 Correct 27 ms 2512 KB Output is correct
23 Correct 26 ms 2516 KB Output is correct
24 Correct 27 ms 2480 KB Output is correct
25 Correct 26 ms 2584 KB Output is correct
26 Correct 27 ms 2764 KB Output is correct
27 Correct 33 ms 2964 KB Output is correct
28 Correct 29 ms 2856 KB Output is correct
29 Correct 34 ms 3024 KB Output is correct
30 Correct 85 ms 6688 KB Output is correct
31 Correct 106 ms 8188 KB Output is correct
32 Correct 138 ms 9780 KB Output is correct
33 Correct 215 ms 13260 KB Output is correct
34 Correct 72 ms 6080 KB Output is correct
35 Correct 194 ms 13256 KB Output is correct
36 Correct 194 ms 13256 KB Output is correct
37 Correct 219 ms 13212 KB Output is correct
38 Correct 186 ms 13368 KB Output is correct
39 Correct 187 ms 13328 KB Output is correct
40 Correct 203 ms 13104 KB Output is correct
41 Correct 180 ms 13356 KB Output is correct
42 Correct 198 ms 13272 KB Output is correct
43 Correct 144 ms 12364 KB Output is correct
44 Correct 153 ms 12356 KB Output is correct
45 Correct 187 ms 12492 KB Output is correct
46 Correct 141 ms 11456 KB Output is correct
47 Correct 143 ms 11200 KB Output is correct
48 Correct 159 ms 12664 KB Output is correct
49 Correct 147 ms 12440 KB Output is correct