oj.uz

답안 #900668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900668 2024-01-08T20:20:08 Z 3laa Fancy Fence (CEOI20_fancyfence) C++14
15 / 100
 57 ms 3924 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
#include <unordered_map>
#define endl '\n'
#define mid ((l+r)/2)
#define  F first
#define  S second
#define pb push_back
#define yes void (cout<<"YES"<<endl)
#define no void (cout<<"NO"<<endl)
#define ump unordered_map <ll,ll>
#define sp " "
#define vll vector<ll>
#define vint vector<int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
const ll inf=1e18+9;
const ll M=1e9+7;
ll n;
ll h[100009];
ll w[100009];
int main(){
    cin>>n;
    ll H=0,W=0;
    for(ll i=0 ; i<n ; i++){
        cin>>h[i];
        H=h[i];
    }
    for(ll i=0 ; i<n ; i++){
        cin>>w[i];
        W+=w[i];
        W%=M;
    }
    H%=M;
    W=((W*(W+1))/2)%M;
    H=((H*(H+1))/2)%M;
    cout<<(W*H)%M<<endl;
}

Subtask #1
0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 748 KB Output is correct
3 Correct 30 ms 2200 KB Output is correct
4 Correct 57 ms 3924 KB Output is correct
5 Correct 57 ms 3920 KB Output is correct
6 Correct 0 ms 344 KB Output is correct

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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