oj.uz

Submission #1063055

# Submission time Handle Problem Language Result Execution time Memory
1063055 2024-08-17T13:43:52 Z AKaan37 Fishing Game (RMI19_fishing) C++17
100 / 100
 890 ms 125268 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long int lo;
 
//~ #define int long long
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n*2;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const int li = 302;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flagt,t,dp[li][li][li][3][2];
int cev;
 
inline int add(int x,int y){
	if(x+y>=mod)return x+y-mod;
	return x+y;
}
 
inline int f(int x,int y,int z,int kim,int last){
	int cevv=0;
	if(x==0 && y==0 && z==0)return 1;
	if(dp[x][y][z][kim][last]!=0)return dp[x][y][z][kim][last];
	if(kim==0){
		if(x==0 && z==0)cevv=add(cevv,f(x,y,z,1,0));
		for(int i=1;i<=x;i++)cevv=add(cevv,f(x-1,y,z,1,1));
		for(int i=1;i<=z;i++)cevv=add(cevv,f(x,y+1,z-1,1,0));
	}
	if(kim==1){
		if(y==0 && x==0)cevv=add(cevv,f(x,y,z,2,last));
		for(int i=1;i<=y;i++)cevv=add(cevv,f(x,y-1,z,2,1));
		for(int i=1;i<=x;i++)cevv=add(cevv,f(x-1,y,z+1,2,last));
	}
	if(kim==2){
		for(int i=1;i<=z;i++)cevv=add(cevv,f(x,y,z-1,0,0));
		if(last)for(int i=1;i<=y;i++)cevv=add(cevv,f(x+1,y-1,z,0,0));
	}
	return dp[x][y][z][kim][last]=cevv;
}

int32_t main(void){
	scanf("%d %d",&n,&t);
	//~ memset(dp,-1,sizeof(dp));
	while(t--){
		FOR{
			scanf("%d",&a[i]);
		}
		FOR{
			scanf("%d",&b[i]);
		}
		int aveb=0,avec=0,bvec=0;
		FOR{
			int oku;
			scanf("%d",&oku);
			for(int j=1;j<=n*2;j++){
				if(oku==a[j])avec++;
				if(oku==b[j])bvec++;
			}
		}
		
		FOR{
			for(int j=1;j<=n*2;j++){
				if(a[i]==b[j])aveb++;
			}
		}
		printf("%d\n",f(aveb,bvec,avec,0,0));
	}
	return 0;
}

Compilation message

fishing.cpp: In function 'int32_t main()':
fishing.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |  scanf("%d %d",&n,&t);
      |  ~~~~~^~~~~~~~~~~~~~~
fishing.cpp:58:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |    scanf("%d",&a[i]);
      |    ~~~~~^~~~~~~~~~~~
fishing.cpp:61:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |    scanf("%d",&b[i]);
      |    ~~~~~^~~~~~~~~~~~
fishing.cpp:66:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |    scanf("%d",&oku);
      |    ~~~~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 4 ms 4444 KB Output is correct
5 Correct 74 ms 27612 KB Output is correct
6 Correct 139 ms 41040 KB Output is correct
7 Correct 242 ms 57936 KB Output is correct
8 Correct 401 ms 77908 KB Output is correct
9 Correct 626 ms 101456 KB Output is correct
10 Correct 890 ms 125268 KB Output is correct