제출 #1277650

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

fancyfence

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
using namespace std;
 
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int MOD = 1000000007;

int inv(int num){
	int p=MOD, res=1, y=0;
	while (num>1){
		int q=num/p, t=p;
		p=num%p, num=t, t=y, y=res-q*y, res=t;
	}
	if (res<0)res+=MOD;
	return res;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, ans=0;
	cin>>n;
	vector<pii> vect(n);
	for (int i=0; i<n; ++i)cin>>vect[i].fi;
	for (int i=0; i<n; ++i)cin>>vect[i].se;
	deque<pii> deq;
	for (int i=0; i<n; ++i){
		ans=(ans+((((((vect[i].fi*(vect[i].fi+1))%MOD)*vect[i].se)%MOD)*(vect[i].se+1))%MOD)*inv(4))%MOD;
		for (auto c:deq)ans=(ans+((((((vect[i].se*c.se)%MOD)*c.fi)%MOD)*(c.fi+1))%MOD)*inv(2))%MOD;
		int w=vect[i].se;
		while (deq.size()&&deq.back().fi>=vect[i].fi)w+=deq.back().se, deq.pop_back();
		deq.pb(mp(vect[i].fi, w));
	}
	cout<<ans;
}

• 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