Cod sursă (job #119280)

#include <stdio.h>

using namespace std;

const unsigned short int N=50000/63 + 2;
const unsigned short int D=10002;

unsigned short int x[D],y[D],v[D];
unsigned short int na;
unsigned long long a[N];

int main()
{
    FILE *in,*out;
    in=fopen("beculete.in","r");
    out=fopen("beculete.out","w");

    unsigned long long b1,b2;
    unsigned short int n,d;
    unsigned short int k,p,i,j;

    fscanf(in,"%hu%hu",&n,&d);
    for(i=0;i<d;i++)
    {
        fscanf(in,"%hu%hu%hu",&x[i],&y[i],&v[i]);
        x[i]--;
        y[i]--;
    }

    na=1;
    a[0]=1LLU;
    p=0;
    for(i=1;i<n;i++)
    {
        b1=b2=0LLU;
        if(i>=64*na) na++;
        for(j=0;j<na;j++)
        {
            b2=(a[j]&(1LLU<<63))>>63;
            a[j]^=a[j]<<1;
            a[j]^=b1;
            b1=b2;
            while(p<d && x[p]==i && y[p]>=64*j && y[p]<64*(j+1))
            {
                a[j]&=~(1LLU<<(y[p]-64*j));
                if(v[p]) a[j]+=1LLU<<(y[p]-64*j);
                p++;
            }
        }
    }

    i=0;
    j=0;
    while(i<n)
    {
        k=0;
        while(i<n && k<64)
        {
            fprintf(out,"%d",(a[j]&(1LLU<<k))>>k);
            if(i<n-1) fprintf(out," ");
            i++; k++;
        }
        j++;
    }
    return 0;
}