oj.uz

답안 #520050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520050 2022-01-28T08:42:15 Z akhan42 Bubble Sort 2 (JOI18_bubblesort2) C++17
100 / 100
 4547 ms 173496 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
//using namespace __gnu_pbds;

#define F first
#define S second
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forbn(i, b, n) for(int i = b; i < n; ++i)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(), v.end()

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
//typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

template <class T> inline void mineq(T &a, T b) { a = min(a, b); }
template <class T> inline void maxeq(T &a, T b) { a = max(a, b); }


const int INF = 1000 * 1000;


struct Seg {
	int n;
	vi add, mx;
	const int INF = 1000 * 1000 * 1000;

	Seg(int n, vi &vals): n(n) {
		add.assign(4 * n, 0);
		mx.assign(4 * n, 0);

		build(vals);
	}

	void propagate(int v, int tl, int tr) {
		if(tl == tr || add[v] == 0)
			return;

		add[2 * v] += add[v];
		add[2 * v + 1] += add[v];
		mx[2 * v] += add[v];
		mx[2 * v + 1] += add[v];
		add[v] = 0;
	}

	void pull(int v) {
		mx[v] = max(mx[2 * v], mx[2 * v + 1]);
	}

	void build(vi &vals, int v = 1, int tl = 0, int tr = -1) {
		if(tr == -1) tr = n - 1;

		if(tl == tr) {
			mx[v] = vals[tl];
			return;
		}
		int tm = (tl + tr) / 2;

		build(vals, 2 * v, tl, tm);
		build(vals, 2 * v + 1, tm + 1, tr);

		pull(v);
	}

	void update(int l, int r, int val, int v = 1, int tl = 0, int tr = -1) {
		if(tr == -1) tr = n - 1;
		propagate(v, tl, tr);
		if(l > r) return;

		if(tl == l && r == tr) {
			add[v] = val;
			mx[v] += val;
			return;
		}
		int tm = (tl + tr) / 2;

		update(l, min(r, tm), val, 2 * v, tl, tm);
		update(max(l, tm + 1), r, val, 2 * v + 1, tm + 1, tr);

		pull(v);
	}

	int get_max() {
		propagate(1, 0, n - 1);
		return mx[1];
	}

	int at(int p, int v = 1, int tl = 0, int tr = -1) {
		if(tr == -1) tr = n - 1;
		propagate(v, tl, tr);

		if(tl == tr)
			return mx[v];
		int tm = (tl + tr) / 2;

		if(p <= tm)
			return at(p, 2 * v, tl, tm);
		else
			return at(p, 2 * v + 1, tm + 1, tr);
	}

	void set(int p, int nval) {
		update(p, p, nval - at(p));
	}
};


struct Seg2 {
	int n;
	vi t;

	Seg2(int n): n(n) {
		t.resize(2 * n);
	}

	void set(int p, int val) {
		for(t[p += n] = val; p > 1; p /= 2)
			t[p >> 1] = t[p] + t[p ^ 1];
	}

	int sum(int l, int r) {
		int res = 0;
		for(l += n, r += n + 1; l < r; l /= 2, r /= 2) {
			if(l & 1) res += t[l++];
			if(r & 1) res += t[--r];
		}
		return res;
	}

	int at(int p) {
		return sum(0, p) - sum(0, p - 1);
	}
};


struct SegSim {
	int n;
	vi t;

	SegSim(int n, vi &vals): n(n) {
		t.resize(n);
		forn(i, n)
			t[i] = vals[i];
	}

	void update(int l, int r, int val) {
		forbn(i, l, r + 1)
			t[i] += val;
	}

	void set(int p, int val) {
		t[p] = val;
	}

	int get_max() {
		int mx = -1000 * 1000 * 1000;
		forn(i, n)
			maxeq(mx, t[i]);
		return mx;
	}
};


