結果
問題 | No.250 atetubouのzetubou |
ユーザー |
|
提出日時 | 2015-01-08 21:31:22 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 74 ms / 5,000 ms |
コード長 | 2,256 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 160,080 KB |
実行使用メモリ | 43,652 KB |
最終ジャッジ日時 | 2024-06-13 03:16:34 |
合計ジャッジ時間 | 3,994 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
/*tester atetubou's code*/#include <bits/stdc++.h>#include <iostream>#include <vector>#include <queue>#include <string>#include <cstring>#include <sstream>#include <set>#include <map>#include <algorithm>#include <cstdio>#include <cstdlib>#define rep(i,n) for(int i=0;i<(int)(n);++i)#define iter(a) __typeof(a.begin())#define FOR(it,a) for(iter(a)it=a.begin();it!=a.end();++it)#define F first#define S second#define SZ(a) (int)((a).size())#define sz(a) SZ(a)#define pb(a) push_back(a)#define mp(a,b) make_pair(a,b)#define ALL(a) (a).begin(),(a).end()using namespace std;typedef long long ll;typedef pair<int,int> PI;typedef unsigned long long ull;#define PR(...) do{cerr << "line : " << __LINE__ << endl;pr(#__VA_ARGS__, __VA_ARGS__);}while(0);template<class T>void pr(const string& name, T t){cerr << name << ": " << t << endl;}template<typename T, typename ... Types>void pr(const string& names, T t, Types ... rest) {auto comma_pos = names.find(',');cerr << names.substr(0, comma_pos) << ": " << t << ", ";auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);pr(string(names, next_name_pos), rest ...);}template<class T,class U> ostream& operator<< (ostream& o, constpair<T,U>& v){return o << "(" << v.F << ", " << v.S << ")";}template<class T> ostream& operator<< (ostream& o, const vector<T>&v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";}const int dx[] = {0,1,0,-1};const int dy[] = {-1,0,1,0};#define endl '\n'll memo[1600][1600];ll sum[1600][1600];ll rec(int,int);ll INF=1LL<<60LL;ll sumr(int d,int x){if(x<0) return 0;if(sum[d][x]>=0) return sum[d][x];ll& ret = sum[d][x] = 0;ret += rec(d,x) + sumr(d,x-1);ret = min(ret,INF);return ret;}ll rec(int d,int x){if(d==0) return 1;if(memo[d][x] >= 0) return memo[d][x];ll& ret = memo[d][x] = 0;//ret = rec(d-1,x) + rec(d-1,x-1);ret = sumr(d-1,x);ret = min(ret,INF);return ret;}int main(int argc, char *argv[]){memset(memo,-1,sizeof(memo));memset(sum,-1,sizeof(sum));int t;cin >> t;rep(i,t){int d,x;ll t;cin >> d >> x >> t;//PR(rec(d-1,x));cout << (rec(d-1,x) <= t ? "AC" : "ZETUBOU") << endl;}return 0;}