-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathzad3_ms.cpp
93 lines (81 loc) · 1.72 KB
/
zad3_ms.cpp
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
#include <iostream>
#include <stack>
using namespace std;
bool is_ice(int layer)
{
return layer < 0;
}
void stack_layer(stack<int> *layers, int layer, bool isIce)
{
if (isIce)
{
layers->push(-abs(layer));
}
else
{
if (!layers->empty())
layers->push(abs(layer));
}
}
void put_on_stack(stack<int> *layers, int layer)
{
if (layers->empty())
{
stack_layer(layers, layer, is_ice(layer));
return;
}
int sameType = 0, otherType = 0;
while (otherType < abs(layer) && !layers->empty())
{
int topLayer = layers->top();
if (is_ice(layer) != is_ice(topLayer))
{
otherType += abs(topLayer);
}
else
{
sameType += topLayer;
}
layers->pop();
}
if (otherType < abs(layer))
{
put_on_stack(layers, layer);
return;
}
int remainingLayerOfOtherType = otherType - abs(layer);
stack_layer(layers, remainingLayerOfOtherType, !is_ice(layer));
stack_layer(layers, sameType+layer, is_ice(layer));
}
int sadzawka(int size, int arr[])
{
stack<int> layers;
for (int i = 0; i < size; i++)
{
put_on_stack(&layers, arr[i]);
}
// copy results
int resultsCount = (int)layers.size();
for (int i = 0; i < resultsCount; i++)
{
arr[i] = layers.top();
layers.pop();
}
return resultsCount;
}
int main()
{
int size;
cin >> size;
int *arr = (int *)malloc((size_t)size * sizeof(int));
for (int i = 0; i < size; i++)
{
cin >> arr[i];
}
int results = sadzawka(size, arr);
for (int i = 0; i < results; i++)
{
cout << arr[i] << endl;
}
free(arr);
}