Submission #151882

#	Time	Username	Problem	Language	Result	Execution time	Memory
151882		claudy	Kangaroo (CEOI16_kangaroo)	C++14	51 / 100	164 ms	69668 KiB

kangaroo

//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;

/*
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>;
Tree<int>tr;
*/

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

const int mod = 1e9 + 7;

int dp[2][203][203][203],n,cs,cf;

void add(int &x, int y){
	x += y;
	if(x >= mod) x -= mod;
}

inline int F(int idx,int op,int l,int r,int f){
	int ans = dp[op][idx][r][f] - dp[op][idx][l - 1][f];
	if(ans < 0) ans += mod;
	return ans;
}

int32_t main(){_
	//freopen("input","r",stdin);
	cin >> n >> cs >> cf;
	// dp[op][idx][s][f]
	dp[0][1][1][1] = dp[1][1][1][1] = 1;
	for(int i = 1;i <= n;i++){
		if(i > 1)
		for(int op = 0;op < 2;op++){
			for(int s = 1;s <= i;s++){
				for(int f = 1;f <= i;f++){
					if(s == f) continue;
					if(op == 0){
						add(dp[op][i][s][f],F(i - 1,!op,s,i - 1,f - (f > s)));
					}
					else
					{
						add(dp[op][i][s][f],F(i - 1,!op,1,s - 1,f - (f > s)));
					}
					//~ cout << op << ' ' << i << ' ' << s << ' ' << f << ' ' << dp[op][i][s][f] << '\n';
				}
			}
		}
		if(i != n)
		for(int op = 0;op < 2;op++){
			for(int f = 1;f <= i;f++){
				for(int s = 1;s <= i;s++){
					add(dp[op][i][s][f],dp[op][i][s - 1][f]);
				}
			}
		}
	}
	add(dp[0][n][cs][cf],dp[1][n][cs][cf]);
	rc(dp[0][n][cs][cf]);
	return 0;
}

Compilation message (stderr)

kangaroo.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")

• Subtask 1: 6 / 6
• Subtask 2: 30 / 30
• Subtask 3: 15 / 15
• Subtask 4: 0 / 49