-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsnapshot.cpp
78 lines (64 loc) · 1.6 KB
/
snapshot.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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll k;
cin >> k;
vi x(n);
for(ll i = 0; i < n; i++) {
cin >> x[i];
}
vi v(n);
bool works = true;
for (ll c = 0; c < k; c++) {
ll t;
cin >> t;
map < ll, ll> l;
for (ll i = 0; i < n; i++) {
ll q;
cin >> q;
l[q]++;
}
for (ll i = 0; i < n; i++) {
if(v[i] == 0) {
if (l.find(x[i] - t) != l.end()) {
v[i] = -1;
l[x[i] - t]--;
} else if (l.find(x[i] + t) != l.end()) {
v[i] = 1;
l[x[i] + t]--;
} else {
works = false;
}
} else {
if (v[i] == 1) {
if (l.find(x[i] + t) != l.end()) l[x[i] + t]--;
else
works = false;
} else if(v[i] == -1) {
if (l.find(x[i] - t) != l.end())
l[x[i] - t]--;
else
works = false;
}
}
}
for (pair<ll, ll> val : l) {
if (val.second != 0) works = false;
}
}
if (!works) cout << 0 << endl;
else {
for (ll i : v) cout << i << " ";
cout << endl;
}
return 0;
}