1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
# include <stdio.h>
# include <stdlib.h>
typedef struct node{
int data;
struct node* next;
}node;
typedef struct stack{
node* top;
}stack;
void initstack(stack* s, int n){
for(int i = 0; i < n; i++){
s[i].top = NULL;
}
}
int isempty(stack* s,int x){
return s[x-1].top == NULL;
}
void push(stack* s,int x,int data){
node* newnode = (node*)malloc(sizeof(node));
newnode->data = data;
newnode->next = s[x-1].top;
s[x-1].top = newnode;
}
int pop(stack* s,int x){
if(isempty(s,x)){
return 0;
}
node* temp = s[x-1].top;
int tempvalue = temp->data;
s[x-1].top = s[x-1].top->next;
free(temp);
return tempvalue;
}
int show(stack* s,int x){
node* temp = s[x-1].top;
int output = 0;
while(temp != NULL){
output += temp->data;
temp = temp->next;
}
return output;
}
int main(){
int n;
scanf("%d",&n);
stack s[n];
initstack(s, n);
int m;
int cnt = 0;
scanf("%d",&m);
int store[m];
while(m > 0){
int symbol;
scanf("%d",&symbol);
if (symbol == 1){
int x,w,c;
scanf("%d %d %d",&x,&w,&c);
while(c > 0){
push(s,x,w);
c--;
}
store[cnt] = show(s,x);
cnt++;
}
else if(symbol == 2){
int x,c;
int temp = 0;
scanf("%d %d",&x,&c);
while(c > 0){
temp += pop(s,x);
c--;
}
store[cnt] = temp;
cnt++;
}
else if(symbol == 3){
int x,y;
scanf("%d %d",&x,&y);
while(!(isempty(s,x))){
int temp = pop(s,x);
push(s,y,temp);
}
store[cnt] = show(s,y);
cnt++;
}
m--;
}
for(int i = 0;i < cnt - 1;i++){
printf("%d\n",store[i]);
}
printf("%d",store[cnt-1]);
return 0;
}
|