제출 #340147

#제출 시각아이디문제언어결과실행 시간메모리
340147blueBoat (APIO16_boat)C++11
9 / 100
2 ms364 KiB
#include <iostream> using namespace std; int mod = 1e9 + 7; int main() { int N; cin >> N; int a[N+1], b[N+1]; for(int i = 1; i <= N; i++) cin >> a[i] >> b[i]; a[0] = b[0] = 0; int dp[N+1]; dp[0] = 1; int res = 0; for(int i = 1; i <= N; i++) { dp[i] = 0; for(int j = 0; j < i; j++) if(a[j] < a[i]) dp[i] = (dp[i] + dp[j]) % mod; res = (res + dp[i]) % mod; } cout << res << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...