Cod sursă (job #415468)

#include <fstream>

using namespace std;

ifstream in("beculete.in");
ofstream out("beculete.out");

int n, d, pos=1;
bool beculete[2][50001];

struct becStricat
{
    int l, c;
    bool state;
} v[10001];

int main()
{
    in >> n >> d;
    for(int i = 1; i <= d; i++)
        in >> v[i].l >> v[i].c >> v[i].state;
    if(v[pos].l == 1 && v[pos].c == 1)
        beculete[1][1] = v[pos++].state;
    else
        beculete[1][1] = 1;
    for(int i = 2; i <= n; i++)
    {
        swap(beculete[0], beculete[1]);
        for(int j = 1; j <= i; j++)
            if(v[pos].l == i && v[pos].c == j)
                beculete[1][j] = v[pos++].state;
            else
                beculete[1][j] = beculete[0][j-1] ^ beculete[0][j];
    }
    for(int i = 1; i <= n; i++)
        out << beculete[1][i] << ' ';
    return 0;
}