Submission #47633

# Submission time Handle Problem Language Result Execution time Memory
47633 2018-05-06T06:31:09 Z square1001 Boat (APIO16_boat) C++14
9 / 100
3 ms 900 KB
#include <cassert>
#include <iostream>
using namespace std;
const int mod = 1000000007;
int n, a[509], b[509], dp[509];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
		assert(a[i] == b[i]);
	}
	int sum = 0;
	for (int i = 0; i < n; i++) {
		dp[i] = 1;
		for (int j = 0; j < i; j++) {
			if (a[j] < a[i]) {
				dp[i] += dp[j];
				if (dp[i] >= mod) dp[i] -= mod;
			}
		}
		sum += dp[i];
		if (sum >= mod) sum -= mod;
	}
	cout << sum << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 448 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 524 KB Output is correct
6 Correct 3 ms 536 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 616 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 768 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 448 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 524 KB Output is correct
6 Correct 3 ms 536 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 616 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 768 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Runtime error 2 ms 876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 448 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 524 KB Output is correct
6 Correct 3 ms 536 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 616 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 768 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Runtime error 2 ms 876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -