oj.uz

Submission #56738

# Submission time Handle Problem Language Result Execution time Memory
56738 2018-07-12T09:19:14 Z Mamnoon_Siam Fortune Telling 2 (JOI14_fortune_telling2) C++17
100 / 100
 1042 ms 57060 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;
template<typename T> using min_pq =
	priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

const int maxn = 200010;
const int inf = 2e9;

struct MaxSegTree {
	vector<int> t;
	MaxSegTree() {}
	MaxSegTree(int N) {t.assign(N << 1, -1);}
	void update(int p, int val) {
		p += (t.size() >> 1);
		t[p] = max(t[p], val);
		for(; p > 1; p >>= 1) t[p >> 1] = max(t[p], t[p ^ 1]);
	}
	int query(int l, int r) {
		r++;
		int ret = -inf;
		for(l += (t.size() >> 1), r += (t.size() >> 1); l < r; l >>= 1, r >>= 1) {
			if(l & 1) ret = max(ret, t[l++]);
			if(r & 1) ret = max(ret, t[--r]);
		} return ret;
	}
};
struct Tree {
	vector<vector<int>> t;
	Tree() {}
	Tree(vector<int> &vec) {
		t.resize(vec.size() << 2);
		build(1, 0, vec.size() - 1, vec);
	}
	void build(int u, int b, int e, vector<int> &vec) {
		for(int i = b; i <= e; i++) t[u].push_back(vec[i]);
		sort(all(t[u]));
		if(b == e) return;
		int mid = b + e >> 1;
		build(u << 1, b, mid, vec);
		build(u << 1 | 1, mid + 1, e, vec);
	}
	int query(int u, int b, int e, int i, int j, int x) {
		if(b > j or e < i) return 0;
		if(i <= b and e <= j) return t[u].end() - lower_bound(all(t[u]), x);
		int mid = b + e >> 1;
		return query(u << 1, b, mid, i, j, x) + query(u << 1 | 1, mid + 1, e, i, j, x);
	}
	int query(int l, int r, int x) {
		return query(1, 0, (t.size() >> 2) - 1, l, r, x);
	}
};

int n, q;
vector<int> A, B, T;
vector<int> mp;
int flag[maxn];

int32_t main () {
	// freopen("in", "r", stdin);

// input
	cin >> n >> q;
	A.resize(n), B.resize(n), T.resize(q);
	for(int i = 0; i < n; i++) {
		cin >> A[i] >> B[i];
		if(A[i] > B[i]) swap(A[i], B[i]), flag[i] = 1;
	}
	for(int &b : T) cin >> b;
// end
	
// compress
	for(int i = 0; i < n; i++) {
		mp.push_back(A[i]);
		mp.push_back(B[i]);
	}
	for(int b : T) mp.push_back(b);
	sort(all(mp));
	KeepUnique(mp);
	for(int i = 0; i < n; i++) {
		A[i] = lower_bound(all(mp), A[i]) - mp.begin();
		B[i] = lower_bound(all(mp), B[i]) - mp.begin();
	}
	for(int &b : T) {
		b = lower_bound(all(mp), b) - mp.begin();
	}
// end

	MaxSegTree ds(mp.size() + 10);
	Tree tree(T);

	for(int i = 0; i < q; i++) ds.update(T[i], i);

	ll ans = 0;
	for(int i = 0; i < n; i++) {
		if(A[i] == B[i]) {
			ans += mp[A[i]];
			continue;
		}
		int it = ds.query(A[i], B[i] - 1) + 1, now;
		if(!it) now = flag[i] ? B[i] : A[i];
		else now = B[i];
		int tog = tree.query(it, q - 1, B[i]);
		if(tog & 1) now ^= A[i] ^ B[i];
		ans += mp[now];
	} cout << ans << endl;
}

Compilation message

fortune_telling2.cpp: In function 'int myrand(int, int)':
fortune_telling2.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
fortune_telling2.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
fortune_telling2.cpp: In member function 'void Tree::build(int, int, int, std::vector<int>&)':
fortune_telling2.cpp:63:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = b + e >> 1;
             ~~^~~
fortune_telling2.cpp: In member function 'int Tree::query(int, int, int, int, int, int)':
fortune_telling2.cpp:70:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = b + e >> 1;
             ~~^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 5 ms 612 KB Output is correct
