oj.uz

답안 #362525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362525 2021-02-03T14:31:12 Z flappybird Boat (APIO16_boat) C++14
9 / 100
 2000 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAX 510
#define all(v) v.begin(), v.end()
#define ln '\n'
#define MOD 1000000007
#define INF 210000000000
#define pb push_back
#define abs(x) (((x)>0)?(x):(-(x)))
#define len(x) ((x).second-(x).first)
typedef long long ll;
vector<ll> dp[MAX], sum[MAX];
ll A[MAX], B[MAX];
set<pair<ll, ll>> s;
int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll N;
	cin >> N;
	ll i, j, k;
	for (i = 1; i <= N; i++) cin >> A[i] >> B[i], dp[i].pb(0), sum[i].pb(0);
	for (i = A[1]; i <= B[1]; i++) {
		dp[1].pb(1);
		sum[1].pb(0);
		sum[1][i - A[1] + 1] = (sum[1][i - A[1]] + dp[1][i - A[1] + 1]) % MOD;
	}
	s.insert({ A[1], 1 });
	set<pair<ll, ll>>::iterator it;
	for (i = 2; i <= N; i++) {
		for (j = A[i]; j <= B[i]; j++) {
			dp[i].pb(1), sum[i].pb(0);
			for (it = s.begin(); it != s.end(); it++) {
				k = it->second;
				if (j - A[k] <= 0) break;
				dp[i][j - A[i] + 1] += sum[k][min(j - A[k], (ll)(sum[k].size() - 1))];
				dp[i][j - A[i] + 1] %= MOD;
			}
			sum[i][j - A[i] + 1] = (sum[i][j - A[i]] + dp[i][j - A[i] + 1]) % MOD;
			s.insert({ A[i], i });
		}
	}
	ll ans = 0;
	for (i = 1; i <= N; i++) ans += sum[i][sum[i].size() - 1];
	ans %= MOD;
	while (ans < 0) ans += MOD;
	cout << ans << ln;
	return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 492 KB Output is correct

Subtask #2
0 / 22.0

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

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 957 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

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