oj.uz

Submission #632478

# Submission time Handle Problem Language Result Execution time Memory
632478 2022-08-20T07:21:15 Z shmad Mountains (NOI20_mountains) C++17
24 / 100
 419 ms 33932 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, h[N];
map<int, int> m;
set<int> st;
ll t[4 * N];

void upd (int pos, int v = 1, int tl = 1, int tr = N) {
	if (tl == tr) {
		t[v]++;
		return;
	}
	int tm = tl + tr >> 1;
	if (pos <= tm) upd(pos, v << 1, tl, tm);
	else upd(pos, v << 1 | 1, tm + 1, tr);
	t[v] = t[v << 1] + t[v << 1 | 1];
}

ll get (int l, int r, int v = 1, int tl = 1, int tr = N) {
	if (tl > r || tr < l) return 0ll;
	if (tl >= l && tr <= r) return t[v];
	int tm = tl + tr >> 1;
	ll a = get(l, r, v << 1, tl, tm);
	ll b = get(l, r, v << 1 | 1, tm + 1, tr);
	return (a + b);
}

void clr (int v = 1, int tl = 1, int tr = N) {
	t[v] = 0;
	if (tl == tr) return;
	int tm = tl + tr >> 1;
	clr(v << 1, tl, tm);
	clr(v << 1 | 1, tm + 1, tr);
}

ll l[N], r[N];

void solve () {
	cin >> n;
	vt<int> p(n + 1, 0), s(n + 2, 0);
	for (int i = 1; i <= n; i++) cin >> h[i], st.insert(h[i]);
	for (int i: st) m[i] = sz(m);
	for (int i = 1; i <= n; i++) h[i] = m[h[i]];
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		p[i] = p[i - 1] + (h[i] == 0);
		l[i] = (h[i] == 1 ? p[i - 1] : get(0, h[i] - 1));
		upd(h[i]);
	}
	clr();
	for (int i = n; i >= 1; i--) {
		s[i] = s[i + 1] + (h[i] == 0);
		r[i] = (h[i] == 1 ? s[i + 1] : get(0, h[i] - 1));
		upd(h[i]);
	}
	for (int i = 1; i <= n; i++) ans += (l[i] * r[i]);
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Compilation message

Mountains.cpp: In function 'void upd(int, int, int, int)':
Mountains.cpp:35:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |  int tm = tl + tr >> 1;
      |           ~~~^~~~
Mountains.cpp: In function 'll get(int, int, int, int, int)':
Mountains.cpp:44:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |  int tm = tl + tr >> 1;
      |           ~~~^~~~
Mountains.cpp: In function 'void clr(int, int, int)':
Mountains.cpp:53:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |  int tm = tl + tr >> 1;
      |           ~~~^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16724 KB Output is correct
2 Correct 63 ms 24944 KB Output is correct
3 Correct 49 ms 24868 KB Output is correct
4 Correct 47 ms 24924 KB Output is correct
5 Correct 49 ms 24972 KB Output is correct
6 Correct 48 ms 24908 KB Output is correct
7 Correct 50 ms 24968 KB Output is correct
8 Correct 48 ms 24912 KB Output is correct
9 Correct 47 ms 24876 KB Output is correct
10 Correct 48 ms 24996 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 24972 KB Output is correct
2 Correct 67 ms 24976 KB Output is correct
3 Correct 61 ms 24900 KB Output is correct
4 Correct 62 ms 24888 KB Output is correct
5 Correct 65 ms 24940 KB Output is correct
6 Correct 62 ms 24916 KB Output is correct
7 Correct 62 ms 24964 KB Output is correct
8 Correct 60 ms 24908 KB Output is correct
9 Correct 60 ms 24968 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 24972 KB Output is correct
2 Correct 67 ms 24976 KB Output is correct
3 Correct 61 ms 24900 KB Output is correct
4 Correct 62 ms 24888 KB Output is correct
5 Correct 65 ms 24940 KB Output is correct
6 Correct 62 ms 24916 KB Output is correct
7 Correct 62 ms 24964 KB Output is correct
8 Correct 60 ms 24908 KB Output is correct
9 Correct 60 ms 24968 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 161 ms 24896 KB Output is correct
12 Correct 163 ms 24976 KB Output is correct
13 Correct 160 ms 24960 KB Output is correct
14 Correct 168 ms 24880 KB Output is correct
15 Correct 165 ms 24980 KB Output is correct
16 Correct 163 ms 24980 KB Output is correct
17 Correct 178 ms 24944 KB Output is correct
18 Correct 114 ms 24924 KB Output is correct
19 Correct 104 ms 24988 KB Output is correct
20 Correct 9 ms 16708 KB Output is correct