3 Correct 6 ms 612 KB Output is correct
4 Correct 8 ms 688 KB Output is correct
5 Correct 6 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 6 ms 688 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 5 ms 800 KB Output is correct
10 Correct 5 ms 800 KB Output is correct
11 Correct 6 ms 800 KB Output is correct
12 Correct 5 ms 880 KB Output is correct
13 Correct 7 ms 880 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 5 ms 612 KB Output is correct
3 Correct 6 ms 612 KB Output is correct
4 Correct 8 ms 688 KB Output is correct
5 Correct 6 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 6 ms 688 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 5 ms 800 KB Output is correct
10 Correct 5 ms 800 KB Output is correct
11 Correct 6 ms 800 KB Output is correct
12 Correct 5 ms 880 KB Output is correct
13 Correct 7 ms 880 KB Output is correct
14 Correct 36 ms 3324 KB Output is correct
15 Correct 75 ms 6136 KB Output is correct
16 Correct 124 ms 8372 KB Output is correct
17 Correct 201 ms 12012 KB Output is correct
18 Correct 249 ms 12020 KB Output is correct
19 Correct 184 ms 12020 KB Output is correct
20 Correct 212 ms 12020 KB Output is correct
21 Correct 208 ms 12064 KB Output is correct
22 Correct 144 ms 12064 KB Output is correct
23 Correct 139 ms 12064 KB Output is correct
24 Correct 174 ms 12064 KB Output is correct
25 Correct 124 ms 12064 KB Output is correct
26 Correct 145 ms 12064 KB Output is correct
27 Correct 188 ms 12064 KB Output is correct
28 Correct 153 ms 12064 KB Output is correct
29 Correct 197 ms 12064 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 5 ms 612 KB Output is correct
3 Correct 6 ms 612 KB Output is correct
4 Correct 8 ms 688 KB Output is correct
5 Correct 6 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 6 ms 688 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 5 ms 800 KB Output is correct
10 Correct 5 ms 800 KB Output is correct
11 Correct 6 ms 800 KB Output is correct
12 Correct 5 ms 880 KB Output is correct
13 Correct 7 ms 880 KB Output is correct
14 Correct 36 ms 3324 KB Output is correct
15 Correct 75 ms 6136 KB Output is correct
16 Correct 124 ms 8372 KB Output is correct
17 Correct 201 ms 12012 KB Output is correct
18 Correct 249 ms 12020 KB Output is correct
19 Correct 184 ms 12020 KB Output is correct
20 Correct 212 ms 12020 KB Output is correct
21 Correct 208 ms 12064 KB Output is correct
22 Correct 144 ms 12064 KB Output is correct
23 Correct 139 ms 12064 KB Output is correct
24 Correct 174 ms 12064 KB Output is correct
25 Correct 124 ms 12064 KB Output is correct
26 Correct 145 ms 12064 KB Output is correct
27 Correct 188 ms 12064 KB Output is correct
28 Correct 153 ms 12064 KB Output is correct
29 Correct 197 ms 12064 KB Output is correct
30 Correct 576 ms 49864 KB Output is correct
31 Correct 731 ms 51588 KB Output is correct
32 Correct 909 ms 53228 KB Output is correct
33 Correct 908 ms 56804 KB Output is correct
34 Correct 492 ms 56804 KB Output is correct
35 Correct 908 ms 56932 KB Output is correct
36 Correct 962 ms 57060 KB Output is correct
37 Correct 895 ms 57060 KB Output is correct
38 Correct 958 ms 57060 KB Output is correct
39 Correct 1022 ms 57060 KB Output is correct
40 Correct 886 ms 57060 KB Output is correct
41 Correct 952 ms 57060 KB Output is correct
42 Correct 930 ms 57060 KB Output is correct
43 Correct 746 ms 57060 KB Output is correct
44 Correct 767 ms 57060 KB Output is correct
45 Correct 741 ms 57060 KB Output is correct
46 Correct 814 ms 57060 KB Output is correct
47 Correct 813 ms 57060 KB Output is correct
48 Correct 1042 ms 57060 KB Output is correct
49 Correct 892 ms 57060 KB Output is correct