oj.uz

Submission #127623

# Submission time Handle Problem Language Result Execution time Memory
127623 2019-07-09T17:26:23 Z TadijaSebez Kangaroo (CEOI16_kangaroo) C++11
51 / 100
 2000 ms 28152 KB 
#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int N=2005;
int add(int x, int y){ x+=y;return x>=mod?x-mod:x;}
void ADD(int &x, int y){ x=add(x,y);}
int sub(int x, int y){ x-=y;return x<0?x+mod:x;}
void SUB(int &x, int y){ x=sub(x,y);}
int dp[2][N][N],sum[2][N][N];
int Get(int i, int l, int r, int t)
{
	int x=sum[t][i][r]-sum[t][i][l-1];
	if(x<0) x+=mod;
	return x;
}
int main()
{
	int n,cs,cf;
	scanf("%i %i %i",&n,&cs,&cf);
	dp[0][1][1]=dp[1][1][1]=1;
	for(int l=2;l<=n;l++)
	{
		for(int i=1;i<=l-1;i++)
			for(int j=1;j<=l-1;j++)
			{
				sum[0][i][j]=sum[0][i][j-1]+dp[0][i][j];
				if(sum[0][i][j]>=mod) sum[0][i][j]-=mod;
				sum[1][i][j]=sum[1][i][j-1]+dp[1][i][j];
				if(sum[1][i][j]>=mod) sum[1][i][j]-=mod;
			}
		for(int i=1;i<=l;i++)
			for(int j=1;j<=l;j++)
			{
				if(i!=j)
				{
					dp[0][i][j]=Get(i-(i>j),1,j-1,1);
					dp[1][i][j]=Get(i-(i>j),j,l-1,0);
				}
				else dp[0][i][j]=dp[1][i][j]=0;
			}
	}
	int ans=add(dp[0][cs][cf],dp[1][cs][cf]);
	printf("%i\n",ans);
	return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i %i",&n,&cs,&cf);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 1016 KB Output is correct
6 Correct 3 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 1016 KB Output is correct
6 Correct 3 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 26 ms 4088 KB Output is correct
13 Correct 23 ms 3832 KB Output is correct
14 Correct 26 ms 4088 KB Output is correct
15 Correct 27 ms 4312 KB Output is correct
16 Correct 26 ms 4088 KB Output is correct
17 Correct 27 ms 4092 KB Output is correct
18 Correct 20 ms 3704 KB Output is correct
19 Correct 26 ms 4088 KB Output is correct
20 Correct 27 ms 4216 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 1016 KB Output is correct
6 Correct 3 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 26 ms 4088 KB Output is correct
13 Correct 23 ms 3832 KB Output is correct
14 Correct 26 ms 4088 KB Output is correct
15 Correct 27 ms 4312 KB Output is correct
16 Correct 26 ms 4088 KB Output is correct
17 Correct 27 ms 4092 KB Output is correct
18 Correct 20 ms 3704 KB Output is correct
19 Correct 26 ms 4088 KB Output is correct
20 Correct 27 ms 4216 KB Output is correct
21 Correct 764 ms 17772 KB Output is correct
22 Correct 936 ms 19332 KB Output is correct
23 Correct 1149 ms 21440 KB Output is correct
24 Execution timed out 2062 ms 28152 KB Time limit exceeded
25 Halted 0 ms 0 KB -