USACO3.23Spinning Wheels

直接枚举角度 数据比较水吧 

/*
    ID: shangca2
    LANG: C++
    TASK: spin
 */
#include <iostream>
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
using namespace std;
struct node
{
    int l[10],r[10],k,v;
}p[10];
int f[6][370];
int main()
{
    freopen("spin.in","r",stdin);
    freopen("spin.out","w",stdout);
    int i,j,o,g;
    for(i = 1; i <= 5 ; i++)
    {
        cin>>p[i].v;
        cin>>p[i].k;
        for(j = 1; j <= p[i].k ; j++)
        {
            cin>>p[i].l[j]>>p[i].r[j];
            if(p[i].l[j]+p[i].r[j]>=360)
            {
                for(g = p[i].l[j]; g < 359 ; g++)
                f[i][g] = 1;
                for(g = 0; g <= (p[i].l[j]+p[i].r[j])%360 ; g++)
                f[i][g] = 1;
            }
            else
            for(g = p[i].l[j] ; g <= p[i].l[j]+p[i].r[j] ; g++)
                f[i][g] = 1;
        }
    }
    o = 0;
    for(i = 0 ; i < 360 ; i++)
    {
        if(f[1][i]&&f[2][i]&&f[3][i]&&f[4][i]&&f[5][i])
        {
            printf("0
");
            return 0;
        }
    }
    while(1)
    {
        o++;
        memset(f,0,sizeof(f));
        for(i = 1; i <= 5 ; i++)
        {
            for(j = 1; j <= p[i].k ; j++)
            {
                p[i].l[j] = (p[i].l[j]+p[i].v)%360;
                if(p[i].l[j]+p[i].r[j]>=360)
                {
                    for(g = p[i].l[j]; g < 359 ; g++)
                    f[i][g] = 1;
                    for(g = 0; g <= (p[i].l[j]+p[i].r[j])%360 ; g++)
                    f[i][g] = 1;
                }
                else
                for(g = p[i].l[j] ; g <= p[i].l[j]+p[i].r[j] ; g++)
                f[i][g] = 1;
            }
        }
        for(i = 0 ; i < 360 ; i++)
        {
            if(f[1][i]&&f[2][i]&&f[3][i]&&f[4][i]&&f[5][i])
            {
                printf("%d
",o);
                return 0;
            }
        }
        if(o==10000)
        {
            puts("none");
            return 0;
        }
    }
    return 0;
}