oj.uz

Submission #127622

# Submission time Handle Problem Language Result Execution time Memory
127622 2019-07-09T17:22:08 Z TadijaSebez Kangaroo (CEOI16_kangaroo) C++11
51 / 100
 2000 ms 23628 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)
{
	return sub(sum[t][i][r],sum[t][i][l-1]);
}
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 t=0;t<2;t++)
			for(int i=1;i<=l;i++)
				for(int j=1;j<=l;j++)
					sum[t][i][j]=add(sum[t][i][j-1],dp[t][i][j]),dp[t][i][j]=0;
		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,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:17: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 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 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 4 ms 888 KB Output is correct
8 Correct 3 ms 1000 KB Output is correct
9 Correct 3 ms 1020 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 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 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 4 ms 888 KB Output is correct
8 Correct 3 ms 1000 KB Output is correct
9 Correct 3 ms 1020 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 36 ms 4088 KB Output is correct
13 Correct 31 ms 3952 KB Output is correct
14 Correct 37 ms 4216 KB Output is correct
15 Correct 46 ms 4088 KB Output is correct
16 Correct 44 ms 4088 KB Output is correct
17 Correct 37 ms 4188 KB Output is correct
18 Correct 27 ms 3704 KB Output is correct
19 Correct 35 ms 4216 KB Output is correct
20 Correct 38 ms 4088 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 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 4 ms 888 KB Output is correct
8 Correct 3 ms 1000 KB Output is correct
9 Correct 3 ms 1020 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 36 ms 4088 KB Output is correct
13 Correct 31 ms 3952 KB Output is correct
14 Correct 37 ms 4216 KB Output is correct
15 Correct 46 ms 4088 KB Output is correct
16 Correct 44 ms 4088 KB Output is correct
17 Correct 37 ms 4188 KB Output is correct
18 Correct 27 ms 3704 KB Output is correct
19 Correct 35 ms 4216 KB Output is correct
20 Correct 38 ms 4088 KB Output is correct
21 Correct 1115 ms 17772 KB Output is correct
22 Correct 1384 ms 19320 KB Output is correct
23 Correct 1683 ms 21340 KB Output is correct
24 Execution timed out 2061 ms 23628 KB Time limit exceeded
25 Halted 0 ms 0 KB -