记录编号	570805	评测结果	AAAAAAAA
题目名称	纺车的轮子	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-04-18 23:25:10	内存使用	0.00 MiB

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define MAX(_a, _b) [&](int __a, int __b) { return __a < __b ? __b : __a; }((_a), (_b))
#define MIN(_a, _b) [&](int __a, int __b) { return __a > __b ? __b : __a; }((_a), (_b))
#define ABS(_x) [&](int __x) { return __x < 0 ? -__x : __x; }(_x)
#define fi first
#define se second 

using ll = long long;
using PII = std::pair<int, int>;

namespace IO {
    template <typename T> inline T read() {
        char ch = getchar();
        T ret = 0, sig = 1;
        while(ch < '0' || ch > '9') { if(ch == '-') sig = -1; ch = getchar(); }
        while(ch >= '0' && ch <= '9') ret *= 10, ret += ch - 48, ch = getchar();
        return ret * sig;
    }
    template <typename T> inline void write(T out) {
        if(!out) { putchar('0'), putchar(' '); return; }
        int stk[100], tt = 0;
        if(out < 0) out = -out, putchar('-');
        while(out) stk[tt++] = out % 10, out /= 10;
        for(register int i = --tt; i>=0; --i) putchar(stk[i] + 48);
        putchar(' ');
    }
    template <typename T> inline void read(T& ret) { ret = IO::read<T>(); }
    template <typename T, typename... Args> inline void read(T& x, Args&... args) { IO::read(x), IO::read(args...); }
    template <typename T, typename... Args> inline void write(T x, Args... args)  { IO::write(x), IO::write(args...); }
};


using IO::read;
using IO::write;

int a[6], s[6];
int cnt[361];
std::vector<PII> w[6];

int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(spin);
    for (int i = 1; i <= 5; ++ i) {
        read(a[i], s[i]);
        for (int j = 1; j <= s[i]; ++ j) {
            int x, y;
            read(x, y);
            w[i].emplace_back(x, y);
        }
    }
    for (int m = 0; m <= 360; ++ m) {
        memset(cnt, 0, sizeof cnt);
        for (int i = 1; i <= 5; ++ i) 
            for (auto& j : w[i]) {
                for (int k = j.fi; k <= j.fi + j.se; ++ k) 
                    ++ cnt[k % 360];
                j.fi = (j.fi + a[i]) % 360;
            }
        for (int i = 0; i < 360; ++ i) 
            if (cnt[i] == 5) {
                write(m);
                return 0;
            }
    }
    puts("none");
    return 0;
}