Submission #137457

#TimeUsernameProblemLanguageResultExecution timeMemory
137457MladenPFortune Telling 2 (JOI14_fortune_telling2)C++17
100 / 100
372 ms20712 KiB
#include<bits/stdc++.h> #define STIZE(x) fprintf(stderr, "STIZE%d\n", x); #define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x); #define NL(x) printf("%c", " \n"[(x)]); #define lld long long #define pii pair<int,int> #define pb push_back #define fi first #define se second #define mid (l+r)/2 #define endl '\n' #define all(a) begin(a),end(a) #define sz(a) int((a).size()) #define LINF 1000000000000000LL #define INF 1000000000 #define EPS 1e-9 using namespace std; #define MAXN 200010 lld N, K, a[MAXN], b[MAXN], t[MAXN]; lld seg[4*MAXN]; vector<pii> T, B; void init(int node, int l, int r) { if(l == r) seg[node] = T[l].se; else { init(2*node, l, mid); init(2*node+1, mid+1, r); seg[node] = max(seg[2*node], seg[2*node+1]); } } lld query(int node, int l, int r, int L, int R) { if(r < l || R < L || r < L || R < l) return 0; if(L <= l && r <= R) return seg[node]; return max(query(2*node, l, mid, L, R), query(2*node+1, mid+1, r, L, R)); } lld bit[MAXN]; void update(int idx, lld val) { for( ; idx < MAXN; idx += idx&-idx) bit[idx] += val; } lld query(int idx) { lld rez = 0; for( ; idx ; idx -= idx&-idx) rez += bit[idx]; return rez; } int bsL(int key) { auto l = lower_bound(all(T), make_pair(key, -INF)); return l-T.begin(); } int bsR(int key) { auto r = lower_bound(all(T), make_pair(key, INF)); r--; return r-T.begin(); } int sred[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0); cin >> N >> K; for(int i = 1; i <= N; i++) cin >> a[i] >> b[i]; for(int i = 1; i <= K; i++) cin >> t[i]; T.pb({-INF, -INF}); B.pb({-INF, -INF}); for(int i = 1; i <= N; i++) B.pb({max(a[i], b[i]), i}); for(int i = 1; i <= K; i++) T.pb({t[i], i}); sort(all(T)); sort(all(B)); init(1, 1, K); lld rez = 0; for(int i = 1; i <= N; i++) { int L = bsL(min(a[i], b[i])), R = bsR(max(a[i], b[i])-1); sred[i] = query(1, 1, K, L, R); } int cb = N, ct = K; while(cb > 0) { if(B[cb].fi <= T[ct].fi) { update(T[ct].se, +1); ct--; } else { lld vece = (query(MAXN-1)-query(sred[B[cb].se]))%2; int idx = B[cb].se; if(sred[idx] == 0) { if(vece == 1) rez += b[idx]; else rez += a[idx]; } else { if(vece == 1) rez += min(a[idx], b[idx]); else rez += max(a[idx], b[idx]); } cb--; } } cout << rez << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...