| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 775110 |
2023-07-06T07:41:21 Z |
binminh01 |
Addk (eJOI21_addk) |
C++17 |
|
264 ms |
17316 KB |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);
const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1);
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;
ll power(ll a, ll b, int m){ll x = 1;a%=m;while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b){ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b){return (a + b - 1)/b;}
ll to_int(const string &s){ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)a % 10 + '0'; a/=10;} Reverse(s); out << s; return out;}
#define int ll
template<class T>
struct segtree {
int n;
vector<T> t;
T neutral = 0;
T merge(T a, T b) {return a + b;}
void init(int N) {n = N; t.resize(4*n);}
void build(const vector<T> &a, int x, int lx, int rx) {
if (lx == rx) {
t[x] = a[lx];
return;
}
int m = (lx + rx)/2;
build(a, 2*x, lx, m);
build(a, 2*x + 1, m + 1, rx);
t[x] = merge(t[2*x], t[2*x + 1]);
}
void set(int i, T v, int x, int lx, int rx) {
if (lx == rx) {
t[x] = v;
return;
}
int m = (lx + rx)/2;
if (i <= m) set(i, v, 2*x, lx, m);
else set(i, v, 2*x + 1, m + 1, rx);
t[x] = merge(t[2*x], t[2*x + 1]);
}
T get(int l, int r, int x, int lx, int rx) {
if (lx > r || rx < l) return neutral;
if (lx >= l && rx <= r) return t[x];
int m = (lx + rx)/2;
return merge(get(l, r, 2*x, lx, m), get(l, r, 2*x + 1, m + 1, rx));
}
void build(const vector<T> &a) {build(a, 1, 1, n);}
void set(int i, int v) {set(i, v, 1, 1, n);}
T get(int l, int r) {return get(l, r, 1, 1, n);}
};
segtree<ll> f, g, p;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
cout << fixed << setprecision(10);
//open("1.inp"); write("1.out");
int n, k; cin >> n >> k;
vll a(n + 1), b(n + 1), c(n + 1);
FOR(i,1,n) cin >> a[i], b[i] = a[i]*i, c[i] = a[i]*(n - i + 1);
f.init(n); g.init(n); p.init(n);
f.build(b); g.build(c); p.build(a);
int q; cin >> q;
auto pre = [&](int i, int j) {
if (i > j) return 0ll;
return f.get(i, j) - (i - 1)*p.get(i, j);
};
auto suf = [&](int i, int j) {
if (i > j) return 0ll;
return g.get(i, j) - (n - j)*p.get(i, j);
};
while (q--) {
int o; cin >> o;
if (o == 2) {
int l, r, m; cin >> l >> r >> m;
if (r - l + 1 < m) cout << "0\n";
else if (l + m - 1 <= r - m + 1) {
ll x = pre(l, l + m - 2) + suf(r - m + 2, r);
x+=m*p.get(l + m - 1, r - m + 1);
cout << x << '\n';
} else cout << pre(l, r - m) + suf(l + m, r) + p.get(r - m + 1, l + m - 1)*(r - m - l + 2) << '\n';
} else {
vll t(k); cin >> t;
if (k == 1) continue;
For(i,1,k) swap(a[t[i]], a[t[i - 1]]);
For(i,0,k){
f.set(t[i], a[t[i]]*t[i]);
g.set(t[i], a[t[i]]*(n - t[i] + 1));
p.set(t[i], a[t[i]]);
}
}
}
cerr << "\nProcess returned 0 (0x0) execution time : " << 0.001*clock() << " s";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
468 KB |
Output is correct |
| 4 |
Correct |
4 ms |
596 KB |
Output is correct |
| 5 |
Correct |
5 ms |
828 KB |
Output is correct |
| 6 |
Correct |
9 ms |
960 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
9 ms |
1236 KB |
Output is correct |
| 9 |
Correct |
13 ms |
1552 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
2900 KB |
Output is correct |
| 2 |
Correct |
50 ms |
4180 KB |
Output is correct |
| 3 |
Correct |
67 ms |
5560 KB |
Output is correct |
| 4 |
Correct |
107 ms |
9612 KB |
Output is correct |
| 5 |
Correct |
171 ms |
13584 KB |
Output is correct |
| 6 |
Correct |
144 ms |
13424 KB |
Output is correct |
| 7 |
Correct |
142 ms |
13388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
109 ms |
6636 KB |
Output is correct |
| 2 |
Correct |
165 ms |
13256 KB |
Output is correct |
| 3 |
Correct |
264 ms |
17316 KB |
Output is correct |
| 4 |
Correct |
182 ms |
16232 KB |
Output is correct |
