Submission #1026945

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1026945	2024-07-18T14:28:09 Z	vjudge1	Sličnost (COI23_slicnost)	C++17	67 / 100	938 ms	524288 KB

Main

#include <bits/stdc++.h>
using namespace std;

void f(){
	#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	#endif
}

struct segtree{
	int n, tl, tr, val, pos; 
	vector<int> roots, left, right;

	vector<array<long long , 3>> st;


	array<long long, 3> TxT(array<long long, 3> l, array<long long, 3> r){
		
		array<long long, 3> res={0, 0, 0};
	
		res[0]=l[0]+r[0];
		res[1]=max(l[1], l[0]+r[1]);

		if(l[1]==res[1]) res[2]+=l[2];
		if(r[1]+l[0]==res[1]) res[2]+=r[2];

		return res;
	}

	int add(){
		int id=st.size();
		st.push_back({0, 0, 0});
		left.push_back(-1);
		right.push_back(-1);
		return id;
	}

	segtree(int _n){
		n=_n;

		int v=add();

		roots.push_back(v);
		build(v, 0, n-1);
	}

	void build(int v, int l, int r){
		if(l==r) st[v]={0, 0, 1};
		else{
			int mid=(l+r)/2;
			if(left[v]==-1) left[v]=add();
			if(right[v]==-1) right[v]=add();

			build(left[v], l, mid);
			build(right[v], mid+1, r);

			st[v]=TxT(st[left[v]], st[right[v]]);
		}
	}


	void update(int v, int l, int r, int nv){
		if(l==r){
			st[nv]=st[v];
			st[nv][0]+=val; st[nv][1]+=val;
		}
		else{
			int mid=(l+r) / 2;
			if(pos<=mid){
				left[nv]=add();
				right[nv]=right[v];
				update(left[v], l, mid, left[nv]);
			}
			else{
				left[nv]=left[v];
				right[nv]=add();
				update(right[v], mid+1, r, right[nv]);
			}
			st[nv]=TxT(st[left[nv]], st[right[nv]]);
		}


	}
	int upd(int p, int l, int v){
		pos=l, val=v;
		int id=add();
		roots.push_back(id);
		update(p, 0, n-1, id);
		return id;
	}

	array<long long, 3> g(int v, int l, int r){
		if(l>tr||r<tl) return {0, 0, 0};
		else if(l>=tl&&r<=tr) return st[v];
		else{
			int mid=(l+r) /2;
			return TxT(g(left[v], l, mid), g(right[v], mid+1, r));

		}
	}
	array<long long, 2> get(int pos, int l, int r){
		tl = l; tr = r;
		auto x= g(pos, 0, n-1);

		return (array<long long, 2>){x[1], x[2]};
	}
};

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	//f();

	int n, k, q; cin >> n >> k >> q;

	segtree st(n+1);

	vector<int> a(n), b(n), pos(n), segt;
	int c=0;
	for(auto &i: a) cin >> i, i--;
	for(auto &i: b) cin >> i, i--, pos[i]=c++;

	auto ek=[&](int y, int i){
		int r=pos[i];

		int x=st.upd(y, max(0, r-k+1), 1);
		st.upd(x, r+1, -1);
		return (int) st.roots.back();
	
	};
	auto cik=[&](int y, int i){
		int r=pos[i];
		int x= st.upd(y, max(0, r-k+1), -1);
		st.upd(x, r+1, 1);
		return (int)st.roots.back();
	};

	for(int i=0; i<k; i++){
		ek(st.roots.back(), a[i]);
	}
	segt.push_back(st.roots.back());
	
	vector<array<long long,2>> all(n-k+1);
	vector<long long> pf(n+3);

	auto x=st.get(st.roots.back(), 0, n-k);
	all[0]=x;
	pf[x[0]]+=x[1];
	
	for(int i=k; i<n; i++){
		cik(st.roots.back(), a[i-k]); 
		segt.push_back(ek(st.roots.back(), a[i]));
		auto y=st.get(segt.back(), 0, n-k);
		all[i-k+1]=y;
		pf[y[0]]+=y[1];

		if(y[0]==x[0]) x[1]+=y[1];
		else if(y[0]>x[0]) x=y;
	}
		
	cout<<x[0]<<" "<<x[1]<<"\n";

	auto cikar=[&](int v, int value){
		if(v<0) return;
		
		pf[all[v][0]] -= all[v][1];
		segt[v]=cik(segt[v], value);
		auto x=st.get(segt[v], 0, n-k);
		all[v] = x;
		pf[all[v][0]] += all[v][1];
	};

	auto cikar2=[&](int v, int value){
		if(v>n-k) return;
		
		pf[all[v][0]] -= all[v][1];
		segt[v]=cik(segt[v], value);
		auto x=st.get(segt[v], 0, n-k);
		all[v] = x;
		pf[all[v][0]] += all[v][1];
	};
	auto ekle=[&](int v, int value){
		if(v<0) return;
		
		pf[all[v][0]] -= all[v][1];
		segt[v]=ek(segt[v], value);
		auto x=st.get(segt[v], 0, n-k);

		all[v] = x;
		pf[all[v][0]] += all[v][1];
	};

	auto ekle2=[&](int v, int value){
		if(v>n-k) return;
		
		pf[all[v][0]] -= all[v][1];
		segt[v]=ek(segt[v], value);
		auto x=st.get(segt[v], 0, n-k);

		all[v] = x;
		pf[all[v][0]] += all[v][1];
	};

	int ma=x[0];
	while(q--){
		int p; cin >> p; p--;
		
		cikar(p-k+1, a[p]);
		cikar2(p+1, a[p+1]);

		swap(a[p], a[p+1]);

		ekle(p-k+1, a[p]);
		ekle2(p+1, a[p+1]);

		if(pf[ma+1]>0) ma++;
		else if(pf[ma]==0) ma--;

		cout<<ma<<" "<<pf[ma]<<"\n";
	}
}

