Submission #415841

# Submission time Handle Problem Language Result Execution time Memory
415841 2021-06-01T15:34:01 Z grt Boat (APIO16_boat) C++17
9 / 100
4 ms 332 KB
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

const int nax = 500 + 10, mod = 1e9 + 7;
int n, mx;
int dp[nax];
int a[nax], b[nax];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i] >> b[i];
	}
	dp[0] = 1;
	for(int i = 1; i <= n; ++i) {
		for(int j = i - 1; j >= 0; --j) {
			if(a[j] < a[i]) {
				dp[i] = (dp[i] + dp[j]) % mod;
			}
		}
	}
	int sum = 0;
	for(int i = 1; i <= n; ++i) {
		sum = (sum + dp[i]) % mod;
	}
	cout << sum;
		
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 328 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 324 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 328 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 324 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Incorrect 2 ms 332 KB Output isn't correct
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 328 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 324 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Incorrect 2 ms 332 KB Output isn't correct
22 Halted 0 ms 0 KB -