Subtask #4
0 / 36.0

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

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 16728 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 77 ms 24972 KB Output is correct
2 Correct 67 ms 24976 KB Output is correct
3 Correct 61 ms 24900 KB Output is correct
4 Correct 62 ms 24888 KB Output is correct
5 Correct 65 ms 24940 KB Output is correct
6 Correct 62 ms 24916 KB Output is correct
7 Correct 62 ms 24964 KB Output is correct
8 Correct 60 ms 24908 KB Output is correct
9 Correct 60 ms 24968 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 161 ms 24896 KB Output is correct
12 Correct 163 ms 24976 KB Output is correct
13 Correct 160 ms 24960 KB Output is correct
14 Correct 168 ms 24880 KB Output is correct
15 Correct 165 ms 24980 KB Output is correct
16 Correct 163 ms 24980 KB Output is correct
17 Correct 178 ms 24944 KB Output is correct
18 Correct 114 ms 24924 KB Output is correct
19 Correct 104 ms 24988 KB Output is correct
20 Correct 9 ms 16708 KB Output is correct
21 Correct 386 ms 33884 KB Output is correct
22 Correct 403 ms 33788 KB Output is correct
23 Correct 378 ms 33864 KB Output is correct
24 Correct 374 ms 33852 KB Output is correct
25 Correct 419 ms 33880 KB Output is correct
26 Correct 384 ms 33892 KB Output is correct
27 Correct 369 ms 33808 KB Output is correct
28 Correct 191 ms 33932 KB Output is correct
29 Correct 226 ms 33856 KB Output is correct
30 Correct 11 ms 16724 KB Output is correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16724 KB Output is correct
2 Correct 63 ms 24944 KB Output is correct
3 Correct 49 ms 24868 KB Output is correct
4 Correct 47 ms 24924 KB Output is correct
5 Correct 49 ms 24972 KB Output is correct
6 Correct 48 ms 24908 KB Output is correct
7 Correct 50 ms 24968 KB Output is correct
8 Correct 48 ms 24912 KB Output is correct
9 Correct 47 ms 24876 KB Output is correct
10 Correct 48 ms 24996 KB Output is correct
11 Correct 77 ms 24972 KB Output is correct
12 Correct 67 ms 24976 KB Output is correct
13 Correct 61 ms 24900 KB Output is correct
14 Correct 62 ms 24888 KB Output is correct
15 Correct 65 ms 24940 KB Output is correct
16 Correct 62 ms 24916 KB Output is correct
17 Correct 62 ms 24964 KB Output is correct
18 Correct 60 ms 24908 KB Output is correct
19 Correct 60 ms 24968 KB Output is correct
20 Correct 10 ms 16724 KB Output is correct
21 Correct 161 ms 24896 KB Output is correct
22 Correct 163 ms 24976 KB Output is correct
23 Correct 160 ms 24960 KB Output is correct
24 Correct 168 ms 24880 KB Output is correct
25 Correct 165 ms 24980 KB Output is correct
26 Correct 163 ms 24980 KB Output is correct
27 Correct 178 ms 24944 KB Output is correct
28 Correct 114 ms 24924 KB Output is correct
29 Correct 104 ms 24988 KB Output is correct
30 Correct 9 ms 16708 KB Output is correct
31 Incorrect 11 ms 16728 KB Output isn't correct
32 Halted 0 ms 0 KB -