oj.uz

답안 #696370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
696370 2023-02-06T10:49:49 Z youngyojun Bread First Search (CCO21_day2problem2) C++17
5 / 25
 2000 ms 344 KB 
#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];

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 = 2; i <= N; i++) {
		int r = INF;
		for(int j = L[i+1]; --j;) {
			int t = D[j];
			for(int v = i; j < v; v--)
				if(j < A[v]) t++;
			upmin(r, t);
		}
		D[i] = r;
	}

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

	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Execution timed out 2093 ms 344 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Execution timed out 2093 ms 344 KB Time limit exceeded
24 Halted 0 ms 0 KB -