oj.uz

답안 #274116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
274116 2020-08-19T08:34:20 Z AKaan37 Fishing Game (RMI19_fishing) C++17
0 / 100
 525 ms 524292 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;
typedef pair< lo,PII > PIII;
typedef pair< lo,PIII > PIIII;

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

int n,m,b[li],a[li],k,flag,t,c[li];
int cev;
string s;
map<PIIII,int> dp;
vector<int> v;

inline int mul(int x,int y){
	return (x%mod)*(y%mod)%mod;
}

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 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(x==0 && y==0 && z==0)return 1;
	if(dp.find({x,{y,{z,kim}}})!=dp.end())return dp[{x,{y,{z,kim}}}];
	//~ cout<<x<<" : : "<<y<<" : ;"<<z<<endl;
	if(kim==1){
		for(int i=1;i<=x;i++)cevv=add(cevv,f(x-1,y,z,2));
		for(int i=1;i<=z;i++)cevv=add(cevv,f(x,y+1,z-1,2));
	}
	if(kim==2){
		for(int i=1;i<=y;i++)cevv=add(cevv,f(x,y-1,z,3));
		for(int i=1;i<=x;i++)cevv=add(cevv,f(x-1,y,z+1,3));
	}
	if(kim==3){
		for(int i=1;i<=z;i++)cevv=add(cevv,f(x,y,z-1,1));
		for(int i=1;i<=y;i++)cevv=add(cevv,f(x+1,y-1,z,1));
	}
	return dp[{x,{y,{z,kim}}}]=cevv;
}

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

Compilation message

fishing.cpp:70:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(void){
      |          ^
fishing.cpp: In function 'int main()':
fishing.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |  scanf("%lld %lld",&n,&t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
fishing.cpp:76:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   76 |    scanf("%lld",&a[i]);
      |    ~~~~~^~~~~~~~~~~~~~
fishing.cpp:79:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   79 |    scanf("%lld",&b[i]);
      |    ~~~~~^~~~~~~~~~~~~~
fishing.cpp:82:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   82 |    scanf("%lld",&c[i]);
      |    ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 455 ms 524292 KB Execution killed with signal 9
2 Runtime error 477 ms 524292 KB Execution killed with signal 9
3 Runtime error 525 ms 524292 KB Execution killed with signal 9
4 Runtime error 485 ms 524292 KB Execution killed with signal 9
5 Runtime error 475 ms 524292 KB Execution killed with signal 9
6 Runtime error 461 ms 524292 KB Execution killed with signal 9
7 Runtime error 473 ms 524292 KB Execution killed with signal 9
8 Runtime error 485 ms 524292 KB Execution killed with signal 9
9 Runtime error 523 ms 524288 KB Execution killed with signal 9
10 Runtime error 466 ms 524288 KB Execution killed with signal 9