Submission #61790926

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 5e5 + 5;
int q, tag, tot, pos, lis[N], len[N];
void Solve(){
  cin >> q; pos = 1;
  while(q--){
    int op, x; cin >> op;
    if(op == 1){
      cin >> x; tot++;
      len[tot] = x; lis[tot] = lis[tot - 1] + len[tot - 1];
    }
    else if(op == 2){
      tag += len[pos];
      pos++;
    }
    else{
      cin >> x;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 5e5 + 5;
int q, tag, tot, pos, lis[N], len[N];
void Solve(){
	cin >> q; pos = 1;
	while(q--){
		int op, x; cin >> op;
		if(op == 1){
			cin >> x; tot++;
			len[tot] = x; lis[tot] = lis[tot - 1] + len[tot - 1];
		}
		else if(op == 2){
			tag += len[pos];
			pos++;
		}
		else{
			cin >> x;
			cout << lis[pos + x - 1] - tag << '\n';
		}
	}
}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T = 1; //cin >> T;
	while(T--) Solve();
	return 0;
}

Submission Info

Judge Result