-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path466C.cpp
More file actions
78 lines (74 loc) · 1.73 KB
/
Copy path466C.cpp
File metadata and controls
78 lines (74 loc) · 1.73 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
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void _debug(const char* name, T&& value) {
cerr << name << " = " << value << endl;
}
template<typename T, typename... Args>
void _debug(const char* names, T&& value, Args&&... args) {
const char* comma = strchr(names, ',');
cerr.write(names, comma - names) << " = " << value << " | ";
_debug(comma + 1, args...);
}
#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
#define ll long long
#define REP(i,n) for(int i=0; i<n; i++)
#define RREP(i,n) for(int i=n-1; i>= 0; i--)
#define mod 1000000007
void solve()
{
int n; cin >> n;
ll sum = 0;
vector<int> a(n);
REP(i, n){
cin >> a[i];
sum += a[i];
}
if(sum%3 != 0) cout << 0;
else{
ll limit = sum/3;
int i = 0;
ll tempsum = 0;
while(tempsum!=limit && i < n){
tempsum += a[i];
i++;
}
if(tempsum != limit || i == n){
cout << 0; return;
}
if(i!=0)i--;
int z = n-1;
tempsum = 0;
while(tempsum < limit && z >= 0){
tempsum += a[z];
z--;
}
if(tempsum != limit || z == -1){
cout << 0; return;
}
if(z - i == 0){
cout << 0; return;
}
if(z!=n-1) z++;
int j = i+1;
int ans = 1;
int l = j;
ll tempsum = 0;
for(int r = j; r < z; r++){
tempsum += a[r];
if(tempsum == sum/3){
}
}
cout << ans;
}
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll test=1;
// cin>>test;
while(test--)
{
solve();
}
return 0;
}