답안 #628758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628758 2022-08-13T16:37:29 Z Iwanttobreakfree Fancy Fence (CEOI20_fancyfence) C++17
12 / 100
1000 ms 1984 KB
#include <iostream>
#include <vector>
#include <map>
#include <stack>
using namespace std;
const int mod=1e9+7;
#define int long long
signed main(){
    int n;
    cin>>n;
    vector<int> v(n),h(n),pre(n+1);
    map<int,int> mp;
    for(int& i:h)cin>>i;
    for(int& i:v)cin>>i;
    for(int i=0;i<n;i++)pre[i+1]=(pre[i]+v[i])%mod;
    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<<' ';
        }
        //cout<<ans<<'\n';
    }
    cout<<ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 3 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 212 KB Output is correct
3 Execution timed out 1092 ms 1984 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 260 KB Output is correct
2 Incorrect 4 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 5 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 3 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -