oj.uz

Submission #957213

# Submission time Handle Problem Language Result Execution time Memory
957213 2024-04-03T07:28:00 Z ono_de206 Sličnost (COI23_slicnost) C++14
50 / 100
 162 ms 11868 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;
pair<int, int> d[mxn * 4];
int lz[mxn * 4], p[mxn], q[mxn], pos[mxn];

pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
	if(a.ff < b.ff) return b;
	if(a.ff == b.ff) return make_pair(a.ff, a.ss + b.ss);
	return a;
}

void build(int l, int r, int i) {
	if(l == r) {
		d[i] = {0, 1};
		return;
	}
	int m = (l + r) / 2;
	build(l, m, i * 2);
	build(m + 1, r, i * 2 + 1);
	d[i] = merge(d[i * 2], d[i * 2 + 1]);
}

void pro(int i, int l, int r) {
	if(lz[i] == 0) return;
	d[i].ff += lz[i];
	if(l < r) {
		lz[i * 2] += lz[i];
		lz[i * 2 + 1] += lz[i];
	}
	lz[i] = 0;
}

void update(int l, int r, int i, int x, int y, int c) {
	pro(i, l, r);
	if(l >= x && r <= y) {
		lz[i] += c;
		pro(i, l, r);
		return;
	}
	if(l > y || r < x) return;
	int m = (l + r) / 2;
	update(l, m, i * 2, x, y, c);
	update(m + 1, r, i * 2 + 1, x, y, c);
	d[i] = merge(d[i * 2], d[i * 2 + 1]);
}

void go() {
	int n, k, Q;
	cin >> n >> k >> Q;
	for(int i = 1; i <= n; i++) {
		cin >> p[i];
		pos[p[i]] = i;
	}
	for(int i = 1; i <= n; i++) {
		cin >> q[i];
	}
	build(1, n, 1);
	pair<int, int> ans{0, 0};
	for(int i = 1; i <= n; i++) {
		int l = max(k, pos[q[i]]), r = min(n, pos[q[i]] + k - 1);
		update(1, n, 1, l, r, 1);
		if(i - k > 0) {
			l = max(k, pos[q[i - k]]), r = min(n, pos[q[i - k]] + k - 1);
			update(1, n, 1, l, r, -1);
		}
		if(i >= k) {
			ans = merge(ans, d[1]);
		}
	}
	cout << ans << endl;
}

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 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct
16 Correct 4 ms 992 KB Output is correct
17 Correct 3 ms 996 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 6 ms 856 KB Output is correct
28 Correct 5 ms 856 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 2 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct
16 Correct 4 ms 992 KB Output is correct
17 Correct 3 ms 996 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 6 ms 856 KB Output is correct
28 Correct 5 ms 856 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 64 ms 9460 KB Output is correct
32 Correct 69 ms 9764 KB Output is correct
33 Correct 33 ms 11864 KB Output is correct
34 Correct 79 ms 11868 KB Output is correct
35 Correct 158 ms 10328 KB Output is correct
36 Correct 85 ms 9864 KB Output is correct
37 Correct 31 ms 8024 KB Output is correct
38 Correct 115 ms 9956 KB Output is correct
39 Correct 91 ms 10084 KB Output is correct
40 Correct 87 ms 9236 KB Output is correct
41 Correct 102 ms 9508 KB Output is correct
42 Correct 162 ms 9864 KB Output is correct
43 Correct 87 ms 10072 KB Output is correct
44 Correct 61 ms 11864 KB Output is correct
45 Correct 39 ms 8144 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct
16 Incorrect 0 ms 344 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct
16 Correct 4 ms 992 KB Output is correct
17 Correct 3 ms 996 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 6 ms 856 KB Output is correct
28 Correct 5 ms 856 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4560 KB Output is correct
15 Correct 1 ms 4448 KB Output is correct
16 Correct 4 ms 992 KB Output is correct
17 Correct 3 ms 996 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 6 ms 856 KB Output is correct
28 Correct 5 ms 856 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 64 ms 9460 KB Output is correct
32 Correct 69 ms 9764 KB Output is correct
33 Correct 33 ms 11864 KB Output is correct
34 Correct 79 ms 11868 KB Output is correct
35 Correct 158 ms 10328 KB Output is correct
36 Correct 85 ms 9864 KB Output is correct
37 Correct 31 ms 8024 KB Output is correct
38 Correct 115 ms 9956 KB Output is correct
39 Correct 91 ms 10084 KB Output is correct
40 Correct 87 ms 9236 KB Output is correct
41 Correct 102 ms 9508 KB Output is correct
42 Correct 162 ms 9864 KB Output is correct
43 Correct 87 ms 10072 KB Output is correct
44 Correct 61 ms 11864 KB Output is correct
45 Correct 39 ms 8144 KB Output is correct
46 Incorrect 0 ms 344 KB Output isn't correct
47 Halted 0 ms 0 KB -