oj.uz

Submission #770295

# Submission time Handle Problem Language Result Execution time Memory
770295 2023-07-01T05:10:55 Z horiiseun Mountains (NOI20_mountains) C++17
24 / 100
 548 ms 88064 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

void merge(vector<int> &res, vector<int> &l, vector<int> &r) {
	int idx1 = 0, idx2 = 0;
	while (idx1 < l.size() && idx2 < r.size()) {
		if (l[idx1] <= r[idx2]) {
			res.push_back(l[idx1]);
			idx1++;
		} else {
			res.push_back(r[idx2]);
			idx2++;	
		}
	}
	while (idx1 < l.size()) {
		res.push_back(l[idx1]);
		idx1++;
	}
	while (idx2 < r.size()) {
		res.push_back(r[idx2]);
		idx2++;
	}
}

struct Node {
	int l, r;
	vector<int> curr;
	Node *lft, *rht;
	Node (int tl, int tr, vector<int> &v): l(tl), r(tr) {
		if (l + 1 != r) {
			lft = new Node(l, (l + r) / 2, v);
			rht = new Node((l + r) / 2, r, v);
			merge(curr, lft->curr, rht->curr);
		} else {
			lft = rht = NULL;
			curr.push_back(v[l]);
		}
	}
};

int query(Node *x, int l, int r, int val) {
	if (r <= x->l || x->r <= l) {
		return 0;
	}
	if (l <= x->l && x->r <= r) {
		vector<int>::iterator it = lower_bound(x->curr.begin(), x->curr.end(), val);
		return it - x->curr.begin();
	}
	return query(x->lft, l, r, val) + query(x->rht, l, r, val);
}

int n;
vector<int> h;
Node *root;
ll ans;

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	for (int i = 0, x; i < n; i++) {
		cin >> x;
		h.push_back(x);
	}
	
	root = new Node(0, n, h);
	for (int i = 1; i < n - 1; i++) {
		ans += (ll) query(root, 0, i, h[i]) * (ll) query(root, i + 1, n, h[i]);
	}
	
	cout << ans << "\n";

}

Compilation message

Mountains.cpp: In function 'void merge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
Mountains.cpp:116:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |  while (idx1 < l.size() && idx2 < r.size()) {
      |         ~~~~~^~~~~~~~~~
Mountains.cpp:116:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |  while (idx1 < l.size() && idx2 < r.size()) {
      |                            ~~~~~^~~~~~~~~~
Mountains.cpp:125:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |  while (idx1 < l.size()) {
      |         ~~~~~^~~~~~~~~~
Mountains.cpp:129:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |  while (idx2 < r.size()) {
      |         ~~~~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 208 ms 86352 KB Output is correct
3 Correct 174 ms 86356 KB Output is correct
4 Correct 179 ms 86312 KB Output is correct
5 Correct 177 ms 86376 KB Output is correct
6 Correct 175 ms 86376 KB Output is correct
7 Correct 175 ms 86252 KB Output is correct
8 Correct 176 ms 86372 KB Output is correct
9 Correct 174 ms 86292 KB Output is correct
10 Correct 174 ms 86376 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 86920 KB Output is correct
2 Correct 215 ms 86916 KB Output is correct
3 Correct 226 ms 86916 KB Output is correct
4 Correct 234 ms 86912 KB Output is correct
5 Correct 217 ms 86848 KB Output is correct
6 Correct 216 ms 86836 KB Output is correct
7 Correct 225 ms 86916 KB Output is correct
8 Correct 192 ms 86916 KB Output is correct
9 Correct 187 ms 86880 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 86920 KB Output is correct
2 Correct 215 ms 86916 KB Output is correct
3 Correct 226 ms 86916 KB Output is correct
4 Correct 234 ms 86912 KB Output is correct
5 Correct 217 ms 86848 KB Output is correct
6 Correct 216 ms 86836 KB Output is correct
7 Correct 225 ms 86916 KB Output is correct
8 Correct 192 ms 86916 KB Output is correct
9 Correct 187 ms 86880 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 465 ms 87180 KB Output is correct
12 Correct 452 ms 87180 KB Output is correct
13 Correct 490 ms 87176 KB Output is correct
14 Correct 450 ms 87180 KB Output is correct
15 Correct 457 ms 87180 KB Output is correct
16 Correct 462 ms 87180 KB Output is correct
17 Correct 463 ms 87228 KB Output is correct
18 Correct 216 ms 87180 KB Output is correct
19 Correct 204 ms 87184 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 86920 KB Output is correct
2 Correct 215 ms 86916 KB Output is correct
3 Correct 226 ms 86916 KB Output is correct
4 Correct 234 ms 86912 KB Output is correct
5 Correct 217 ms 86848 KB Output is correct
6 Correct 216 ms 86836 KB Output is correct
7 Correct 225 ms 86916 KB Output is correct
8 Correct 192 ms 86916 KB Output is correct
9 Correct 187 ms 86880 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 465 ms 87180 KB Output is correct
12 Correct 452 ms 87180 KB Output is correct
13 Correct 490 ms 87176 KB Output is correct
14 Correct 450 ms 87180 KB Output is correct
15 Correct 457 ms 87180 KB Output is correct
16 Correct 462 ms 87180 KB Output is correct
17 Correct 463 ms 87228 KB Output is correct
18 Correct 216 ms 87180 KB Output is correct
19 Correct 204 ms 87184 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 539 ms 88060 KB Output is correct
22 Correct 526 ms 88064 KB Output is correct
23 Correct 527 ms 88060 KB Output is correct
24 Correct 528 ms 88060 KB Output is correct
25 Correct 525 ms 88052 KB Output is correct
26 Correct 525 ms 88000 KB Output is correct
27 Correct 548 ms 88060 KB Output is correct
28 Correct 235 ms 88056 KB Output is correct
29 Correct 201 ms 88056 KB Output is correct
30 Correct 1 ms 212 KB Output is correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 208 ms 86352 KB Output is correct
3 Correct 174 ms 86356 KB Output is correct
4 Correct 179 ms 86312 KB Output is correct
5 Correct 177 ms 86376 KB Output is correct
6 Correct 175 ms 86376 KB Output is correct
7 Correct 175 ms 86252 KB Output is correct
8 Correct 176 ms 86372 KB Output is correct
9 Correct 174 ms 86292 KB Output is correct
10 Correct 174 ms 86376 KB Output is correct
11 Correct 211 ms 86920 KB Output is correct
12 Correct 215 ms 86916 KB Output is correct
13 Correct 226 ms 86916 KB Output is correct
14 Correct 234 ms 86912 KB Output is correct
15 Correct 217 ms 86848 KB Output is correct
16 Correct 216 ms 86836 KB Output is correct
17 Correct 225 ms 86916 KB Output is correct
18 Correct 192 ms 86916 KB Output is correct
19 Correct 187 ms 86880 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 465 ms 87180 KB Output is correct
22 Correct 452 ms 87180 KB Output is correct
23 Correct 490 ms 87176 KB Output is correct
24 Correct 450 ms 87180 KB Output is correct
25 Correct 457 ms 87180 KB Output is correct
26 Correct 462 ms 87180 KB Output is correct
27 Correct 463 ms 87228 KB Output is correct
28 Correct 216 ms 87180 KB Output is correct
29 Correct 204 ms 87184 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Incorrect 1 ms 340 KB Output isn't correct
32 Halted 0 ms 0 KB -