oj.uz

Submission #772401

# Submission time Handle Problem Language Result Execution time Memory
772401 2023-07-04T05:25:03 Z horiiseun Fancy Fence (CEOI20_fancyfence) C++17
43 / 100
 18 ms 3528 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

const int MOD = 1e9 + 7;

int n;
vector<pair<ll, ll>> v;
stack<pair<ll, ll>> s;
ll ans;

ll calc(ll x, ll y) {
	x %= MOD;
	y %= MOD;
	return (ll) (((x * (x + 1) / 2) % MOD) * ((y * (y + 1) / 2) % MOD)) % MOD;
}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	v.resize(n, {0, 0});
	for (int i = 0; i < n; i++) {
		cin >> v[i].f;
	}
	for (int i = 0; i < n; i++) {
		cin >> v[i].s;
	}
	v.push_back({0, 0});
	D(v);

	s.push(v[0]);
	for (int i = 1; i <= n; i++) {
		D(s);
		ll cnt = 0;
		while (!s.empty() && v[i].f < s.top().f) {
			pair<ll, ll> t = s.top();
			s.pop();
			t.s += cnt;
			t.s %= MOD;
			ans += calc(t.f, t.s);
			D(ans);
			ans %= MOD;
			if (!s.empty()) {
				ans -= calc(s.top().f, t.s);
				if (ans < 0) ans += MOD;
				ans %= MOD;
			}
			cnt = t.s;
			cnt %= MOD;
		}
		if (s.empty()) {
			ans -= calc(v[i].f, cnt);
			if (ans < 0) ans += MOD;
			ans %= MOD;
			s.push(v[i]);
			s.top().s += cnt;
			s.top().s %= MOD;
		} else {
			if (v[i].f > s.top().f) {
				s.push(v[i]);
				s.top().s += cnt;
				s.top().s %= MOD;
			} else {
				s.top().s += cnt;
				s.top().s %= MOD;
				s.top().s += v[i].s;
				s.top().s %= MOD;
			} 
		}
	}

	cout << ans << "\n";

}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 10 ms 1876 KB Output is correct
4 Correct 14 ms 3424 KB Output is correct
5 Correct 14 ms 3436 KB Output is correct
6 Correct 14 ms 3440 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 8 ms 1872 KB Output is correct
4 Correct 16 ms 3440 KB Output is correct
5 Correct 17 ms 3436 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 17 ms 3412 KB Output is correct
6 Correct 17 ms 3432 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 9 ms 1876 KB Output is correct
10 Correct 17 ms 3528 KB Output is correct
11 Correct 18 ms 3484 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -