Faraway

http://acm.hdu.edu.cn/showproblem.php?pid=6639 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
#include <ctime>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e2+9;
const int maxm=1e6;
const int mod=998244353;

struct node
{
    int x,y,k,t;
}p[maxn];

int x[maxn],y[maxn];

int n,m;
bool ch(int xe,int ye)
{
    for(int i=1;i<=n;i++)
    {
        if((abs(xe-p[i].x)+abs(ye-p[i].y))%p[i].k!=p[i].t) return 0;
    }
    return 1;
}

int lc;
ll cal(int l,int r)
{
    ll len=r-l-1;
    if(len<0) return 0;
    return len/lc+1;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {

        scanf("%d%d",&n,&m);

        int cnt=1;
        x[0]=0;
        y[0]=0;
        x[1]=m+1;
        y[1]=m+1;

        for(int i=1;i<=n;i++)
        {
            sfi(p[i].x);
            sfi(p[i].y);
            sfi(p[i].k);
            sfi(p[i].t);
            x[++cnt]=p[i].x;
            y[cnt]=p[i].y;


        }

        lc=p[1].k;

        for(int i=2;i<=n;i++)
        {
            lc=lc*p[i].k/(__gcd(lc,p[i].k));
        }

        //cout<<lc<<endl;


        sort(x,x+1+cnt);
        sort(y,y+1+cnt);

        ll ans=0;
        for(int i=0;i<cnt;i++)
        {
            if(x[i]==x[i+1]) continue;
            for(int j=0;j<cnt;j++)
            {
                if(y[j]==y[j+1]) continue;
                for(int q=0;q<lc;q++)
                {
                    for(int z=0;z<lc;z++)
                    {
                        if(ch(x[i]+q,y[j]+z))
                        {
                            ans=ans+cal(x[i]+q,x[i+1])*cal(y[j]+z,y[j+1]);
                        }
                    }
                }
            }
        }
        printf("%lld\n",ans);
    }


    return 0;
}

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
#include <ctime>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e2+9;
const int maxm=1e6;
const int mod=998244353;

struct node
{
    int x,y,k,t;
}p[maxn];

int x[maxn],y[maxn];

int n,m;
bool ch(int xe,int ye)
{
    for(int i=1;i<=n;i++)
    {
        if((abs(xe-p[i].x)+abs(ye-p[i].y))%p[i].k!=p[i].t) return 0;
    }
    return 1;
}

ll cal(int l,int r)
{
    ll len=r-l-1;
    if(len<0) return 0;
    return len/60+1;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {

        scanf("%d%d",&n,&m);

        int cnt=1;
        x[0]=0;
        y[0]=0;
        x[1]=m+1;
        y[1]=m+1;

        for(int i=1;i<=n;i++)
        {
            sfi(p[i].x);
            sfi(p[i].y);
            sfi(p[i].k);
            sfi(p[i].t);
            x[++cnt]=p[i].x;
            y[cnt]=p[i].y;
        }


        sort(x,x+1+cnt);
        sort(y,y+1+cnt);

        ll ans=0;
        for(int i=0;i<=cnt;i++)
        {
            if(x[i]==x[i+1]) continue;
            for(int j=0;j<cnt;j++)
            {
                if(y[j]==y[j+1]) continue;
                for(int q=0;q<60;q++)
                {
                    for(int z=0;z<60;z++)
                    {
                        if(ch(x[i]+q,y[j]+z))
                        {
                            ans=ans+cal(x[i]+q,x[i+1])*cal(y[j]+z,y[j+1]);
                        }
                    }
                }
            }
        }
        printf("%lld\n",ans);
    }


    return 0;
}