oj.uz

답안 #1104134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104134 2024-10-23T02:09:44 Z ezzzay Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 2 ms 4432 KB 
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=3e5+5;
int h[N];
int w[N];
int ps[N];
int mod=1e9+7;
int modd(int n){
    return (n%mod+mod)%mod;
}
int calc(int a, int b){
    int f=modd(modd(a*(a+1))*500000004);
    int s=modd(modd(b*(b+1))*500000004);
    return (f*s)%mod;
}
signed main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>h[i];
    }
    for(int i=1;i<=n;i++){
        cin>>w[i];
    }
    int ans=0;
    ps[n+1]=0;
    for(int i=n;i>=1;i--){
        ps[i]=ps[i+1]+w[i];
       // cout<<ps[i]<<" "<<h[i]<<" ";
      //  cout<<calc(h[i],ps[i])<<" "<<calc(h[i-1],ps[i])<<endl;
        ans+=calc(h[i],ps[i])-calc(h[i-1],ps[i]);
        //cout<<ans<<endl;
        ans=modd(ans);
    }
    cout<<ans;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 1 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 2 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 2 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 2 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 1 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -