132 lines
2.9 KiB
C++
132 lines
2.9 KiB
C++
/* Problem URL: https://codeforces.com/contest/2094/problem/G */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int t;
|
|
cin >> t;
|
|
while (t--) {
|
|
int q;
|
|
cin >> q;
|
|
list<ll> fds;
|
|
ll n = 0;
|
|
ll nums = 0;
|
|
ll total = 0;
|
|
ll act = 0;
|
|
bool rev = false;
|
|
while (q--) {
|
|
int op;
|
|
cin >> op;
|
|
if (op == 1) {
|
|
ll num = fds.back();
|
|
if (rev) {
|
|
num = fds.front();
|
|
}
|
|
total -= num * n;
|
|
total += nums - num;
|
|
total += num;
|
|
if (rev) {
|
|
fds.push_back(num);
|
|
fds.pop_front();
|
|
} else {
|
|
fds.push_front(num);
|
|
fds.pop_back();
|
|
}
|
|
cout << total << '\n';
|
|
} else if (op == 2) {
|
|
ll tmp = total - nums;
|
|
total = act - tmp;
|
|
|
|
rev = !rev;
|
|
|
|
cout << total << '\n';
|
|
} else {
|
|
ll num;
|
|
cin >> num;
|
|
|
|
n++;
|
|
if (rev) {
|
|
fds.push_front(num);
|
|
} else {
|
|
fds.push_back(num);
|
|
}
|
|
act += num * n + nums;
|
|
nums += num;
|
|
total += num * n;
|
|
cout << total << '\n';
|
|
}
|
|
}
|
|
}
|
|
}
|