제출 #868580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868580		mariaclara	Fancy Fence (CEOI20_fancyfence)	C++17	12 / 100	1 ms	436 KiB

fancyfence

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> trio;
const int MAXN = 5e4+10;
#define pb push_back
#define f first
#define s second

int n, h[55], w[55], resp;
int main() {

    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> h[i];

    for(int i = 1; i <= n; i++)
        cin >> w[i];

    for(int i = 1; i <= n; i++) {
        for(int j = i, l = 100; j <= n; j++) {
            l = min(h[j], l);
            resp += l*(l+1)/2;
            resp %= (int)(1e9+7);
        }
        cout << "\n";
    }

    cout << resp << "\n";
}

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