oj.uz

답안 #707054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707054 2023-03-08T11:06:34 Z Chal1shkan Izbori (COCI22_izbori) C++14
110 / 110
 1157 ms 42592 KB 
# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define deb(x) cerr << #x  << " = " << x << endl; 
# define pll pair <ll, ll>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = 3e5 + 25;
const ll inf = 2e9 + 0;
const ll mod = 1e9 + 123;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;
 
ll n, a[maxn];
ll b[maxn];
vector <ll> pos[maxn];
 
struct node
{
	ll sum1, sum2, upd, sz;	
} t[maxn * 4];
 
ll cnt (ll x)
{
	return x * (x + 1) / 2;
}

void push (ll v, ll tl, ll tr)
{
	if (t[v].upd && tl != tr)
	{
		ll tm = (tl + tr) >> 1;
		t[v * 2].sum1 += t[v].upd * (tm - tl + 1);
		t[v * 2 + 1].sum1 += t[v].upd * (tr - tm);
		
		t[v * 2].sum2 += t[v].upd * cnt(tm - tl + 1);
		t[v * 2 + 1].sum2 += t[v].upd * cnt(tr - tm);
		
		t[v * 2].upd += t[v].upd;
		t[v * 2 + 1].upd += t[v].upd;
		t[v].upd = 0;
	}
}
 
void update (ll l, ll r, ll x, ll v = 1, ll tl = 0, ll tr = n + n)
{
	push(v, tl, tr);
	if (tr < l || r < tl) return;
	if (l <= tl && tr <= r)
	{
		t[v].sum1 += x * (tr - tl + 1);
		t[v].sum2 += x * cnt(tr - tl + 1);
		t[v].upd += x;
		return;
	}
	ll tm = (tl + tr) >> 1;
	update(l, r, x, v * 2, tl, tm);
	update(l, r, x, v * 2 + 1, tm + 1, tr);
	t[v].sum1 = t[v * 2].sum1 + t[v * 2 + 1].sum1;
	t[v].sum2 = t[v * 2].sum1 * (tr - tm) + t[v * 2].sum2 + t[v * 2 + 1].sum2;
}
 
node get (ll l, ll r, ll v = 1, ll tl = 0, ll tr = n + n)
{
	push(v, tl, tr);
	if (tr < l || r < tl) return {0, 0, 0, 0};
	if (l <= tl && tr <= r) return {t[v].sum1, t[v].sum2, t[v].upd, tr - tl + 1};
	ll tm = (tl + tr) >> 1;
	node x = get(l, r, v * 2, tl, tm);
	node y = get(l, r, v * 2 + 1, tm + 1, tr);
	return {x.sum1 + y.sum1, x.sum1 * y.sz + x.sum2 + y.sum2, x.upd, x.sz + y.sz};
}
 
void out (ll v = 1, ll tl = 0, ll tr = n + n)
{
	push(v, tl, tr);
	cout << tl << ' ' << tr << ' ' << t[v].sum2 << nl;
	if (tl == tr)
	{
		return;
	}
	ll tm = (tl + tr) >> 1;
	out(v * 2, tl, tm);
	out(v * 2 + 1, tm + 1, tr);
}

ll query (ll l, ll r)
{
	ll x = get(0, l - 1).sum1;
	ll y = get(l, r - 1).sum2;
	return x * (r - l + 1) + y;
}

void clear (ll v = 1, ll tl = 0, ll tr = n + n)
{
	push(v, tl, tr);
	t[v].sum1 = t[v].sum2 = t[v].upd = 0;
	if (tl == tr)
	{
		return;
	}
	ll tm = (tl + tr) >> 1;
	clear(v * 2, tl, tm);
	clear(v * 2 + 1, tm + 1, tr);
}

void ma1n (/* SABR */)
{
	cin >> n;
	for (ll i = 1; i <= n; ++i)
	{
		cin >> a[i];
		b[i] = a[i];	
	}	
	sort(b + 1, b + 1 + n);
	set <ll> st;
	for (ll i = 1; i <= n; ++i)
	{
		a[i] = lower_bound(b + 1, b + 1 + n, a[i]) - b;
		st.insert(a[i]);
		pos[a[i]].pb(i);
	}
	ll ans = 0;
	for (ll x : st)
	{
		pos[x].pb(0);
		pos[x].pb(n + 1);
		sort(pos[x].begin(), pos[x].end());
		vector <pll> clr;
		ll cur = n;
		update(n, n, 1);
		clr.pb({n, n});
		for (ll i = 1; i < sz(pos[x]); ++i)
		{
			ll siz = pos[x][i] - pos[x][i - 1] - 1; 
			ans += query(cur - siz, cur - 1);
			update(cur - siz, cur - 1, 1);
			clr.pb({cur - siz, cur - 1});
			if (pos[x][i] != n + 1)
			{
				ans += get(0, cur - siz).sum1;
				update(cur - siz + 1, cur - siz + 1, 1);
				clr.pb({cur - siz + 1, cur - siz + 1});
			}
			cur = cur - siz + 1;	
		}
		for (pll p : clr)
		{
			update(p.ff, p.ss, -1);
		}
	}
	cout << ans;
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("spainting.in", "r", stdin);
//  freopen("spainting.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << ' ';
        ma1n();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7384 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7384 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7384 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7384 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 7 ms 7516 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 7 ms 7508 KB Output is correct
10 Correct 7 ms 7588 KB Output is correct
11 Correct 7 ms 7636 KB Output is correct
12 Correct 8 ms 7520 KB Output is correct
13 Correct 7 ms 7508 KB Output is correct
14 Correct 7 ms 7508 KB Output is correct
15 Correct 8 ms 7632 KB Output is correct
16 Correct 7 ms 7632 KB Output is correct
17 Correct 7 ms 7664 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 17168 KB Output is correct
2 Correct 327 ms 18732 KB Output is correct
3 Correct 180 ms 13620 KB Output is correct
4 Correct 345 ms 19188 KB Output is correct
5 Correct 349 ms 19352 KB Output is correct
6 Correct 386 ms 20144 KB Output is correct
7 Correct 368 ms 19756 KB Output is correct
8 Correct 380 ms 19948 KB Output is correct
9 Correct 371 ms 19852 KB Output is correct
10 Correct 370 ms 19904 KB Output is correct
11 Correct 386 ms 35284 KB Output is correct

Subtask #4
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7384 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7384 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 7 ms 7516 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 7 ms 7508 KB Output is correct
10 Correct 7 ms 7588 KB Output is correct
11 Correct 7 ms 7636 KB Output is correct
12 Correct 8 ms 7520 KB Output is correct
13 Correct 7 ms 7508 KB Output is correct
14 Correct 7 ms 7508 KB Output is correct
15 Correct 8 ms 7632 KB Output is correct
16 Correct 7 ms 7632 KB Output is correct
17 Correct 7 ms 7664 KB Output is correct
18 Correct 242 ms 17168 KB Output is correct
19 Correct 327 ms 18732 KB Output is correct
20 Correct 180 ms 13620 KB Output is correct
21 Correct 345 ms 19188 KB Output is correct
22 Correct 349 ms 19352 KB Output is correct
23 Correct 386 ms 20144 KB Output is correct
24 Correct 368 ms 19756 KB Output is correct
25 Correct 380 ms 19948 KB Output is correct
26 Correct 371 ms 19852 KB Output is correct
27 Correct 370 ms 19904 KB Output is correct
28 Correct 386 ms 35284 KB Output is correct
29 Correct 408 ms 36788 KB Output is correct
30 Correct 208 ms 16464 KB Output is correct
31 Correct 445 ms 24888 KB Output is correct
32 Correct 1157 ms 42592 KB Output is correct
33 Correct 476 ms 25380 KB Output is correct
34 Correct 509 ms 25908 KB Output is correct
35 Correct 313 ms 18520 KB Output is correct
36 Correct 182 ms 15716 KB Output is correct
37 Correct 235 ms 16784 KB Output is correct
38 Correct 431 ms 25872 KB Output is correct
39 Correct 430 ms 25700 KB Output is correct
40 Correct 455 ms 25804 KB Output is correct
41 Correct 424 ms 25748 KB Output is correct
42 Correct 430 ms 25796 KB Output is correct
43 Correct 494 ms 29408 KB Output is correct
44 Correct 481 ms 29560 KB Output is correct
45 Correct 492 ms 29336 KB Output is correct
46 Correct 498 ms 29436 KB Output is correct
47 Correct 489 ms 29504 KB Output is correct
48 Correct 596 ms 29676 KB Output is correct
49 Correct 585 ms 29628 KB Output is correct
50 Correct 664 ms 29960 KB Output is correct
51 Correct 572 ms 30248 KB Output is correct
52 Correct 603 ms 29524 KB Output is correct
53 Correct 600 ms 29240 KB Output is correct
54 Correct 614 ms 29432 KB Output is correct