oj.uz

답안 #756832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756832 2023-06-12T09:09:00 Z Tsovak Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 37 ms 7316 KB 
// -------------------- Includes -------------------- //
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <array>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <cassert>
#include <assert.h>
#include <climits>
#include <limits.h>
#include <ctime>
#include <time.h>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

// -------------------- Typedefs -------------------- //

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;

// -------------------- Defines -------------------- //

#define pr pair
#define mpr make_pair
#define ff first
#define ss second

#define mset multiset
#define mmap multimap
#define uset unordered_set
#define umap unordered_map
#define umset unordered_multiset
#define ummap unordered_multimap
#define pqueue priority_queue

#define sz(x) (int((x).size()))
#define len(x) (int((x).length()))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()

#define pf push_front
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ft front
#define bk back

#define lb lower_bound
#define ub upper_bound
#define bs binary_search

// -------------------- Constants -------------------- //

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

// -------------------- Functions -------------------- //

void fastio()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	return;
}

void precision(int x)
{
	cout.setf(ios::fixed | ios::showpoint);
	cout.precision(x);
	return;
}

ll gcd(ll a, ll b)
{
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}

ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}

bool is_prime(ll a)
{
	if (a == 1) {
		return false;
	}
	for (ll i = 2; i * i <= a; i++) {
		if (a % i == 0) {
			return false;
		}
	}
	return true;
}

bool is_square(ll a)
{
	ll b = ll(sqrt(a));
	return (b * b == a);
}

bool is_cube(ll a)
{
	ll b = ll(cbrt(a));
	return (b * b * b == a);
}

int digit_sum(ll a)
{
	int sum = 0;
	while (a) {
		sum += int(a % 10);
		a /= 10;
	}
	return sum;
}

ll binpow(ll a, int b)
{
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
		}
		b >>= 1;
		a *= a;
	}
	return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
			ans %= mod;
		}
		b >>= 1;
		a *= a;
		a %= mod;
	}
	return ans;
}

ll factorial(int a)
{
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
	}
	return ans;
}

ll factorial_by_mod(int a, ll mod)
{
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
		ans %= mod;
	}
	return ans;
}

// -------------------- Solution -------------------- //

const int N = 100005;
ll h[N], w[N], p[N];
int n;

int e[N];

ll dp[N];

void solve()
{
	int i, j;

	cin >> n;
	for (i = 1; i <= n; i++) cin >> h[i];
	for (i = 1; i <= n; i++) {
		cin >> w[i];
		p[i] = p[i - 1] + w[i];
	}

	stack<pr<ll, int>> s;

	for (i = 1; i <= n; i++) {
		while (!s.empty() && s.top().ff >= h[i]) s.pop();

		if (s.empty()) e[i] = 0;
		else e[i] = s.top().ss;

		s.push(mpr(h[i], i));
	}

	ll ans = 0, c;

	for (i = 1; i <= n; i++) {
		c = (h[i] * (h[i] + 1) / 2) % MOD;
		dp[i] = (c * ((p[i - 1] - p[e[i]]) % MOD)) % MOD;
		dp[i] = (dp[i] + dp[e[i]]) % MOD;

		ans += (dp[i] * w[i]) % MOD;
		ans %= MOD;

		dp[i] += (c * w[i]) % MOD;
		dp[i] %= MOD;

		ans += (c * ((w[i] * (w[i] + 1) / 2) % MOD)) % MOD;
		ans %= MOD;
	}

	cout << ans << "\n";

	return;
}

void precalc()
{
	return;
}

int main()
{
	fastio();

	precalc();

	int tests = 1, tc;
	//cin >> tests;
	for (tc = 1; tc <= tests; tc++) {
		solve();
	}

	//cout << db(clock()) / CLOCKS_PER_SEC << endl;

	return 0;
}

/*
	# # # #   # # # #   # # # #   #       #    #       #     #
	   #      #         #     #    #     #    # #      #   #
	   #      # # # #   #     #     #   #    #   #     # #
	   #            #   #     #      # #    # # # #    #   #
	   #      # # # #   # # # #       #    #       #   #     #
*/

Compilation message

fancyfence.cpp: In function 'void solve()':
fancyfence.cpp:213:9: warning: unused variable 'j' [-Wunused-variable]
  213 |  int i, j;
      |         ^

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 11 ms 2576 KB Output is correct
4 Correct 21 ms 4940 KB Output is correct
5 Correct 29 ms 4936 KB Output is correct
6 Correct 18 ms 4944 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 14 ms 3008 KB Output is correct
4 Correct 25 ms 5684 KB Output is correct
5 Correct 37 ms 5836 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 16 ms 3012 KB Output is correct
5 Correct 29 ms 5676 KB Output is correct
6 Correct 34 ms 5864 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 13 ms 3324 KB Output is correct
10 Correct 25 ms 7272 KB Output is correct
11 Correct 27 ms 7316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 14 ms 2600 KB Output is correct
12 Correct 20 ms 4980 KB Output is correct
13 Correct 26 ms 4944 KB Output is correct
14 Correct 23 ms 4952 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 12 ms 3028 KB Output is correct
18 Correct 24 ms 5848 KB Output is correct
19 Correct 26 ms 5796 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 1016 KB Output is correct
22 Correct 13 ms 3412 KB Output is correct
23 Correct 27 ms 7272 KB Output is correct
24 Correct 28 ms 7308 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 3 ms 856 KB Output is correct
31 Correct 3 ms 888 KB Output is correct
32 Correct 11 ms 2904 KB Output is correct
33 Correct 14 ms 3044 KB Output is correct
34 Correct 27 ms 5540 KB Output is correct
35 Correct 24 ms 5576 KB Output is correct
36 Correct 26 ms 5868 KB Output is correct
37 Correct 24 ms 5752 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 23 ms 5708 KB Output is correct
40 Correct 25 ms 5768 KB Output is correct
41 Correct 24 ms 5816 KB Output is correct
42 Correct 24 ms 6496 KB Output is correct