vi countScans(vi a, vi xs, vi vs) {
	int n = sz(a);
	int q = sz(xs);

	set<ii> s;
	vii vals;

	forn(i, n) {
		s.insert({a[i], i});
		vals.eb(a[i], i);
	}
	forn(i, q) {
		s.insert({vs[i], xs[i]});
	}
	map<ii, int> p2ind;
	int ct = 0;
	for(ii el: s) {
		p2ind[el] = ct++;
	}

	int N = sz(s);

	sort(all(vals));

	vi seg_vals(N, -INF);
	Seg2 sl(N);

	forn(i, n) {
		int ind = p2ind[vals[i]];
		seg_vals[ind] = vals[i].S - i;
		sl.set(ind, 1);
	}

	Seg seg(N, seg_vals);
	vi ans(q);

	forn(i, q) {
		int x = xs[i], v = vs[i];

		int ind_fr = p2ind[{a[x], x}];
		int ind_to = p2ind[{v, x}];

		sl.set(ind_fr, 0);
		sl.set(ind_to, 1);

		if(ind_to > ind_fr) {
			seg.update(ind_fr, ind_to, 1);
		}
		if(ind_to < ind_fr) {
			seg.update(ind_to, ind_fr, -1);
		}

		if(ind_to != ind_fr) {
			int rem = x - sl.sum(0, ind_to - 1);
			seg.set(ind_fr, -INF);
			seg.set(ind_to, rem);
		}

		a[x] = v;
		ans[i] = seg.get_max();
	}

	return ans;
}


void solve() {
	int n, q;
	cin >> n >> q;
	vi a(n);
	forn(i, n)
		cin >> a[i];

	vi xs, vs;
	forn(_, q) {
		int x, v;
		cin >> x >> v;
		xs.pb(x);
		vs.pb(v);
	}

	vi ans = countScans(a, xs, vs);

	for(int a: ans)
		cout << a << endl;

}

//
//
//int main() {
//	ios_base::sync_with_stdio(false);
//	cin.tie(nullptr);
////	cout.tie(nullptr);
//
////	freopen("optmilk.in", "r", stdin);
////	freopen("optmilk.out", "w", stdout);
//
//	int t = 1;
////	cin >> t;
//	while(t--) {
//		solve();
//	}
//}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 3 ms 556 KB Output is correct
3 Correct 6 ms 964 KB Output is correct
4 Correct 6 ms 944 KB Output is correct
5 Correct 6 ms 944 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 6 ms 972 KB Output is correct
8 Correct 7 ms 1024 KB Output is correct
9 Correct 6 ms 972 KB Output is correct
10 Correct 5 ms 836 KB Output is correct
11 Correct 5 ms 928 KB Output is correct
12 Correct 6 ms 936 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 5 ms 844 KB Output is correct
15 Correct 6 ms 848 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 5 ms 816 KB Output is correct
18 Correct 5 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 3 ms 556 KB Output is correct
3 Correct 6 ms 964 KB Output is correct
4 Correct 6 ms 944 KB Output is correct
5 Correct 6 ms 944 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 6 ms 972 KB Output is correct
8 Correct 7 ms 1024 KB Output is correct
9 Correct 6 ms 972 KB Output is correct
10 Correct 5 ms 836 KB Output is correct
11 Correct 5 ms 928 KB Output is correct
12 Correct 6 ms 936 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 5 ms 844 KB Output is correct
15 Correct 6 ms 848 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 5 ms 816 KB Output is correct
18 Correct 5 ms 844 KB Output is correct
19 Correct 23 ms 2864 KB Output is correct
20 Correct 27 ms 3148 KB Output is correct
21 Correct 25 ms 3144 KB Output is correct
22 Correct 28 ms 3204 KB Output is correct
23 Correct 25 ms 2764 KB Output is correct
24 Correct 27 ms 2880 KB Output is correct
25 Correct 23 ms 2596 KB Output is correct
26 Correct 22 ms 2584 KB Output is correct
27 Correct 22 ms 2480 KB Output is correct
28 Correct 22 ms 2464 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 5284 KB Output is correct
2 Correct 113 ms 11364 KB Output is correct
3 Correct 252 ms 17856 KB Output is correct
4 Correct 236 ms 17744 KB Output is correct
5 Correct 231 ms 17652 KB Output is correct
6 Correct 260 ms 17468 KB Output is correct
7 Correct 227 ms 17272 KB Output is correct
8 Correct 230 ms 17552 KB Output is correct
9 Correct 231 ms 17468 KB Output is correct
10 Correct 110 ms 10860 KB Output is correct
11 Correct 111 ms 10944 KB Output is correct
12 Correct 110 ms 10968 KB Output is correct
13 Correct 130 ms 10976 KB Output is correct
14 Correct 128 ms 10956 KB Output is correct
15 Correct 120 ms 10996 KB Output is correct
16 Correct 134 ms 11048 KB Output is correct
17 Correct 129 ms 11036 KB Output is correct
18 Correct 131 ms 10940 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 3 ms 556 KB Output is correct
3 Correct 6 ms 964 KB Output is correct
4 Correct 6 ms 944 KB Output is correct
5 Correct 6 ms 944 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 6 ms 972 KB Output is correct
8 Correct 7 ms 1024 KB Output is correct
9 Correct 6 ms 972 KB Output is correct
10 Correct 5 ms 836 KB Output is correct
11 Correct 5 ms 928 KB Output is correct
12 Correct 6 ms 936 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 5 ms 844 KB Output is correct
15 Correct 6 ms 848 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 5 ms 816 KB Output is correct
18 Correct 5 ms 844 KB Output is correct
19 Correct 23 ms 2864 KB Output is correct
20 Correct 27 ms 3148 KB Output is correct
21 Correct 25 ms 3144 KB Output is correct
22 Correct 28 ms 3204 KB Output is correct
23 Correct 25 ms 2764 KB Output is correct
24 Correct 27 ms 2880 KB Output is correct
25 Correct 23 ms 2596 KB Output is correct
26 Correct 22 ms 2584 KB Output is correct
27 Correct 22 ms 2480 KB Output is correct
28 Correct 22 ms 2464 KB Output is correct
29 Correct 27 ms 5284 KB Output is correct
30 Correct 113 ms 11364 KB Output is correct
31 Correct 252 ms 17856 KB Output is correct
32 Correct 236 ms 17744 KB Output is correct
33 Correct 231 ms 17652 KB Output is correct
34 Correct 260 ms 17468 KB Output is correct
35 Correct 227 ms 17272 KB Output is correct
36 Correct 230 ms 17552 KB Output is correct
37 Correct 231 ms 17468 KB Output is correct
38 Correct 110 ms 10860 KB Output is correct
39 Correct 111 ms 10944 KB Output is correct
40 Correct 110 ms 10968 KB Output is correct
41 Correct 130 ms 10976 KB Output is correct
42 Correct 128 ms 10956 KB Output is correct
43 Correct 120 ms 10996 KB Output is correct
44 Correct 134 ms 11048 KB Output is correct
45 Correct 129 ms 11036 KB Output is correct
46 Correct 131 ms 10940 KB Output is correct
47 Correct 955 ms 53256 KB Output is correct
48 Correct 4126 ms 158796 KB Output is correct
49 Correct 4528 ms 173352 KB Output is correct
50 Correct 4547 ms 173496 KB Output is correct
51 Correct 4429 ms 173420 KB Output is correct
52 Correct 4530 ms 173292 KB Output is correct
53 Correct 4391 ms 173460 KB Output is correct
54 Correct 4397 ms 172920 KB Output is correct
55 Correct 4425 ms 173092 KB Output is correct
56 Correct 4150 ms 172896 KB Output is correct
57 Correct 4384 ms 172796 KB Output is correct
58 Correct 4296 ms 172848 KB Output is correct
59 Correct 3713 ms 153664 KB Output is correct
60 Correct 3700 ms 153668 KB Output is correct
61 Correct 3744 ms 153568 KB Output is correct
62 Correct 3395 ms 144016 KB Output is correct
63 Correct 3333 ms 143880 KB Output is correct
64 Correct 3422 ms 143784 KB Output is correct
65 Correct 3014 ms 134416 KB Output is correct
66 Correct 2990 ms 133964 KB Output is correct
67 Correct 3007 ms 133772 KB Output is correct