Submission #672244

#TimeUsernameProblemLanguageResultExecution timeMemory
672244Dan4LifeBoat (APIO16_boat)C++17
9 / 100
1 ms316 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
const int maxn = 5e2+10;
const int MOD = (int)1e9+7;
pair<int,int> a[maxn];
int dp[maxn];
int n;

int32_t main() {
	cin >> n; int ans = 0;
	for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
	for(int i = 0; i < n; i++){
		dp[i] = 1;
		for(int j = 0; j < i; j++) if(a[i].fi > a[j].fi) dp[i]+=dp[j], dp[i]%=MOD;
		ans+=dp[i]; ans%=MOD;
	}
	cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...