Submission #487470

#TimeUsernameProblemLanguageResultExecution timeMemory
487470cfalasBoat (APIO16_boat)C++14
0 / 100
1 ms204 KiB
#include<bits/stdc++.h> using namespace std; #define mp make_pair #define INF 10000000 #define MOD 1000000007 #define MID ((l+r)/2) #define HASHMOD 2305843009213693951 #define ll long long #define ull unsigned long long #define F first #define S second typedef pair<ll, ll> ii; typedef pair<ii, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef map<int, int> mii; #define EPS 1e-6 #define FOR(i,n) for(int i=0;i<((int)(n));i++) #define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++) #define FOA(v, a) for(auto v : a) int t, n; vi a, b; int main(){ cin>>n; int dp[n+1]; a.resize(n); FOR(i,n){ cin>>a[i]>>a[i]; dp[i] = 0; } dp[0] = 1; ll ans=0; FORi(i,1,n){ FOR(j,i) if(a[j]<a[i]) dp[i] = max(dp[i], 2*dp[j]); ans += dp[i]; ans %= MOD; } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...