Submission #1027483

#TimeUsernameProblemLanguageResultExecution timeMemory
1027483MuhammetBoat (APIO16_boat)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int #define sz(x) (int)x.size() #define ff first #define ss second const ll N = 505; const ll M = 1e9 + 7; ll T, n, a[N], b[N], dp[N][5]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i] >> b[i]; } ll ans = 0; for(int i = 1; i <= n; i++){ ll mx = 0, mx1 = 0, mx2 = 0; for(int j = 1; j < i; j++){ mx = max(mx,dp[j][0]); mx1 = max(mx1,dp[j][1]); if(a[j] < a[i]) mx2 = max(mx2,dp[j][1]); } dp[i][0] = max(mx1,mx); dp[i][1] = mx2+1; ans += dp[i][1]; ans %= M; dp[i][0] %= M; dp[i][1] %= M; } cout << ans; 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...