oj.uz

답안 #770300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770300 2023-07-01T05:13:45 Z horiiseun Mountains (NOI20_mountains) C++17
100 / 100
 670 ms 122540 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<ll> &res, vector<ll> &l, vector<ll> &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<ll> curr;
	Node *lft, *rht;
	Node (int tl, int tr, vector<ll> &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, ll val) {
	if (r <= x->l || x->r <= l) {
		return 0;
	}
	if (l <= x->l && x->r <= r) {
		vector<ll>::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<ll> h;
Node *root;
ll ans, x;

int main() {

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

	cin >> n;
	for (int i = 0; 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<long long int>&, std::vector<long long int>&, std::vector<long long int>&)':
Mountains.cpp:116:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long 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<long long 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<long long 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<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |  while (idx2 < r.size()) {
      |         ~~~~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 262 ms 122540 KB Output is correct
3 Correct 243 ms 122480 KB Output is correct
4 Correct 241 ms 122492 KB Output is correct
5 Correct 242 ms 122376 KB Output is correct
6 Correct 244 ms 122472 KB Output is correct
7 Correct 256 ms 122408 KB Output is correct
8 Correct 250 ms 122468 KB Output is correct
9 Correct 280 ms 122508 KB Output is correct
10 Correct 240 ms 122512 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 117524 KB Output is correct
2 Correct 237 ms 117528 KB Output is correct
3 Correct 238 ms 117528 KB Output is correct
4 Correct 257 ms 117436 KB Output is correct
5 Correct 241 ms 117528 KB Output is correct
6 Correct 243 ms 117528 KB Output is correct
7 Correct 245 ms 117424 KB Output is correct
8 Correct 212 ms 117460 KB Output is correct
9 Correct 208 ms 117528 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 117524 KB Output is correct
2 Correct 237 ms 117528 KB Output is correct
3 Correct 238 ms 117528 KB Output is correct
4 Correct 257 ms 117436 KB Output is correct
5 Correct 241 ms 117528 KB Output is correct
6 Correct 243 ms 117528 KB Output is correct
7 Correct 245 ms 117424 KB Output is correct
8 Correct 212 ms 117460 KB Output is correct
9 Correct 208 ms 117528 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 522 ms 117788 KB Output is correct
12 Correct 550 ms 117792 KB Output is correct
13 Correct 502 ms 117792 KB Output is correct
14 Correct 498 ms 117784 KB Output is correct
15 Correct 503 ms 117816 KB Output is correct
16 Correct 507 ms 117788 KB Output is correct
17 Correct 510 ms 117784 KB Output is correct
18 Correct 232 ms 117792 KB Output is correct
19 Correct 224 ms 117732 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 12 ms 3952 KB Output is correct
12 Correct 12 ms 3924 KB Output is correct
13 Correct 12 ms 3952 KB Output is correct
14 Correct 12 ms 3956 KB Output is correct
15 Correct 12 ms 3944 KB Output is correct
16 Correct 12 ms 3960 KB Output is correct
17 Correct 12 ms 3924 KB Output is correct
18 Correct 15 ms 3924 KB Output is correct
19 Correct 11 ms 3804 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 117524 KB Output is correct
2 Correct 237 ms 117528 KB Output is correct
3 Correct 238 ms 117528 KB Output is correct
4 Correct 257 ms 117436 KB Output is correct
5 Correct 241 ms 117528 KB Output is correct
6 Correct 243 ms 117528 KB Output is correct
7 Correct 245 ms 117424 KB Output is correct
8 Correct 212 ms 117460 KB Output is correct
9 Correct 208 ms 117528 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 522 ms 117788 KB Output is correct
12 Correct 550 ms 117792 KB Output is correct
13 Correct 502 ms 117792 KB Output is correct
14 Correct 498 ms 117784 KB Output is correct
15 Correct 503 ms 117816 KB Output is correct
16 Correct 507 ms 117788 KB Output is correct
17 Correct 510 ms 117784 KB Output is correct
18 Correct 232 ms 117792 KB Output is correct
19 Correct 224 ms 117732 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 596 ms 118664 KB Output is correct
22 Correct 603 ms 118548 KB Output is correct
23 Correct 582 ms 118576 KB Output is correct
24 Correct 579 ms 118756 KB Output is correct
25 Correct 598 ms 118668 KB Output is correct
26 Correct 575 ms 118664 KB Output is correct
27 Correct 596 ms 118660 KB Output is correct
28 Correct 233 ms 118664 KB Output is correct
29 Correct 270 ms 118664 KB Output is correct
30 Correct 1 ms 324 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 262 ms 122540 KB Output is correct
3 Correct 243 ms 122480 KB Output is correct
4 Correct 241 ms 122492 KB Output is correct
5 Correct 242 ms 122376 KB Output is correct
6 Correct 244 ms 122472 KB Output is correct
7 Correct 256 ms 122408 KB Output is correct
8 Correct 250 ms 122468 KB Output is correct
9 Correct 280 ms 122508 KB Output is correct
10 Correct 240 ms 122512 KB Output is correct
11 Correct 246 ms 117524 KB Output is correct
12 Correct 237 ms 117528 KB Output is correct
13 Correct 238 ms 117528 KB Output is correct
14 Correct 257 ms 117436 KB Output is correct
15 Correct 241 ms 117528 KB Output is correct
16 Correct 243 ms 117528 KB Output is correct
17 Correct 245 ms 117424 KB Output is correct
18 Correct 212 ms 117460 KB Output is correct
19 Correct 208 ms 117528 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 522 ms 117788 KB Output is correct
22 Correct 550 ms 117792 KB Output is correct
23 Correct 502 ms 117792 KB Output is correct
24 Correct 498 ms 117784 KB Output is correct
25 Correct 503 ms 117816 KB Output is correct
26 Correct 507 ms 117788 KB Output is correct
27 Correct 510 ms 117784 KB Output is correct
28 Correct 232 ms 117792 KB Output is correct
29 Correct 224 ms 117732 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 12 ms 3952 KB Output is correct
42 Correct 12 ms 3924 KB Output is correct
43 Correct 12 ms 3952 KB Output is correct
44 Correct 12 ms 3956 KB Output is correct
45 Correct 12 ms 3944 KB Output is correct
46 Correct 12 ms 3960 KB Output is correct
47 Correct 12 ms 3924 KB Output is correct
48 Correct 15 ms 3924 KB Output is correct
49 Correct 11 ms 3804 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 596 ms 118664 KB Output is correct
52 Correct 603 ms 118548 KB Output is correct
53 Correct 582 ms 118576 KB Output is correct
54 Correct 579 ms 118756 KB Output is correct
55 Correct 598 ms 118668 KB Output is correct
56 Correct 575 ms 118664 KB Output is correct
57 Correct 596 ms 118660 KB Output is correct
58 Correct 233 ms 118664 KB Output is correct
59 Correct 270 ms 118664 KB Output is correct
60 Correct 1 ms 324 KB Output is correct
61 Correct 604 ms 122476 KB Output is correct
62 Correct 615 ms 122476 KB Output is correct
63 Correct 594 ms 122464 KB Output is correct
64 Correct 642 ms 122472 KB Output is correct
65 Correct 608 ms 122440 KB Output is correct
66 Correct 670 ms 122472 KB Output is correct
67 Correct 593 ms 122476 KB Output is correct
68 Correct 629 ms 122460 KB Output is correct
69 Correct 621 ms 118776 KB Output is correct
70 Correct 1 ms 212 KB Output is correct