Submission #151744

#TimeUsernameProblemLanguageResultExecution timeMemory
151744SorahISABoat (APIO16_boat)C++14
9 / 100
3 ms400 KiB
#include <bits/stdc++.h> using namespace std; const long long mod = 1E9 + 7; int main() { int n; cin >> n; long long boat[n][2]; for (int i = 0; i < n; ++i) { cin >> boat[i][0] >> boat[i][1]; } long long dp[n], answer = 0; for (int i = 0; i < n; ++i) { dp[i] = 1; for (int j = 0; j < i; ++j) { if (boat[j][0] < boat[i][0]) { dp[i] += dp[j]; } } dp[i] %= mod; answer += dp[i]; } answer %= mod; cout << answer << '\n'; 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...