oj.uz

Submission #957357

# Submission time Handle Problem Language Result Execution time Memory
957357 2024-04-03T14:21:41 Z ono_de206 Sličnost (COI23_slicnost) C++14
34 / 100
 262 ms 321760 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;

struct node {
	int mx, cnt, sum;
	node() : mx(0), cnt(0), sum(0) {}
	node(int _mx, int _cnt, int _sum) : mx(_mx), cnt(_cnt), sum(_sum) {}
} d[mxn * 220];

node operator+(const node &a, const node &b) {
	node ret(0, 0, 0);
	ret.mx = max(a.mx, a.sum + b.mx);
	ret.sum = a.sum + b.sum;
	if(ret.mx == a.mx) ret.cnt += a.cnt;
	if(ret.mx == b.mx + a.sum) ret.cnt += b.cnt;
	return ret;
}

int lch[mxn * 220], rch[mxn * 220], p[mxn], q[mxn], pos[mxn], root[mxn], T;

int build(int l, int r) {
	int save = ++T;
	int m = (l + r) / 2;
	d[save].mx = 0;
	d[save].cnt = r - l + 1;
	d[save].sum = 0;
	if(l < r) {
		lch[save] = build(l, m);
		rch[save] = build(m + 1, r);
	}
	return save;
}

int update(int l, int r, int i, int x, int y) {
	int save = ++T;
	if(l == r) {
		d[save] = d[i];
		d[save].mx += y;
		d[save].sum += y;
		d[save].cnt = 1;
		return save;
	}
	int m = (l + r) / 2;
	if(x <= m) {
		lch[save] = update(l, m, lch[i], x, y);
		rch[save] = rch[i];
	} else {
		lch[save] = lch[i];
		rch[save] = update(m + 1, r, rch[i], x, y);
	}
	d[save] = d[lch[save]] + d[rch[save]];
	return save;
}

map<int, int> mp;

void add(node x) {
	mp[x.mx] += x.cnt;
}

void rem(node x) {
	mp[x.mx] -= x.cnt;
	if(mp[x.mx] == 0) mp.erase(x.mx);
}

void print_ans() {
	auto val = *mp.rbegin();
	assert(val.ss != 0);
	cout << val.ff << ' ' << val.ss << endl;
}

