Submission #1109958

#TimeUsernameProblemLanguageResultExecution timeMemory
1109958dsyzBoat (APIO16_boat)C++17
9 / 100
2 ms648 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define MAXN (1000005) ll mod = 1e9 + 7; int main(){ ios_base::sync_with_stdio(false);cin.tie(0); ll N; cin>>N; ll A[N], B[N]; for(ll i = 0;i < N;i++){ cin>>A[i]>>B[i]; } ll dp[N]; memset(dp,0,sizeof(dp)); dp[0] = 1; for(ll i = 1;i < N;i++){ dp[i] = 1; for(ll j = 0;j < i;j++){ if(A[j] < A[i]){ dp[i] += dp[j]; dp[i] %= mod; } } } ll sum = 0; for(ll i = 0;i < N;i++){ sum += dp[i]; sum %= mod; } cout<<sum<<'\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...