Submission #203712

# Submission time Handle Problem Language Result Execution time Memory
203712 2020-02-22T00:42:05 Z rqi Fishing Game (RMI19_fishing) C++14
60 / 100
1641 ms 410508 KB
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef double db;
typedef long long ll;
typedef long double ld;
typedef string str;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;
 
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a : x)
 
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
 
const int MOD = 1e9+7; // 998244353 = (119<<23)+1
const ll INF = 1e18;
const int MX = 2e5+5;
const ld PI = 4*atan((ld)1);
 
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
 
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define ook order_of_key
#define fbo find_by_order
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0); // fast I/O
        cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
template<class T> T invGeneral(T a, T b) {
	a %= b; if (a == 0) return b == 1 ? 0 : -1;
	T x = invGeneral(b,a); 
	return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
 
template<class T> struct modular {
	T val; 
	explicit operator T() const { return val; }
	modular() { val = 0; }
	modular(const ll& v) { 
		val = (-MOD <= v && v <= MOD) ? v : v % MOD;
		if (val < 0) val += MOD;
	}
	
	// friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
	friend void pr(const modular& a) { pr(a.val); }
	friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
	friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
	friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
	friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }
 
	modular operator-() const { return modular(-val); }
	modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
	modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
	modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
	friend modular pow(modular a, ll p) {
		modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	friend modular inv(const modular& a) { 
		auto i = invGeneral(a.val,MOD); assert(i != -1);
		return i;
	} // equivalent to return exp(b,MOD-2) if MOD is prime
	modular& operator/=(const modular& m) { return (*this) *= inv(m); }
	
	friend modular operator+(modular a, const modular& b) { return a += b; }
	friend modular operator-(modular a, const modular& b) { return a -= b; }
	friend modular operator*(modular a, const modular& b) { return a *= b; }
	
	friend modular operator/(modular a, const modular& b) { return a /= b; }
};
 
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int hascard[3][305];
int main() {
	setIO();
    // you should actually read the stuff at the bottom
    int N, T;
    cin >> N >> T;
    mi dp[3][2][205][205][205];
    for(int i = 0; i < T; i++){
    	for(int i = 0; i < 3; i++){
    		for(int j = 0; j < 2; j++){
    			for(int k = 0; k < 2*N+5; k++){
    				for(int l = 0; l < 2*N+5; l++){
    					for(int m = 0; m < 2*N+5; m++){
    						dp[i][j][k][l][m] = 0;
    					}
    				}
    			}
    		}
    	}
    	for(int i = 1; i <= 3*N; i++){
    		hascard[0][i] = hascard[1][i] = hascard[2][i] = 0;
    	}
    	for(int i = 0; i < 2*N; i++){
    		int card;
    		cin >> card;
    		hascard[0][card] = 1;
    	}
    	for(int i = 0; i < 2*N; i++){
    		int card;
    		cin >> card;
    		hascard[1][card] = 1;
    	}
    	for(int i = 0; i < 2*N; i++){
    		int card;
    		cin >> card;
    		hascard[2][card] = 1;
    	}
    	int AB, AC, BC;
    	AB = AC = BC = 0;
    	for(int i = 1; i <= 3*N; i++){
    		if(hascard[0][i] == 1 && hascard[1][i] == 1){
    			AB++;
    		}
    		else if(hascard[0][i] == 1 && hascard[2][i] == 1){
    			AC++;
    		}
    		else if(hascard[1][i] == 1 && hascard[2][i] == 1){
    			BC++;
    		}
    	}
    	dp[0][0][BC][AC][AB] = 1; // A's turn, has not removed a card
    	
    	//ps(BC, AC, AB);
    	for(int sum = BC+AC+AB; sum >= 1; sum--){
    		for(int remov = 1; remov >= 0; remov--){
    			for(int turn = 0; turn < 3; turn++){
    				if(turn == 0 && remov == 1) continue;
    				for(int BC = 0; BC <= sum; BC++){
    					for(int AC = 0; AC+BC <= sum; AC++){
    				
    						int AB = sum-AC-BC;
    				
    					
    						mi num = dp[turn][remov][BC][AC][AB];
    						//if(num != 0) ps("BC, AC, AB, turn, remov, num:", BC, AC, AB, turn, remov, num);
    						if(turn == 0){
    							//if A has no cards
    							if(AB == 0 && AC == 0){
    								dp[1][remov][BC][AC][AB]+=num;
    							}
    							//if sends AB
    							dp[1][1][BC][AC][AB-1]+=mi(AB)*num;
    							//if sends AC
    							dp[1][remov][BC+1][AC-1][AB]+=mi(AC)*num;
    						}
    						else if(turn == 1){
    							//if B has no cards
    							if(BC == 0 && AB == 0){
    								dp[2][remov][BC][AC][AB]+=num;
    							}
    							//if sends AB
    							dp[2][remov][BC][AC+1][AB-1]+=num*mi(AB);
    							//if sends BC
    							dp[2][1][BC-1][AC][AB]+=num*mi(BC);
    						}
    						else{
    							if(AC == 0 && BC == 0){
    								if(remov == 0) continue;
    								dp[0][0][BC][AC][AB]+=num;
    							}
    							//if send AC
    							if(AC > 0){
    								dp[0][0][BC][AC-1][AB]+=num*mi(AC);
    							}
    							//if sends BC
    							if(BC > 0){
    								if(remov == 1) dp[0][0][BC-1][AC][AB+1]+=num*mi(BC);
    							}
    						}
    						
    					}
    				}
    			}
    		}
    	}
    	mi ans = 0;
    	for(int i = 0; i < 3; i++){
    		for(int j = 0; j < 2; j++){
    			ans+=dp[i][j][0][0][0];
    		}
    	}
    	ps(int(ans));
    }
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), set tle
	* do smth instead of nothing and stay organized
*/

Compilation message

fishing.cpp: In function 'void io::setIn(std::__cxx11::string)':
fishing.cpp:135:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
fishing.cpp: In function 'void io::setOut(std::__cxx11::string)':
fishing.cpp:136:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 105 ms 202624 KB Output is correct
2 Correct 107 ms 202592 KB Output is correct
3 Correct 108 ms 202616 KB Output is correct
4 Correct 121 ms 202916 KB Output is correct
5 Correct 385 ms 202616 KB Output is correct
6 Correct 594 ms 202744 KB Output is correct
7 Runtime error 927 ms 410452 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 1199 ms 410508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 1641 ms 410360 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 368 ms 410360 KB Execution killed with signal 11 (could be triggered by violating memory limits)