Submission #628817

#TimeUsernameProblemLanguageResultExecution timeMemory
628817IwanttobreakfreeFancy Fence (CEOI20_fancyfence)C++17
12 / 100
1075 ms1208 KiB
#include <iostream> #include <vector> #include <map> #include <stack> using namespace std; #define int long long const int mod=1e9+7; signed main(){ int n; cin>>n; vector<int> v(n),h(n); map<int,int> mp; for(int& i:h)cin>>i; for(int& i:v)cin>>i; long long ans=0; for(int i=0;i<n;i++){ ans+=(((v[i]*(v[i]+1)/2)%mod)*(h[i]*(h[i]+1)/2)%mod)%mod; ans%=mod; int he=h[i]; for(int j=i+1;j<n;j++){ he=min(he,h[j]); ans+=(((v[j]*(v[i]))%mod)*(he*(he+1)/2)%mod)%mod; ans%=mod; } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...