Compilation message

Main.cpp: In function 'void f()':
Main.cpp:6:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |  freopen("in.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:7:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  freopen("out.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	11 ms	17084 KB	Output is correct
17	Correct	11 ms	16536 KB	Output is correct
18	Correct	8 ms	8708 KB	Output is correct
19	Correct	10 ms	8712 KB	Output is correct
20	Correct	13 ms	17924 KB	Output is correct
21	Correct	9 ms	9476 KB	Output is correct
22	Correct	9 ms	8748 KB	Output is correct
23	Correct	11 ms	10244 KB	Output is correct
24	Correct	12 ms	17412 KB	Output is correct
25	Correct	10 ms	9652 KB	Output is correct
26	Correct	10 ms	9476 KB	Output is correct
27	Correct	11 ms	9424 KB	Output is correct
28	Correct	9 ms	9476 KB	Output is correct
29	Correct	7 ms	9736 KB	Output is correct
30	Correct	6 ms	9992 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	11 ms	17084 KB	Output is correct
17	Correct	11 ms	16536 KB	Output is correct
18	Correct	8 ms	8708 KB	Output is correct
19	Correct	10 ms	8712 KB	Output is correct
20	Correct	13 ms	17924 KB	Output is correct
21	Correct	9 ms	9476 KB	Output is correct
22	Correct	9 ms	8748 KB	Output is correct
23	Correct	11 ms	10244 KB	Output is correct
24	Correct	12 ms	17412 KB	Output is correct
25	Correct	10 ms	9652 KB	Output is correct
26	Correct	10 ms	9476 KB	Output is correct
27	Correct	11 ms	9424 KB	Output is correct
28	Correct	9 ms	9476 KB	Output is correct
29	Correct	7 ms	9736 KB	Output is correct
30	Correct	6 ms	9992 KB	Output is correct
31	Correct	303 ms	256460 KB	Output is correct
32	Correct	314 ms	256324 KB	Output is correct
33	Correct	137 ms	138960 KB	Output is correct
34	Correct	280 ms	254412 KB	Output is correct
35	Correct	388 ms	258228 KB	Output is correct
36	Correct	263 ms	262268 KB	Output is correct
37	Correct	126 ms	147404 KB	Output is correct
38	Correct	331 ms	256456 KB	Output is correct
39	Correct	277 ms	256872 KB	Output is correct
40	Correct	291 ms	254204 KB	Output is correct
41	Correct	332 ms	254328 KB	Output is correct
42	Correct	364 ms	259864 KB	Output is correct
43	Correct	294 ms	254020 KB	Output is correct
44	Correct	271 ms	254152 KB	Output is correct
45	Correct	153 ms	147656 KB	Output is correct

Subtask #4
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	844 KB	Output is correct
17	Correct	1 ms	848 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	604 KB	Output is correct
20	Correct	1 ms	860 KB	Output is correct
21	Correct	0 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	844 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	0 ms	604 KB	Output is correct
26	Correct	1 ms	848 KB	Output is correct
27	Correct	1 ms	848 KB	Output is correct
28	Correct	0 ms	604 KB	Output is correct
29	Correct	0 ms	604 KB	Output is correct
30	Correct	0 ms	604 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	11 ms	17084 KB	Output is correct
17	Correct	11 ms	16536 KB	Output is correct
18	Correct	8 ms	8708 KB	Output is correct
19	Correct	10 ms	8712 KB	Output is correct
20	Correct	13 ms	17924 KB	Output is correct
21	Correct	9 ms	9476 KB	Output is correct
22	Correct	9 ms	8748 KB	Output is correct
23	Correct	11 ms	10244 KB	Output is correct
24	Correct	12 ms	17412 KB	Output is correct
25	Correct	10 ms	9652 KB	Output is correct
26	Correct	10 ms	9476 KB	Output is correct
27	Correct	11 ms	9424 KB	Output is correct
28	Correct	9 ms	9476 KB	Output is correct
29	Correct	7 ms	9736 KB	Output is correct
30	Correct	6 ms	9992 KB	Output is correct
31	Correct	1 ms	844 KB	Output is correct
32	Correct	1 ms	848 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	1 ms	860 KB	Output is correct
36	Correct	0 ms	604 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	2 ms	844 KB	Output is correct
39	Correct	1 ms	860 KB	Output is correct
40	Correct	0 ms	604 KB	Output is correct
41	Correct	1 ms	848 KB	Output is correct
42	Correct	1 ms	848 KB	Output is correct
43	Correct	0 ms	604 KB	Output is correct
44	Correct	0 ms	604 KB	Output is correct
45	Correct	0 ms	604 KB	Output is correct
46	Correct	31 ms	33776 KB	Output is correct
47	Correct	33 ms	33256 KB	Output is correct
48	Correct	7 ms	9992 KB	Output is correct
49	Correct	22 ms	18208 KB	Output is correct
50	Correct	36 ms	32796 KB	Output is correct
51	Correct	9 ms	8456 KB	Output is correct
52	Correct	30 ms	31660 KB	Output is correct
53	Correct	33 ms	31228 KB	Output is correct
54	Correct	40 ms	32492 KB	Output is correct
55	Correct	17 ms	18432 KB	Output is correct
56	Correct	36 ms	33200 KB	Output is correct
57	Correct	38 ms	32068 KB	Output is correct
58	Correct	16 ms	17408 KB	Output is correct
59	Correct	31 ms	31388 KB	Output is correct
60	Correct	13 ms	16388 KB	Output is correct

Subtask #6
0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	592 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	11 ms	17084 KB	Output is correct
17	Correct	11 ms	16536 KB	Output is correct
18	Correct	8 ms	8708 KB	Output is correct
19	Correct	10 ms	8712 KB	Output is correct
20	Correct	13 ms	17924 KB	Output is correct
21	Correct	9 ms	9476 KB	Output is correct
22	Correct	9 ms	8748 KB	Output is correct
23	Correct	11 ms	10244 KB	Output is correct
24	Correct	12 ms	17412 KB	Output is correct
25	Correct	10 ms	9652 KB	Output is correct
26	Correct	10 ms	9476 KB	Output is correct
27	Correct	11 ms	9424 KB	Output is correct
28	Correct	9 ms	9476 KB	Output is correct
29	Correct	7 ms	9736 KB	Output is correct
30	Correct	6 ms	9992 KB	Output is correct
31	Correct	303 ms	256460 KB	Output is correct
32	Correct	314 ms	256324 KB	Output is correct
33	Correct	137 ms	138960 KB	Output is correct
34	Correct	280 ms	254412 KB	Output is correct
35	Correct	388 ms	258228 KB	Output is correct
36	Correct	263 ms	262268 KB	Output is correct
37	Correct	126 ms	147404 KB	Output is correct
38	Correct	331 ms	256456 KB	Output is correct
39	Correct	277 ms	256872 KB	Output is correct
40	Correct	291 ms	254204 KB	Output is correct
41	Correct	332 ms	254328 KB	Output is correct
42	Correct	364 ms	259864 KB	Output is correct
43	Correct	294 ms	254020 KB	Output is correct
44	Correct	271 ms	254152 KB	Output is correct
45	Correct	153 ms	147656 KB	Output is correct
46	Correct	1 ms	844 KB	Output is correct
47	Correct	1 ms	848 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	604 KB	Output is correct
50	Correct	1 ms	860 KB	Output is correct
51	Correct	0 ms	604 KB	Output is correct
52	Correct	1 ms	604 KB	Output is correct
53	Correct	2 ms	844 KB	Output is correct
54	Correct	1 ms	860 KB	Output is correct
55	Correct	0 ms	604 KB	Output is correct
56	Correct	1 ms	848 KB	Output is correct
57	Correct	1 ms	848 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	0 ms	604 KB	Output is correct
60	Correct	0 ms	604 KB	Output is correct
61	Correct	31 ms	33776 KB	Output is correct
62	Correct	33 ms	33256 KB	Output is correct
63	Correct	7 ms	9992 KB	Output is correct
64	Correct	22 ms	18208 KB	Output is correct
65	Correct	36 ms	32796 KB	Output is correct
66	Correct	9 ms	8456 KB	Output is correct
67	Correct	30 ms	31660 KB	Output is correct
68	Correct	33 ms	31228 KB	Output is correct
69	Correct	40 ms	32492 KB	Output is correct
70	Correct	17 ms	18432 KB	Output is correct
71	Correct	36 ms	33200 KB	Output is correct
72	Correct	38 ms	32068 KB	Output is correct
73	Correct	16 ms	17408 KB	Output is correct
74	Correct	31 ms	31388 KB	Output is correct
75	Correct	13 ms	16388 KB	Output is correct
76	Runtime error	938 ms	524288 KB	Execution killed with signal 9
77	Halted	0 ms	0 KB	-

Submission #1026945

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 10.0 / 10.0

Subtask #3 33.0 / 33.0

Subtask #4 7.0 / 7.0

Subtask #5 10.0 / 10.0

Subtask #6 0 / 33.0

Subtask #1
7.0 / 7.0

Subtask #2
10.0 / 10.0

Subtask #3
33.0 / 33.0

Subtask #4
7.0 / 7.0

Subtask #5
10.0 / 10.0

Subtask #6
0 / 33.0