제출 #68532

#제출 시각아이디문제언어결과실행 시간메모리
68532KLPPBoat (APIO16_boat)C++14
9 / 100
5 ms1016 KiB
#include<iostream>
#include<stdio.h>

using namespace std;
typedef long long int lld;
#define MOD 1000000007

int main(){
	int n;
	cin>>n;
	pair<lld,lld> arr[n];
	for(int i=0;i<n;i++)cin>>arr[i].first>>arr[i].second;
	lld DP[n];
	lld ans=0;
	for(int i=0;i<n;i++){
		DP[i]=1;
		for(int j=0;j<i;j++){
			if(arr[j].first<arr[i].first){
				DP[i]+=DP[j];
				DP[i]%=MOD;
			}
		}
		ans+=DP[i];
		ans%=MOD;
	}
	cout<<ans<<endl;
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...