oj.uz

Submission #922368

# Submission time Handle Problem Language Result Execution time Memory
922368 2024-02-05T12:46:41 Z thunopro Energetic turtle (IZhO11_turtle) C++14
40 / 100
 59 ms 86608 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

int mod = 1e9+7; 
const int INF = 1e9; 

typedef vector<int> vi; 
typedef pair<int,int> pii;
typedef vector<pii> vii;  
typedef vector<ll> vl;

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a > mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ;
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int n , m , trap , strength ; 
int a [1009][1009] ;
int dp [1009][1009][21] ; 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n >> m >> trap >> strength >> mod ; 
	
	for ( int i = 1 ; i <= trap ; i ++ ) 
	{
		int x , y ; cin >> x >> y ; 
		a [x][y] = 1 ; 
	}
	
	dp [0][0][0] = 1 ; 
	
	for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= m ; j ++ ) for ( int t = 0 ; t <= strength ; t ++ ) 
	{
		add (dp[i+1][j][t+(a[i+1][j]==1)],dp[i][j][t]) ; 
		add (dp[i][j+1][t+(a[i][j+1]==1)],dp[i][j][t]) ; 
	}
	
	int res = 0 ; 
	for ( int t = 0 ; t <= strength ; t ++ ) add (res,dp[n][m][t]) ; 
	
	cout << res ; 
}

Compilation message

turtle.cpp: In function 'void rf()':
turtle.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 3160 KB Output is correct
5 Correct 4 ms 7516 KB Output is correct
6 Correct 21 ms 27184 KB Output is correct
7 Correct 30 ms 40772 KB Output is correct
8 Correct 59 ms 86608 KB Output is correct
9 Runtime error 2 ms 856 KB Execution killed with signal 11
10 Runtime error 2 ms 524 KB Execution killed with signal 11
11 Runtime error 2 ms 604 KB Execution killed with signal 11
12 Runtime error 2 ms 348 KB Execution killed with signal 11
13 Runtime error 2 ms 604 KB Execution killed with signal 11
14 Runtime error 2 ms 348 KB Execution killed with signal 11
15 Runtime error 2 ms 348 KB Execution killed with signal 11
16 Runtime error 2 ms 604 KB Execution killed with signal 11
17 Runtime error 2 ms 604 KB Execution killed with signal 11
18 Runtime error 2 ms 460 KB Execution killed with signal 11
19 Runtime error 3 ms 348 KB Execution killed with signal 11
20 Runtime error 2 ms 604 KB Execution killed with signal 11