oj.uz

Submission #56685

# Submission time Handle Problem Language Result Execution time Memory
56685 2018-07-12T07:21:21 Z Mamnoon_Siam Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 4688 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, -inf);}
	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];

int32_t main () {
	// freopen("in", "r", stdin);
	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;
	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();
	}
	MaxSegTree ds(mp.size() + 10);
	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 = -1;
		for(int j = 0; j < q; j++) {
			if(A[i] <= T[j] and  T[j] < B[i])
				it = j;
		} it++;
		int now;
		if(it == 0) {
			if(flag[i]) now = B[i];
			else now = A[i];
		} else {
			now = B[i];
		}
		int tog = 0;
		for(int j = it; j < T.size(); j++) {
			if(T[j] >= B[i]) tog++;
		}
		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 function 'int32_t main()':
fortune_telling2.cpp:104:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = it; j < T.size(); j++) {
                   ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 9 ms 672 KB Output is correct
3 Correct 9 ms 784 KB Output is correct
4 Correct 10 ms 904 KB Output is correct
5 Correct 12 ms 996 KB Output is correct
6 Correct 9 ms 996 KB Output is correct
7 Correct 9 ms 1136 KB Output is correct
8 Correct 6 ms 1136 KB Output is correct
9 Correct 6 ms 1136 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 8 ms 1148 KB Output is correct
12 Correct 8 ms 1180 KB Output is correct
13 Correct 9 ms 1344 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 9 ms 672 KB Output is correct
3 Correct 9 ms 784 KB Output is correct
4 Correct 10 ms 904 KB Output is correct
5 Correct 12 ms 996 KB Output is correct
6 Correct 9 ms 996 KB Output is correct
7 Correct 9 ms 1136 KB Output is correct
8 Correct 6 ms 1136 KB Output is correct
9 Correct 6 ms 1136 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 8 ms 1148 KB Output is correct
12 Correct 8 ms 1180 KB Output is correct
13 Correct 9 ms 1344 KB Output is correct
14 Correct 378 ms 2288 KB Output is correct
15 Correct 1703 ms 3476 KB Output is correct
16 Execution timed out 3056 ms 4688 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 9 ms 672 KB Output is correct
3 Correct 9 ms 784 KB Output is correct
4 Correct 10 ms 904 KB Output is correct
5 Correct 12 ms 996 KB Output is correct
6 Correct 9 ms 996 KB Output is correct
7 Correct 9 ms 1136 KB Output is correct
8 Correct 6 ms 1136 KB Output is correct
9 Correct 6 ms 1136 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 8 ms 1148 KB Output is correct
12 Correct 8 ms 1180 KB Output is correct
13 Correct 9 ms 1344 KB Output is correct
14 Correct 378 ms 2288 KB Output is correct
15 Correct 1703 ms 3476 KB Output is correct
16 Execution timed out 3056 ms 4688 KB Time limit exceeded
17 Halted 0 ms 0 KB -