Submission #930035

#TimeUsernameProblemLanguageResultExecution timeMemory
930035IUA_HasinBoat (APIO16_boat)C++17
0 / 100
2 ms348 KiB
#include <bits/stdc++.h> #define endl "\n" #define finp for(int i=0; i<n; i++) #define fknp for(int k=0; k<n; k++) #define yeap cout<<"YES"<<endl #define nope cout<<"NO"<<endl #define inpintn int n; cin>>n #define inpintarrn int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];} #define inpllarrn long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];} #define ll long long using namespace std; int main () { ll M = 1000000007; ll n; cin>>n; ll arr[n]; ll brr[n]; ll ans[n]; for(int i=0; i<n; i++){ cin>>arr[i]; cin>>brr[i]; } for(int i=0; i<n; i++){ ans[i] = 1; } for(int i=n-2; i>=0; i--){ for(int j=i+1; j<n; j++){ if(arr[j]>arr[i]){ ans[i]+=ans[j]; } } } ll sum = 0; for(int i=0; i<n; i++){ sum+=(ans[i])%M; } cout<<sum<<endl; // for(int i=0; i<n; i++){ // cout << ans[i] << " "; // } // cout<<endl; 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...