Submission #274207

# Submission time Handle Problem Language Result Execution time Memory
274207 2020-08-19T09:49:31 Z AKaan37 Fishing Game (RMI19_fishing) C++17
0 / 100
2000 ms 191204 KB
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#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 = 201;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flagt,t,dp[li][li][li][3][2];
int cev;
//~ map<PIIIII,int> dp;


inline lo 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,bool last){
	int cevv=0;
	//~ if(x==0 && z==0 && kim==1)return 1;
	//~ if(y==0 && x==0 && kim==2)return 1;
	//~ if(z==0 && y==0 && kim==3)return 1;
	//~ if(z==0 && last==0 && kim==3)return 1;
	if(x==0 && y==0 && z==0)return 1;
	if(~dp[x][y][z][kim][last])return dp[x][y][z][kim][last];
	//~ cout<<x<<" : : "<<y<<" : ;"<<z<<endl;
	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){
		//~ if(last && y==0)cevv=add(cevv,f(x,y,z,1,0));
		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;
}

main(void){
	scanf("%d %d",&n,&t);
	while(t--){
		//~ dp.clear();
		memset(dp,-1,sizeof(dp));
		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++;
			}
		}
		//~ aveb=2;
		//~ avec=2;
		//~ bvec=2;
		//~ cout<<aveb<<" :: "<<bvec<<" :: "<<avec<<endl;
		printf("%d\n",f(aveb,bvec,avec,1,0));
	}
	return 0;
}

Compilation message

fishing.cpp:66:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   66 | main(void){
      |          ^
fishing.cpp: In function 'int main()':
fishing.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |  scanf("%d %d",&n,&t);
      |  ~~~~~^~~~~~~~~~~~~~~
fishing.cpp:72:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |    scanf("%d",&a[i]);
      |    ~~~~~^~~~~~~~~~~~
fishing.cpp:75:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |    scanf("%d",&b[i]);
      |    ~~~~~^~~~~~~~~~~~
fishing.cpp:80:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   80 |    scanf("%d",&oku);
      |    ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 160 ms 190968 KB Output isn't correct
2 Incorrect 212 ms 190968 KB Output isn't correct
3 Incorrect 217 ms 190968 KB Output isn't correct
4 Incorrect 220 ms 190968 KB Output isn't correct
5 Incorrect 738 ms 191096 KB Output isn't correct
6 Incorrect 1214 ms 191200 KB Output isn't correct
7 Incorrect 1982 ms 191204 KB Output isn't correct
8 Execution timed out 2095 ms 191168 KB Time limit exceeded
9 Execution timed out 2091 ms 191096 KB Time limit exceeded
10 Execution timed out 2102 ms 191112 KB Time limit exceeded