-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathspin.cpp
78 lines (72 loc) · 2.03 KB
/
spin.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
/*
ID: sireric1
LANG: C++11
TASK: spin
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("spin.in", "r", stdin);
freopen("spin.out", "w", stdout);
pii whl[5];
vector<pii> wedges[5];
for(int i = 0; i < 5; i++){
cin >> whl[i].second;
whl[i].first = 0;
int W; cin >> W;
for(int j = 0; j < W; j++){
pii x;
cin >> x.first >> x.second;
wedges[i].push_back(x);
}
}
//for(int i = 0; i < 5; i++){
//cout << whl[i] << endl << wedges[i] << endl << endl;
//}
for(int num = 0; true; num++){
int through[360];
fill(through, through+360, 0);
for(int i = 0; i < 5; i++){
for(pii j : wedges[i]){
for(int k = 0; k <= j.second; k++){
through[(j.first+k+whl[i].first)%360]++;
}
}
}
for(int i : through){
if(i == 5){
cout << num << endl;
return 0;
}
}
for(int i = 0; i < 5; i++){
whl[i].first += whl[i].second;
whl[i].first %= 360;
}
bool good = true;
for(int i = 0; i < 5; i++){
if(whl[i].first != 0){
good = false;
break;
}
}
if(good){
cout << "none" << endl;
return 0;
}
}
return 0;
}