-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
81 lines (80 loc) · 1.63 KB
/
B.cpp
File metadata and controls
81 lines (80 loc) · 1.63 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
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
using namespace std;
/*************************************************************************************************/
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,c=0;
mp m;
vi ans;
cin>>n;
int a[n];
loop(i,0,n)
cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]>0)
{
m[a[i]]=1;
}
else
{
if(m[abs(a[i])]!=1)
{
cout<<-1;
return 0;
}
else
{
m.erase(abs(a[i]));
}
}
c++;
if(m.size()==0)
ans.pb(c),c=0;
}
int i=0,j=0;
for(int i=0;i<ans.size();i++)
j+=ans[i];
if(j<n)
{
cout<<-1;
return 0;
}
j=0,i=0;
while (i<n)
{
mp m1;
for(int k=0;k<ans[j];k++)
{
//cout<<i<<' '<<j<<endl;
m1[a[i]]++;
i++;
}
for(auto it:m1)
{
if(it.second>1)
{
cout<<-1;
return 0;
}
}
j++;
// cout<<i<<' '<<j<<endl;
}
cout<<ans.size()<<endl;
for(int it:ans)
cout<<it<<' ';
return 0;
}