void go() {
	int n, k, Q;
	cin >> n >> k >> Q;
	for(int i = 1; i <= n; i++) {
		cin >> p[i];
	}
	for(int i = 1; i <= n; i++) {
		cin >> q[i];
		pos[q[i]] = i;
	}
	root[0] = build(1, n);
	for(int i = 1; i <= n; i++) {
		root[i] = update(1, n, root[i - 1], max(k, pos[p[i]]), 1);
		if(pos[p[i]] + k <= n) root[i] = update(1, n, root[i], pos[p[i]] + k, -1);
		if(i - k > 0) {
			root[i] = update(1, n, root[i], max(k, pos[p[i - k]]), -1);
			if(pos[p[i - k]] + k <= n) root[i] = update(1, n, root[i], pos[p[i - k]] + k, 1);
		}
		if(i >= k) add(d[root[i]]);
	}
	print_ans();
	// cout << endl;
	while(Q--) {
		int x;
		cin >> x;
		if(x >= k) {
			rem(d[root[x]]);
			root[x] = update(1, n, root[x], max(k, pos[p[x]]), -1);
			if(pos[p[x]] + k <= n) root[x] = update(1, n, root[x], pos[p[x]] + k, 1);
			root[x] = update(1, n, root[x], max(k, pos[p[x + 1]]), 1);
			if(pos[p[x + 1]] + k <= n) root[x] = update(1, n, root[x], pos[p[x + 1]] + k, -1);
			add(d[root[x]]);
		}
		if(x + k <= n) {
			rem(d[root[x + k]]);
			root[x + k] = update(1, n, root[x + k], max(k, pos[p[x + 1]]), -1);
			if(pos[p[x + 1]] + k <= n) root[x + k] = update(1, n, root[x + k], pos[p[x + 1]] + k, 1);
			root[x + k] = update(1, n, root[x + k], max(k, pos[p[x]]), 1);
			if(pos[p[x]] + k <= n) root[x + k] = update(1, n, root[x + k], pos[p[x]] + k, -1);
			add(d[root[x + k]]);
		}
		swap(p[x], p[x + 1]);
		// cout << "------------------------------\n";
		// for(int i = 1; i <= n; i++) {
		// 	cout << p[i] << ' ';
		// }
		// cout << endl;
		// for(int i = 1; i <= n; i++) {
		// 	cout << q[i] << ' ';
		// }
		// cout << endl;
		// cout << "----------------------------\n";
		// for(int i = 1; i <= n; i++) {
		// 	cout << d[root[i]].mx << ' ' << d[root[i]].cnt << ' ' << d[root[i]].sum << endl;
		// }
		print_ans();
		// cout << "---------------------fuckkkk ends here\n";
		// cout << '\n';
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct
16 Correct 55 ms 268256 KB Output is correct
17 Correct 53 ms 268220 KB Output is correct
18 Correct 50 ms 264020 KB Output is correct
19 Correct 52 ms 263944 KB Output is correct
20 Correct 56 ms 268032 KB Output is correct
21 Correct 53 ms 268116 KB Output is correct
22 Correct 50 ms 264016 KB Output is correct
23 Correct 59 ms 268244 KB Output is correct
24 Correct 53 ms 268144 KB Output is correct
25 Correct 51 ms 266068 KB Output is correct
26 Correct 53 ms 268236 KB Output is correct
27 Correct 54 ms 268116 KB Output is correct
28 Correct 53 ms 264020 KB Output is correct
29 Correct 52 ms 264016 KB Output is correct
30 Correct 51 ms 264016 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct
16 Correct 55 ms 268256 KB Output is correct
17 Correct 53 ms 268220 KB Output is correct
18 Correct 50 ms 264020 KB Output is correct
19 Correct 52 ms 263944 KB Output is correct
20 Correct 56 ms 268032 KB Output is correct
21 Correct 53 ms 268116 KB Output is correct
22 Correct 50 ms 264016 KB Output is correct
23 Correct 59 ms 268244 KB Output is correct
24 Correct 53 ms 268144 KB Output is correct
25 Correct 51 ms 266068 KB Output is correct
26 Correct 53 ms 268236 KB Output is correct
27 Correct 54 ms 268116 KB Output is correct
28 Correct 53 ms 264020 KB Output is correct
29 Correct 52 ms 264016 KB Output is correct
30 Correct 51 ms 264016 KB Output is correct
31 Correct 220 ms 321712 KB Output is correct
32 Correct 203 ms 321620 KB Output is correct
33 Correct 76 ms 280716 KB Output is correct
34 Correct 145 ms 296988 KB Output is correct
35 Correct 262 ms 321760 KB Output is correct
36 Correct 126 ms 317632 KB Output is correct
37 Correct 85 ms 280656 KB Output is correct
38 Correct 244 ms 317656 KB Output is correct
39 Incorrect 146 ms 321728 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct
16 Correct 49 ms 263944 KB Output is correct
17 Correct 49 ms 264132 KB Output is correct
18 Correct 49 ms 264016 KB Output is correct
19 Correct 49 ms 263968 KB Output is correct
20 Correct 50 ms 264064 KB Output is correct
21 Correct 49 ms 264020 KB Output is correct
22 Correct 54 ms 264020 KB Output is correct
23 Correct 51 ms 264016 KB Output is correct
24 Correct 50 ms 264020 KB Output is correct
25 Correct 50 ms 264048 KB Output is correct
26 Correct 50 ms 264064 KB Output is correct
27 Correct 50 ms 264020 KB Output is correct
28 Correct 50 ms 264020 KB Output is correct
29 Correct 51 ms 264020 KB Output is correct
30 Correct 50 ms 264024 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct
16 Correct 55 ms 268256 KB Output is correct
17 Correct 53 ms 268220 KB Output is correct
18 Correct 50 ms 264020 KB Output is correct
19 Correct 52 ms 263944 KB Output is correct
20 Correct 56 ms 268032 KB Output is correct
21 Correct 53 ms 268116 KB Output is correct
22 Correct 50 ms 264016 KB Output is correct
23 Correct 59 ms 268244 KB Output is correct
24 Correct 53 ms 268144 KB Output is correct
25 Correct 51 ms 266068 KB Output is correct
26 Correct 53 ms 268236 KB Output is correct
27 Correct 54 ms 268116 KB Output is correct
28 Correct 53 ms 264020 KB Output is correct
29 Correct 52 ms 264016 KB Output is correct
30 Correct 51 ms 264016 KB Output is correct
31 Correct 49 ms 263944 KB Output is correct
32 Correct 49 ms 264132 KB Output is correct
33 Correct 49 ms 264016 KB Output is correct
34 Correct 49 ms 263968 KB Output is correct
35 Correct 50 ms 264064 KB Output is correct
36 Correct 49 ms 264020 KB Output is correct
37 Correct 54 ms 264020 KB Output is correct
38 Correct 51 ms 264016 KB Output is correct
39 Correct 50 ms 264020 KB Output is correct
40 Correct 50 ms 264048 KB Output is correct
41 Correct 50 ms 264064 KB Output is correct
42 Correct 50 ms 264020 KB Output is correct
43 Correct 50 ms 264020 KB Output is correct
44 Correct 51 ms 264020 KB Output is correct
45 Correct 50 ms 264024 KB Output is correct
46 Correct 71 ms 272376 KB Output is correct
47 Correct 72 ms 272340 KB Output is correct
48 Correct 64 ms 264140 KB Output is correct
49 Correct 62 ms 268288 KB Output is correct
50 Correct 72 ms 272244 KB Output is correct
51 Correct 57 ms 264020 KB Output is correct
52 Correct 64 ms 268112 KB Output is correct
53 Correct 70 ms 272212 KB Output is correct
54 Correct 73 ms 272204 KB Output is correct
55 Correct 59 ms 268048 KB Output is correct
56 Correct 83 ms 272208 KB Output is correct
57 Correct 70 ms 272392 KB Output is correct
58 Correct 58 ms 268112 KB Output is correct
59 Correct 68 ms 268280 KB Output is correct
60 Correct 58 ms 266064 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 264016 KB Output is correct
2 Correct 50 ms 264052 KB Output is correct
3 Correct 49 ms 264004 KB Output is correct
4 Correct 52 ms 264020 KB Output is correct
5 Correct 53 ms 264020 KB Output is correct
6 Correct 50 ms 264128 KB Output is correct
7 Correct 53 ms 264020 KB Output is correct
8 Correct 52 ms 263884 KB Output is correct
9 Correct 49 ms 264024 KB Output is correct
10 Correct 50 ms 264020 KB Output is correct
11 Correct 49 ms 264020 KB Output is correct
12 Correct 49 ms 263972 KB Output is correct
13 Correct 50 ms 263940 KB Output is correct
14 Correct 56 ms 263980 KB Output is correct
15 Correct 51 ms 264016 KB Output is correct
16 Correct 55 ms 268256 KB Output is correct
17 Correct 53 ms 268220 KB Output is correct
18 Correct 50 ms 264020 KB Output is correct
19 Correct 52 ms 263944 KB Output is correct
20 Correct 56 ms 268032 KB Output is correct
21 Correct 53 ms 268116 KB Output is correct
22 Correct 50 ms 264016 KB Output is correct
23 Correct 59 ms 268244 KB Output is correct
24 Correct 53 ms 268144 KB Output is correct
25 Correct 51 ms 266068 KB Output is correct
26 Correct 53 ms 268236 KB Output is correct
27 Correct 54 ms 268116 KB Output is correct
28 Correct 53 ms 264020 KB Output is correct
29 Correct 52 ms 264016 KB Output is correct
30 Correct 51 ms 264016 KB Output is correct
31 Correct 220 ms 321712 KB Output is correct
32 Correct 203 ms 321620 KB Output is correct
33 Correct 76 ms 280716 KB Output is correct
34 Correct 145 ms 296988 KB Output is correct
35 Correct 262 ms 321760 KB Output is correct
36 Correct 126 ms 317632 KB Output is correct
37 Correct 85 ms 280656 KB Output is correct
38 Correct 244 ms 317656 KB Output is correct
39 Incorrect 146 ms 321728 KB Output isn't correct
40 Halted 0 ms 0 KB -