Repository navigation
Expand file tree
/
Copy pathA_Cinema_Line.cpp
More file actions
135 lines (110 loc) · 2.75 KB
/
Copy pathA_Cinema_Line.cpp
File metadata and controls
135 lines (110 loc) · 2.75 KB
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
//typedef
typedef long long int lli ;
//fore
#define fore(i, a, b) for(int i = (a); i <= (b); ++i)
//ESTRUCTURAS
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define mp make_pair
//ABREVIATURAS
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define CODED_BY_DEMMARL ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//FUNCIONES
lli gcd(lli a,lli b) { if (b==0) return a; return gcd(b, a%b); }
lli lcm(lli a,lli b) { return a/gcd(a,b)*b; }
string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; }
string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; }
bool prime(lli a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; }
void yes() { cout<<"YES\n"; }
void no() { cout<<"NO\n"; }
// g++ main.cpp -o a && ./a < in > out
void solve() {
int n;
cin>>n;
int a = 0 , b = 0 , c = 0 ;
bool res = true ;
for(int i=0; i<n; ++i)
{
int tmp;
cin>>tmp;
if(tmp != 25)
{
if(tmp == 50)
{
if(a)
{
a--;
b++;
}
else
{
res = false;
break;
}
}
else
{
if(b)
{
tmp-=50;
b--;
}
if( tmp == 50 )
{
if(a)
{
a--;
}
else
{
res = false ;
break;
}
}
else
{
if(a >= 3 )
{
a-=3;
}
else
{
res = false;
break;
}
}
}
}
else
{
a++;
}
}
if(res)
yes();
else
no();
}
int main()
{
CODED_BY_DEMMARL;
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int tc = 1;
//cin >> tc;
for (int t = 1; t <= tc; t++) {
// cout << "Case #" << t << ": ";
solve();
}
}