結果
問題 | No.474 色塗り2 |
ユーザー |
![]() |
提出日時 | 2019-02-20 19:33:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 543 ms / 2,000 ms |
コード長 | 2,688 bytes |
コンパイル時間 | 1,731 ms |
コンパイル使用メモリ | 169,780 KB |
実行使用メモリ | 50,688 KB |
最終ジャッジ日時 | 2024-11-07 10:21:29 |
合計ジャッジ時間 | 5,682 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 4 |
コンパイルメッセージ
main.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 56 | main(){ | ^~~~
ソースコード
#include <bits/stdc++.h>#include "unistd.h"using namespace std;#define WA cout<<"char134217728";exit(0)#define RE throw#define TLE sleep(1000)#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)#define pb push_back#define mp make_pair#define fi first#define se second#define pcnt __builtin_popcount#define sz(x) (int)(x).size()#define maxs(x,y) x=max(x,y)#define mins(x,y) x=min(x,y)#define show(x) cout<<#x<<" = "<<x<<endl;#define all(a) (a.begin()),(a.end())#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());#define bit(n) (1LL<<(n))#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))#define dout(d) printf("%.12f\n",d)typedef long long ll;typedef __int128_t lll;typedef pair<int,int> pii;typedef pair<ll,ll> pll;template<class T>using V=vector<T>;template<class T>using VV=V<V<T>>;template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}const int IINF = 1e9+6;const ll LINF = 1e18;const int MOD = bit(20);const double PI = acos(-1);const double EPS = 1e-10;static random_device rd;static mt19937 rnd(rd());const int N = 2e6+1;ll fac[N], rfac[N], s2[N];ll comb(int a, int b){ll d = s2[a]-s2[a-b]-s2[b];if(d >= 20) return 0;return (fac[a]*rfac[a-b]*rfac[b] % MOD) << d;}int n;main(){cin.tie(0);ios::sync_with_stdio(false);fac[0] = 1;rfac[0] = 1;FOR(i, 1, N){int z = __builtin_ctz(i);s2[i] = s2[i-1] + z;fac[i] = fac[i-1] * (i>>z) % MOD;rfac[i] = modInv(fac[i], MOD);}cin >> n;FOR(i, 0, n){int a, b, c;cin >> a >> b >> c;if((c&1)==0){printf("0\n");}else{printf("%d\n", ((comb(c+b-1, b)*c-1) & a) == 0);}}}