# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879606 | Mr_Husanboy | Energetic turtle (IZhO11_turtle) | C++17 | 250 ms | 262144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debugger.cpp"
#else
#define debug(...)
#endif
template<class T>
int len(T &a){
return a.size();
}
using ll = long long;
using pii = pair<int,int>;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
string fileio = "";
mt19937 mt(time(nullptr));
const int inf = 1e9;
const ll infl = 1e18;
const int maxn = 1e5 + 1;
void solve(){
int n, m, k, t, mod;
cin >> n >> m >> k >> t >> mod;
vector<pair<int,int>> p(k);
for(auto &[a,b] : p) cin >> a >> b;
auto brute = [&](){
int dp[m + 1][n + 1][t + 1]{};
map<pair<int,int>, int> mp;
for(int i = 0; i < k; i ++){
auto [x,y] = p[i];
mp[{y,x}] = 1;
}
dp[0][0][0] = 1;
for(int i = 1; i <= n; i ++){
if(mp[{0, i}]){
for(int j = 1; j <= t; j ++) {
dp[0][i][j] += dp[0][i - 1][j - 1];
if(dp[0][i][j] >= mod) dp[0][i][j] -= mod;
}
}else{
for(int j = 0; j <= t; j ++) {
dp[0][i][j] += dp[0][i - 1][j];
if(dp[0][i][j] >= mod) dp[0][i][j] -= mod;
}
}
}
for(int i = 1; i <= m; i ++){
if(mp[{i, 0}]){
for(int j = 1; j <= t; j ++) {
dp[i][0][j] += dp[i - 1][0][j - 1];
if(dp[i][0][j] >= mod) dp[i][0][j] -= mod;
}
}else{
for(int j = 0; j <= t; j ++) {
dp[i][0][j] += dp[i - 1][0][j];
if(dp[i][0][j] >= mod) dp[i][0][j] -= mod;
}
}
for(int j = 1; j <= n; j ++){
if(mp[{i, j}]){
for(int u = 1; u <= t; u ++){
dp[i][j][u] = dp[i][j - 1][u - 1] + dp[i - 1][j][u - 1];
if(dp[i][j][u] >= mod) dp[i][j][u] -= mod;
}
}else{
for(int u = 0; u <= t; u ++){
dp[i][j][u] = dp[i][j - 1][u] + dp[i - 1][j][u];
if(dp[i][j][u] >= mod) dp[i][j][u] -= mod;
}
}
}
}
int ans = 0;
for(int i = 0; i <= t; i ++){
ans = max(ans, dp[n][m][i]);
}
cout << ans;
};
brute();
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
auto start = chrono::high_resolution_clock::now();
#ifndef LOCAL
if(fileio.size()){
freopen((fileio + ".in").c_str(), "r", stdin);
freopen((fileio + ".out").c_str(), "w", stdout);
}
#endif
int testcases = 1;
#ifdef Tests
cin >> testcases;
#endif
while(testcases --){
solve();
cout << '\n';
#ifdef LOCAL
cout << "_________________________" << endl;
#endif
}
#ifdef LOCAL
auto duration = chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - start);
cout << "time: " << (double)duration.count()/1000.0 << " milliseconds" << endl;
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |