Cod sursa(job #1709883)

Utilizator TeamFIIDUAIC backtrackers TeamFIID Data 28 mai 2016 14:17:45
Problema Padure2 Scor 0
Compilator cpp Status done
Runda ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest Marime 0.99 kb
#include <fstream>
using namespace std;
#define MODULO 2000003
#define IN "padure2.in"
#define OUT "padure2.out"
#define ciuperca -1 
#define NMAX 1000005

int n, m, nr_ciuperci;
int P[2][NMAX];

struct pct
{
	int x;
	int y;
} c[1005];

int main()
{
	ifstream fin(IN);
	ofstream fout(OUT);

	fin >> n >> m >> nr_ciuperci;
	
	int k;
	for (k = 1; k <= nr_ciuperci; k++)
		fin >> c[k].x >> c[k].y;
	
	int i, j; int a = 0;
	P[1][1] = 1;


	for (i = 1; i <= n; i++)
	{
		for (k = 1; k <= nr_ciuperci; k++)
		{
			if (c[k].x == i)
				P[1 - a][c[k].y] = ciuperca;
		}

		for (j = 1; j <= m; j++)
		{
			if (P[1 - a][j] == ciuperca)
				continue;
		
			if (P[a][j] != ciuperca)
				P[1-a][j] = (P[1-a][j] + P[a][j]) % MODULO;
			if (P[1-a][j - 1] != ciuperca)
				P[1-a][j] = (P[1-a][j] + P[1-a][j - 1])%MODULO;
		}

		for (j = 1; j <= m; j++)
		{
			P[a][j] = 0;
		}
		a = 1 - a;
	}

	fout << P[a][m] % MODULO << '\n';

	fin.close();
	fout.close();
	return 0;
}