답안 #696390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696390	2023-02-06T11:12:52 Z	youngyojun	Bread First Search (CCO21_day2problem2)	C++17	11 / 25	28 ms	716 KB

Main

#include <bits/stdc++.h>
#define upmin(a,b) (a)=(min((a),(b)))
#define INF (0x3f3f3f3f)
using namespace std;

const int MAXN = 5'005;

int D[MAXN], L[MAXN], B[MAXN];

int A[MAXN];

int N;

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

{
	int M;
	cin >> N >> M;
	fill_n(A, N+2, INF);
	while(M--) {
		int a, b; cin >> a >> b;
		if(a > b) swap(a, b);
		upmin(A[b], a);
	}
}

	L[N+1] = N;
	for(int i = N; i; i--) L[i] = min({L[i+1], A[i], i-1});

	for(int i = N; i; i--) if(A[i] < i) { B[A[i]+1]++; B[i+1]--; }
	for(int i = 1; i <= N; i++) B[i+1] += B[i];

	for(int i = N; i; i--) {
		int r = 0;
		for(int j = N+1; i < j; j--) if(i <= L[j]) {
			if(1 == i && 2 != j) continue;
			int t = D[j] + B[j];
			if(r < t) r = t;
		}
		D[i] = r;
	}

	cout << N-1 - D[1] << '\n';

	return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

6.0 / 6.0

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

Subtask #3

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	28 ms	340 KB	Output is correct
24	Correct	26 ms	340 KB	Output is correct
25	Correct	17 ms	544 KB	Output is correct
26	Correct	15 ms	468 KB	Output is correct
27	Correct	20 ms	460 KB	Output is correct
28	Correct	15 ms	492 KB	Output is correct
29	Correct	15 ms	336 KB	Output is correct
30	Correct	24 ms	716 KB	Output is correct
31	Correct	15 ms	696 KB	Output is correct
32	Runtime error	1 ms	456 KB	Execution killed with signal 11
33	Halted	0 ms	0 KB	-