結果

問題 No.474 色塗り２
ユーザー shimomireshimomire
提出日時 2016-12-24 18:17:03
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 331 ms / 2,000 ms
コード長 5,824 bytes
コンパイル時間 1,228 ms
コンパイル使用メモリ 128,416 KB
実行使用メモリ 35,956 KB
最終ジャッジ日時 2024-12-14 18:32:58
合計ジャッジ時間 2,776 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
35,924 KB
testcase_01 AC 151 ms
35,912 KB
testcase_02 AC 150 ms
35,956 KB
testcase_03 AC 331 ms
35,852 KB
testcase_04 AC 148 ms
35,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug==
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-12;};
template<> inline long double EPS<long double>(){return 1e-12;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}


class Main{
	public:

	// https://www37.atwiki.jp/uwicoder/pages/2118.html#id_8a11702b
	vector<ll> facts;
	vector<ll> fact_invs;
	ll nCr(ll n,ll r,ll p,ll q){
		ll P = (ll)pow(p,q);
		ll z = n - r;
		int e0 = 0;
		for(long u = n/p;u > 0;u /= p)e0 += u;
		for(long u = r/p;u > 0;u /= p)e0 -= u;
		for(long u = z/p;u > 0;u /= p)e0 -= u;

		int em = 0;
		for(long u = n/P;u > 0;u /= p)em += u;
		for(long u = r/P;u > 0;u /= p)em -= u;
		for(long u = z/P;u > 0;u /= p)em -= u;

		long ret = 1;
		while(n > 0){
			ret = ret * facts[(int)(n%P)] % P * fact_invs[(int)(r%P)] % P * fact_invs[(int)(z%P)] % P;
			n /= p; r /= p; z /= p;
		}
		for(int i = 0;i < e0;i++)ret = ret * p % P;
		if(!(p == 2 && q >= 3) && (em&1)==1)ret = (P-ret) % P;
		return ret;
	}
	void run(){
		ll MOD = 1<<21;
		facts = vector<ll>(MOD+1,1);
		for(int i:range(1,MOD+1)){
			if(i%2 == 0){
				facts[i] = facts[i-1];
			}else{
				facts[i] = facts[i-1] * i %MOD;
			}
		}
		fact_invs = vector<ll>(MOD+1,1);
		for(int i:range(MOD+1)){
			ll p = MOD/2*(2-1)-1;
			ll mul = facts[i];
			while(p){
				if(p&1) fact_invs[i] = (fact_invs[i]*mul)% MOD;
				mul *= mul, mul%=MOD;
				p >>= 1;
			}
		}

		int T;cin >> T;
		for(int t:range(T)){
			ll A,B,C;cin >> A >> B >> C;
			if(C%2 == 0){
				cout << 0 << endl;
				continue;
			}
			// cerr << nCr(B+C-1,B,2,21) << endl;
			ll uv = (A-1+C*nCr(B+C-1,B,2,21)%MOD)%MOD;
			cout << ((~uv & A) == 0) << endl;
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}
0