제출 #1334552

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1334552		tomvip0919	Fancy Fence (CEOI20_fancyfence)	C++20	15 / 100	60 ms	1052 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(0); cin.tie(0);

const ll MOD = 1e9 + 7;
const ll MAXN = 500000004;
const ll N = 100005;
int h[N], w[N];
int n;

ll tri(ll n) {
    n %= MOD;
    return (n * (n + 1) % MOD) * MAXN % MOD;
}

ll sub2() {
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        int minn = h[i];
        for (int j = i; j <= n; j++) {
            minn = min(minn, h[j]);
            ans = (ans + tri(minn)) % MOD;
        }
    }
    return ans;
}

ll sub3() {

}

int main() {
    cin >> n;
    bool sub2, sub3, sub4, sub5;
    for(int i = 1; i <= n; i++){
        cin >> h[i];
    }
    ll sum = 0;
    for(int i = 1; i <= n; i++){
        cin >> w[i];
        sum += w[i];
    }
    cout << tri(h[1]) * tri(sum) % MOD;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

fancyfence.cpp: In function 'long long int sub3()':
fancyfence.cpp:31:1: warning: no return statement in function returning non-void [-Wreturn-type]
   31 | }
      | ^

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27