oj.uz

Submission #845996

# Submission time Handle Problem Language Result Execution time Memory
845996 2023-09-07T03:09:45 Z haninak697 Fortune Telling 2 (JOI14_fortune_telling2) C++14
35 / 100
 272 ms 151420 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define left defined_left
#define right defined_right

const int N = 2e5 + 5, Q = N;

int n, q, a[N], b[N], t[Q], sp[__lg(N) + 3][N], m;
vector<int> arr = {0};

int get(int x) {
	return lower_bound(arr.begin(), arr.end(), x) - arr.begin();
}

int get_max(int l, int r) {
	int k = __lg(r - l + 1);
	return max(sp[k][l], sp[k][r - (1 << k) + 1]);
}

struct Node {
	int sum;
	Node *left, *right;
	
	Node(int sum = 0, Node *left = nullptr, Node *right = nullptr): 
		sum(sum), left(left), right(right) {}
	
	Node *go_left() {
		if (left == nullptr)
			left = new Node();
		return left;
	}
	
	Node *go_right() {
		if (right == nullptr)
			right = new Node();
		return right;
	}
};

Node *v[N];

Node* update(int x, Node *cur, int l, int r) {
	if (l == r) return new Node(cur->sum + 1);
	int mid = (l + r) / 2;
	Node *res = new Node();
	if (x <= mid) {
		res->left = update(x, cur->go_left(), l, mid);
		res->right = cur->go_right();
	} else {
		res->left = cur->go_left();
		res->right = update(x, cur->go_right(), mid + 1, r);
	}
	res->sum = res->go_left()->sum + res->go_right()->sum;
	return res;
}

int get_sum(int x, int y, Node *cur, int l, int r) {
	if (l > y || r < x) return 0;
	if (x <= l && r <= y) return cur->sum;
	int mid = (l + r) / 2;
	return get_sum(x, y, cur->go_left(), l, mid) + get_sum(x, y, cur->go_right(), mid + 1, r);
}

int32_t main() {
  cin.tie(0)->sync_with_stdio(0);
  if (fopen("SwapCard.inp", "r"))
  	freopen("SwapCard.inp", "r", stdin),
  	freopen("SwapCard.out", "w", stdout);
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
  	cin >> a[i] >> b[i];
  	arr.emplace_back(a[i]);
  	arr.emplace_back(b[i]);
  }
  for (int i = 1; i <= q; i++) {
  	cin >> t[i];
  	arr.emplace_back(t[i]);
  }
  sort(arr.begin(), arr.end());
  arr.resize(unique(arr.begin(), arr.end()) - arr.begin());
  m = arr.size() - 1;
  for (int i = 1; i <= n; i++)
  	a[i] = get(a[i]), b[i] = get(b[i]);
  for (int i = 1; i <= q; i++) {
  	t[i] = get(t[i]);
  	sp[0][t[i]] = i;
  }
  // cerr << arr[2] << '\n';
  // cerr << sp[0][2] << '\n';
  v[q + 1] = new Node();
  for (int i = q; i > 0; i--) 
  	v[i] = update(t[i], v[i + 1], 1, m);
  for (int k = 1; (1 << k) <= m; k++)
  	for (int i = 1; i + (1 << k) - 1 <= m; i++)
  		sp[k][i] = max(sp[k - 1][i], sp[k - 1][i + (1 << (k - 1))]);
  ll ans = 0;
  for (int i = 1; i <= n; i++) {
  	if (a[i] == b[i]) {
  		ans += arr[a[i]];
  		continue;
  	}
  	bool dummy = false;
  	if (a[i] < b[i]) {
  		dummy = true;
  		swap(a[i], b[i]);
  	}
  	int pos = get_max(b[i], a[i] - 1);
  	// cerr << arr[b[i]] << ' ' << arr[a[i] - 1] << '\n';
  	// cerr << "pos = " << pos << '\n';
  	bool greater_ = 1 ^ (get_sum(a[i], m, v[pos + 1], 1, m) & 1);
  	if (pos == 0) greater_ ^= dummy;
  	int cur;
  	if (greater_) cur = arr[a[i]];
  	else cur = arr[b[i]];
  	ans += cur;
  }
  cout << ans;
  return 0;
}

Compilation message

fortune_telling2.cpp: In function 'int32_t main()':
fortune_telling2.cpp:70:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |    freopen("SwapCard.inp", "r", stdin),
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:71:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |    freopen("SwapCard.out", "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13220 KB Output is correct
2 Correct 2 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 3 ms 13148 KB Output is correct
6 Correct 3 ms 13148 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13148 KB Output is correct
9 Correct 5 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13220 KB Output is correct
2 Correct 2 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 3 ms 13148 KB Output is correct
6 Correct 3 ms 13148 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13148 KB Output is correct
9 Correct 5 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct
14 Correct 18 ms 23644 KB Output is correct
15 Correct 39 ms 31192 KB Output is correct
16 Correct 59 ms 38932 KB Output is correct
17 Correct 83 ms 46548 KB Output is correct
18 Correct 82 ms 46696 KB Output is correct
19 Correct 81 ms 46544 KB Output is correct
20 Correct 83 ms 46664 KB Output is correct
21 Correct 76 ms 45792 KB Output is correct
22 Correct 61 ms 43724 KB Output is correct
23 Correct 64 ms 42444 KB Output is correct
24 Correct 62 ms 41172 KB Output is correct
25 Correct 65 ms 44528 KB Output is correct
26 Correct 65 ms 43652 KB Output is correct
27 Correct 74 ms 44360 KB Output is correct
28 Correct 67 ms 44236 KB Output is correct
29 Correct 98 ms 45776 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13220 KB Output is correct
2 Correct 2 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 3 ms 13148 KB Output is correct
6 Correct 3 ms 13148 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13148 KB Output is correct
9 Correct 5 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct
14 Correct 18 ms 23644 KB Output is correct
15 Correct 39 ms 31192 KB Output is correct
16 Correct 59 ms 38932 KB Output is correct
17 Correct 83 ms 46548 KB Output is correct
18 Correct 82 ms 46696 KB Output is correct
19 Correct 81 ms 46544 KB Output is correct
20 Correct 83 ms 46664 KB Output is correct
21 Correct 76 ms 45792 KB Output is correct
22 Correct 61 ms 43724 KB Output is correct
23 Correct 64 ms 42444 KB Output is correct
24 Correct 62 ms 41172 KB Output is correct
25 Correct 65 ms 44528 KB Output is correct
26 Correct 65 ms 43652 KB Output is correct
27 Correct 74 ms 44360 KB Output is correct
28 Correct 67 ms 44236 KB Output is correct
29 Correct 98 ms 45776 KB Output is correct
30 Incorrect 272 ms 151420 KB Output isn't correct
31 Halted 0 ms 0 KB -