제출 #1238975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238975		chikien2009	Fancy Fence (CEOI20_fancyfence)	C++20	0 / 100	0 ms	328 KiB

fancyfence

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n;
long long res, mod = 1e9 + 7, last, a, b, c;
pair<int, int> p[100000];
map<int, long long> val;

int main()
{
    setup();
    
    cin >> n;
    for (int i = 0; i < n; ++i)
    {
        cin >> p[i].first;
    }
    for (int i = 0; i < n; ++i)
    {
        cin >> p[i].second;
        c += p[i].second;
        (val[p[i].first] += p[i].second) %= mod;
    }
    for (auto & i : val)
    {
        a = (c * (c + 1) / 2) % mod;
        b = (i.first * (i.first + 1) / 2 - last * (last + 1) / 2) % mod;
        (res += a * b) %= mod;
        c -= i.second;
        last = i.first;
    }
    cout << res;
    return 0;
}

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