답안 #56736 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56736	2018-07-12T08:59:45 Z	Mamnoon_Siam	운세 보기 2 (JOI14_fortune_telling2)	C++17	35 / 100	3000 ms	29196 KB

fortune_telling2

#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;
	}
};

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

void insert(int p, int val) {
	p++;
	for(; p <= q; p += p & -p)
		ft[p].push_back(val);
}
int query(int p, int x) {
	int ret = 0;
	for(; p > 0; p -= p & -p)
		ret += ft[p].end() - lower_bound(all(ft[p]), x);
	return ret;
}
int query(int l, int r, int val) {
	if(l >= r or l >= q or r >= q) return 0;
	return query(r + 1, val) - query(l, val);	
}

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

	// for(int i = 0; i < n; i++) cout << A[i] << ' ' << B[i] << endl;
	// for(int b : T) cout << b << endl;

	MaxSegTree ds(mp.size() + 10);
	for(int i = 0; i < q; i++) {
		ds.update(T[i], i);
		insert(i, T[i]);
	}
	for(int i = 0; i <= q; i++) {
		sort(all(ft[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];
		Now[i] = now, It[i] = it;
		int tog = 0;
		for(int j = it; j < q; j++)
			if(T[j] >= B[i]) tog++;
		// cout << it << ' ' << tog << endl;
		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;
                          ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5112 KB	Output is correct
2	Correct	10 ms	5332 KB	Output is correct
3	Correct	12 ms	5424 KB	Output is correct
4	Correct	12 ms	5424 KB	Output is correct
5	Correct	10 ms	5424 KB	Output is correct
6	Correct	10 ms	5424 KB	Output is correct
7	Correct	10 ms	5424 KB	Output is correct
8	Correct	12 ms	5424 KB	Output is correct
9	Correct	12 ms	5424 KB	Output is correct
10	Correct	8 ms	5424 KB	Output is correct
11	Correct	12 ms	5424 KB	Output is correct
12	Correct	12 ms	5424 KB	Output is correct
13	Correct	11 ms	5424 KB	Output is correct
14	Correct	52 ms	6364 KB	Output is correct
15	Correct	75 ms	7524 KB	Output is correct
16	Correct	123 ms	8640 KB	Output is correct
17	Correct	154 ms	9824 KB	Output is correct
18	Correct	135 ms	9928 KB	Output is correct
19	Correct	144 ms	9928 KB	Output is correct
20	Correct	176 ms	9944 KB	Output is correct
21	Correct	138 ms	9944 KB	Output is correct
22	Correct	128 ms	9944 KB	Output is correct
23	Correct	117 ms	9944 KB	Output is correct
24	Correct	104 ms	9944 KB	Output is correct
25	Correct	133 ms	9944 KB	Output is correct
26	Correct	287 ms	9944 KB	Output is correct
27	Correct	319 ms	9944 KB	Output is correct
28	Correct	427 ms	9944 KB	Output is correct
29	Correct	454 ms	9944 KB	Output is correct

Subtask #3
0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5112 KB	Output is correct
2	Correct	10 ms	5332 KB	Output is correct
3	Correct	12 ms	5424 KB	Output is correct
4	Correct	12 ms	5424 KB	Output is correct
5	Correct	10 ms	5424 KB	Output is correct
6	Correct	10 ms	5424 KB	Output is correct
7	Correct	10 ms	5424 KB	Output is correct
8	Correct	12 ms	5424 KB	Output is correct
9	Correct	12 ms	5424 KB	Output is correct
10	Correct	8 ms	5424 KB	Output is correct
11	Correct	12 ms	5424 KB	Output is correct
12	Correct	12 ms	5424 KB	Output is correct
13	Correct	11 ms	5424 KB	Output is correct
14	Correct	52 ms	6364 KB	Output is correct
15	Correct	75 ms	7524 KB	Output is correct
16	Correct	123 ms	8640 KB	Output is correct
17	Correct	154 ms	9824 KB	Output is correct
18	Correct	135 ms	9928 KB	Output is correct
19	Correct	144 ms	9928 KB	Output is correct
20	Correct	176 ms	9944 KB	Output is correct
21	Correct	138 ms	9944 KB	Output is correct
22	Correct	128 ms	9944 KB	Output is correct
23	Correct	117 ms	9944 KB	Output is correct
24	Correct	104 ms	9944 KB	Output is correct
25	Correct	133 ms	9944 KB	Output is correct
26	Correct	287 ms	9944 KB	Output is correct
27	Correct	319 ms	9944 KB	Output is correct
28	Correct	427 ms	9944 KB	Output is correct
29	Correct	454 ms	9944 KB	Output is correct
30	Correct	389 ms	20824 KB	Output is correct
31	Correct	505 ms	22608 KB	Output is correct
32	Correct	675 ms	24860 KB	Output is correct
33	Correct	995 ms	29116 KB	Output is correct
34	Correct	391 ms	29116 KB	Output is correct
35	Correct	886 ms	29116 KB	Output is correct
36	Correct	962 ms	29140 KB	Output is correct
37	Correct	872 ms	29140 KB	Output is correct
38	Correct	1010 ms	29140 KB	Output is correct
39	Correct	1120 ms	29192 KB	Output is correct
40	Correct	1065 ms	29192 KB	Output is correct
41	Correct	1126 ms	29192 KB	Output is correct
42	Correct	1000 ms	29196 KB	Output is correct
43	Correct	755 ms	29196 KB	Output is correct
44	Correct	709 ms	29196 KB	Output is correct
45	Correct	681 ms	29196 KB	Output is correct
46	Correct	681 ms	29196 KB	Output is correct
47	Correct	586 ms	29196 KB	Output is correct
48	Execution timed out	3020 ms	29196 KB	Time limit exceeded
49	Halted	0 ms	0 KB	-

답안 #56736

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 31.0 / 31.0

Subtask #3 0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
31.0 / 31.0

Subtask #3
0 / 65.0