# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628646 | 2022-08-13T14:48:02 Z | Iwanttobreakfree | Fancy Fence (CEOI20_fancyfence) | C++17 | 2 ms | 340 KB |
#include <iostream> #include <vector> #include <map> using namespace std; const int mod=1e9+7; int main(){ int n; cin>>n; vector<int> v(n),h(n); map<int,int> mp; for(int& i:v)cin>>i; for(int& i:h)cin>>i; for(int i=0;i<n;i++){ mp[h[i]]=(mp[h[i]]+v[i])%mod; } vector<pair<int,int>> comp; for(auto x:mp)comp.push_back(x); for(int i=comp.size()-1;i>0;i--)comp[i-1].second=(comp[i-1].second+comp[i].second)%mod; long long ans=0; for(int i=0;i<comp.size();i++){ pair<int,int> x=comp[i]; //cout<<(1ll*x.first*(x.first+1)/2)<<' '<<(1ll*x.second*(x.second+1)/2)<<'\n'; ans+=(((1ll*x.first*(x.first+1)/2)%mod)*((1ll*x.second*(x.second+1)/2)%mod))%mod; ans%=mod; if(i){ pair<int,int> y=comp[i-1]; ans-=(((1ll*y.first*(y.first+1)/2)%mod)*((1ll*x.second*(x.second+1)/2)%mod))%mod; if(ans<0)ans=((ans%mod)+mod)%mod; } } cout<<ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 2 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 2 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |