제출 #447080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447080		Yahli	Fancy Fence (CEOI20_fancyfence)	C++14	58 / 100	265 ms	262148 KiB

fancyfence

#include <bits/stdc++.h>
#define int long long

using namespace std; 
using pi = pair<int, int>; 

const int mod = 1e9+7; 
const int inv4 = 25e7+2; 

int calc(int a, int b){
    return ((a*(a+1)%mod)*(b*(b+1)%mod)%mod)*inv4%mod;
}

int req_solve(const vector<pi> & data, int n, int floor){
    if (n == 0) return 0; 

    //find the minimum: 
    int ind = 0, w = 0; 
    for (int i = 0; i < n; ++i){
        if (data[i].first < data[ind].first) ind = i; 
        w += data[i].second; 
    } 
    w %= mod; 

    int res = (calc(data[ind].first, w) - calc(floor, w) + mod) % mod;
    
    vector<pi> next; 
    for (int i = 0; i < n; ++i){
        if (data[i].first == data[ind].first){
            res = (req_solve(next, next.size(), data[ind].first) + res) % mod; 
            next.resize(0); 
        }
        else next.push_back(data[i]);
    }
    return (req_solve(next, next.size(), data[ind].first) + res) % mod; 
}

int32_t main(){
    int n; cin >> n;
    vector<pi> data(n); 
    for (int i = 0; i < n; ++i) cin >> data[i].first; 
    for (int i = 0; i < n; ++i) cin >> data[i].second; 
    cout << req_solve(data, n, 0); 
}

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