답안 #791623

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
791623	2023-07-24T08:09:19 Z	박상훈(#10047)	Sličnost (COI23_slicnost)	C++17	57 / 100	3000 ms	7208 KB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

struct Node{
	int mx;
	ll cnt;
	Node(){}
	Node(int _mx, ll _cnt): mx(_mx), cnt(_cnt) {}

	Node operator + (const Node &N) const{
		if (mx > N.mx) return *this;
		if (mx < N.mx) return N;
		return Node(mx, cnt + N.cnt);
	}
};

struct Seg{
	Node tree[400400];
	int lazy[400400];

	void init(int i, int l, int r){
		tree[i] = Node(0, r-l+1);
		lazy[i] = 0;
		if (l==r) return;

		int m = (l+r)>>1;
		init(i<<1, l, m); init(i<<1|1, m+1, r);
	}

	void propagate(int i, int l, int r){
		tree[i].mx += lazy[i];

		if (l!=r){
			lazy[i<<1] += lazy[i];
			lazy[i<<1|1] += lazy[i];
		}

		lazy[i] = 0;
	}

	void update(int i, int l, int r, int s, int e, int x){
		propagate(i, l, r);
		if (r<s || e<l) return;
		if (s<=l && r<=e){
			lazy[i] += x;
			propagate(i, l, r);
			return;
		}

		int m = (l+r)>>1;
		update(i<<1, l, m, s, e, x); update(i<<1|1, m+1, r, s, e, x);
		tree[i] = tree[i<<1] + tree[i<<1|1];
	}
}tree;

int n, k, q;
int a[100100], b[100100], pos[100100];

void naive(){
	tree.init(1, 1, n-k+1);
	for (int i=1;i<=k-1;i++){
		tree.update(1, 1, n-k+1, max(1, pos[a[i]]-k+1), min(n-k+1, pos[a[i]]), 1);
	}

	Node ans(0, 0);

	for (int i=k;i<=n;i++){
		tree.update(1, 1, n-k+1, max(1, pos[a[i]]-k+1), min(n-k+1, pos[a[i]]), 1);
		ans = ans + tree.tree[1];
		tree.update(1, 1, n-k+1, max(1, pos[a[i-k+1]]-k+1), min(n-k+1, pos[a[i-k+1]]), -1);
	}

	printf("%d %lld\n", ans.mx, ans.cnt);
}

int main(){
	scanf("%d %d %d", &n, &k, &q);

	for (int i=1;i<=n;i++) scanf("%d", a+i);
	for (int i=1;i<=n;i++){
		scanf("%d", b+i);
		pos[b[i]] = i;
	} 

	for (int i=1;i<=n;i++) assert(a[i] <= n && b[i] <= n);

	naive();

	while(q--){
		int x;
		scanf("%d", &x);
		swap(a[x], a[x+1]);

		naive();
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |  scanf("%d %d %d", &n, &k, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:81:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |  for (int i=1;i<=n;i++) scanf("%d", a+i);
      |                         ~~~~~^~~~~~~~~~~
Main.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |   scanf("%d", b+i);
      |   ~~~~~^~~~~~~~~~~
Main.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |   scanf("%d", &x);
      |   ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	4 ms	596 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	4 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	3 ms	468 KB	Output is correct
26	Correct	3 ms	544 KB	Output is correct
27	Correct	4 ms	596 KB	Output is correct
28	Correct	3 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	4 ms	596 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	4 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	3 ms	468 KB	Output is correct
26	Correct	3 ms	544 KB	Output is correct
27	Correct	4 ms	596 KB	Output is correct
28	Correct	3 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	60 ms	6580 KB	Output is correct
32	Correct	64 ms	6580 KB	Output is correct
33	Correct	14 ms	1364 KB	Output is correct
34	Correct	55 ms	3936 KB	Output is correct
35	Correct	109 ms	6512 KB	Output is correct
36	Correct	85 ms	6568 KB	Output is correct
37	Correct	17 ms	1692 KB	Output is correct
38	Correct	98 ms	6556 KB	Output is correct
39	Correct	81 ms	6608 KB	Output is correct
40	Correct	68 ms	4308 KB	Output is correct
41	Correct	88 ms	7208 KB	Output is correct
42	Correct	110 ms	7008 KB	Output is correct
43	Correct	60 ms	4632 KB	Output is correct
44	Correct	48 ms	4508 KB	Output is correct
45	Correct	19 ms	2232 KB	Output is correct

Subtask #4
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	2 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	212 KB	Output is correct
27	Correct	2 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	2 ms	344 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct

Subtask #5
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	4 ms	596 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	4 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	3 ms	468 KB	Output is correct
26	Correct	3 ms	544 KB	Output is correct
27	Correct	4 ms	596 KB	Output is correct
28	Correct	3 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	2 ms	340 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	2 ms	212 KB	Output is correct
42	Correct	2 ms	212 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	2 ms	344 KB	Output is correct
45	Correct	1 ms	212 KB	Output is correct
46	Execution timed out	3052 ms	700 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #6
0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	4 ms	596 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	4 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	3 ms	468 KB	Output is correct
26	Correct	3 ms	544 KB	Output is correct
27	Correct	4 ms	596 KB	Output is correct
28	Correct	3 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	60 ms	6580 KB	Output is correct
32	Correct	64 ms	6580 KB	Output is correct
33	Correct	14 ms	1364 KB	Output is correct
34	Correct	55 ms	3936 KB	Output is correct
35	Correct	109 ms	6512 KB	Output is correct
36	Correct	85 ms	6568 KB	Output is correct
37	Correct	17 ms	1692 KB	Output is correct
38	Correct	98 ms	6556 KB	Output is correct
39	Correct	81 ms	6608 KB	Output is correct
40	Correct	68 ms	4308 KB	Output is correct
41	Correct	88 ms	7208 KB	Output is correct
42	Correct	110 ms	7008 KB	Output is correct
43	Correct	60 ms	4632 KB	Output is correct
44	Correct	48 ms	4508 KB	Output is correct
45	Correct	19 ms	2232 KB	Output is correct
46	Correct	2 ms	340 KB	Output is correct
47	Correct	2 ms	340 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	2 ms	340 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	2 ms	340 KB	Output is correct
53	Correct	2 ms	340 KB	Output is correct
54	Correct	2 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	2 ms	212 KB	Output is correct
57	Correct	2 ms	212 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	2 ms	344 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Execution timed out	3052 ms	700 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #791623

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 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
0 / 10.0

Subtask #6
0 / 33.0