Submission #88657

#	Time	Username	Problem	Language	Result	Execution time	Memory
88657		Badral	Energetic turtle (IZhO11_turtle)	C++17	10 / 100	823 ms	262148 KiB

turtle

#include<bits/stdc++.h>
#define maxn 10005
#define mp make_pair
using namespace std;
typedef long long ll;

bool a[maxn][maxn];

int main() {
	int n, m, k1, t, z;
	cin >>n >>m >>k1 >>t >>z;
	while(k1--) {
		int x, y;
		cin >>x >>y;
		a[x][y] = 1;
	}
	ll ans = 0;
	queue<pair<pair<int,int> ,int> > pq;
	pq.push(mp(mp(0, 0), t));
	while(!pq.empty()) {
		int x = pq.front().first.first;
		int y = pq.front().first.second;
		int k = pq.front().second;
		if(x == n && y == m) ans++;
		pq.pop();
		if(x < n) {
			if(a[x+1][y] == 1 && k > 0) {
				pq.push(mp(mp(x+1, y), k-1));
			}
			if(a[x+1][y] == 0) {
				pq.push(mp(mp(x+1, y), k));
			}
		}
		if(y < m) {
			if(a[x][y+1] == 1 && k > 0) {
				pq.push(mp(mp(x, y+1), k-1));
			}
			if(a[x][y+1] == 0) {
				pq.push(mp(mp(x, y+1), k));
			}
		}
	}
	cout<<ans%z;

}

• Subtask 1: 10 / 100