| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 518627 |
2022-01-24T10:12:13 Z |
xynex |
Addk (eJOI21_addk) |
C++17 |
|
198 ms |
8800 KB |
/**
* Author: Tenjin
* Created: 24.01.2022 14:43
* Why am I so stupid? :c
* Slishkom slab
**/
#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
void precalc() {
}
int n, K;
ll a[N], sum[N], pref[N], rsum[N];
void upd(ll pos, ll ind, int tl = 1, int tr = n, int v = 1) {
if (tl == tr) sum[v] = pos * ind, pref[v] = ind, rsum[v] = (n - pos + 1) * ind;
else {
int mid = (tl + tr) >> 1;
if (mid >= pos) upd(pos, ind, tl, mid, v * 2);
else upd(pos, ind, mid + 1, tr, v * 2 + 1);
sum[v] = sum[v * 2] + sum[v * 2 + 1];
pref[v] = pref[v * 2] + pref[v * 2 + 1];
rsum[v] = rsum[v * 2] + rsum[v * 2 + 1];
}
}
ll prefix_sum(int l, int r, int tl = 1, int tr = n, int v = 1) {
if (tl > r || tr < l) return 0;
if (tl >= l && tr <= r) return pref[v];
int mid = (tl + tr) >> 1;
return prefix_sum(l, r, tl, mid, v * 2) + prefix_sum(l, r, mid + 1, tr, v * 2 + 1);
}
ll get(int l, int r, int tl = 1, int tr = n, int v = 1) {
if(tl > r || tr < l) return 0;
if(tl >= l && tr <= r) return sum[v];
int mid = (tl + tr) >> 1;
return get(l, r, tl, mid, v * 2) + get(l, r, mid + 1, tr, v * 2 + 1);
}
ll rget(int l, int r, int tl = 1, int tr = n, int v = 1) {
if(tl > r || tr < l) return 0;
if(tl >= l && tr <= r) return rsum[v];
int mid = (tl + tr) >> 1;
return rget(l, r, tl, mid, v * 2) + rget(l, r, mid + 1, tr, v * 2 + 1);
}
pr<ll, ll> c[N];
void solve() {
read(n, K);
for (int i = 1; i <= n; ++i) read(a[i]), upd(i, a[i]);
int q; read(q);
while(q--) {
int type; read(type);
if(type == 1) {
for(int i = 1; i <= K; ++i) {
read(c[i].ff);
}
c[K + 1].ff = c[1].ff ;
for(int i = 1; i <= K; ++i) c[i].ss = a[c[i + 1].ff];
for(int i = 1; i <= K; ++i) upd(c[i].ff, c[i].ss);
}
else {
int l, r, m; read(l, r, m);
m = min(m, (r - l + 1) - m + 1);
int L = l + m - 1, R = r - m + 1;
ll ans = prefix_sum(L, R) * m;
L--;
R++;
//print(l, L);
ll leftside = get(l, L) - prefix_sum(l, L) * (ll)(l - 1);
// print(leftside);
ans += leftside;
ll rightside = rget(R, r) - prefix_sum(R, r) * (ll)(n - r);
ans += rightside;
print(ans);
}
}
}
int main() {
//freop("");
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
//read(t);
precalc();
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
Compilation message
Main.cpp: In function 'void freop(std::string)':
Main.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
73 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
3 ms |
332 KB |
Output is correct |
| 3 |
Correct |
3 ms |
460 KB |
Output is correct |
| 4 |
Correct |
4 ms |
612 KB |
Output is correct |
| 5 |
Correct |
6 ms |
588 KB |
Output is correct |
| 6 |
Correct |
9 ms |
812 KB |
Output is correct |
| 7 |
Correct |
10 ms |
844 KB |
Output is correct |
| 8 |
Correct |
10 ms |
844 KB |
Output is correct |
| 9 |
Correct |
15 ms |
1280 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
38 ms |
2304 KB |
Output is correct |
| 2 |
Correct |
56 ms |
2520 KB |
Output is correct |
| 3 |
Correct |
69 ms |
4292 KB |
Output is correct |
| 4 |
Correct |
133 ms |
7980 KB |
Output is correct |
| 5 |
Correct |
198 ms |
8800 KB |
Output is correct |
| 6 |
Correct |
173 ms |
8644 KB |
Output is correct |
| 7 |
Correct |
188 ms |
8612 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
122 ms |
4228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
