#395986 (C++14) No.916 Encounter On A Tree

提出ソース

結果

問題	No.916 Encounter On A Tree
ユーザー	sntea
提出日時	2019-11-06 23:25:42
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	14 ms / 2,000 ms
コード長	5,563 bytes
コンパイル時間	1,986 ms
コンパイル使用メモリ	178,640 KB
実行使用メモリ	11,392 KB
最終ジャッジ日時	2024-09-15 00:29:03
合計ジャッジ時間	4,176 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	14 ms 11,264 KB
testcase_03	AC	13 ms 11,392 KB
testcase_04	AC	14 ms 11,392 KB
testcase_05	AC	13 ms 11,264 KB
testcase_06	AC	13 ms 11,392 KB
testcase_07	AC	14 ms 11,392 KB
testcase_08	AC	3 ms 5,376 KB
testcase_09	AC	5 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	14 ms 11,264 KB
testcase_13	AC	14 ms 11,264 KB
testcase_14	AC	14 ms 11,264 KB
testcase_15	AC	14 ms 11,392 KB
testcase_16	AC	5 ms 5,376 KB
testcase_17	AC	13 ms 11,264 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	14 ms 11,264 KB
testcase_20	AC	13 ms 11,392 KB
testcase_21	AC	13 ms 11,264 KB
testcase_22	AC	14 ms 11,264 KB
testcase_23	AC	13 ms 11,264 KB
testcase_24	AC	13 ms 11,392 KB
testcase_25	AC	14 ms 11,392 KB
testcase_26	AC	8 ms 7,168 KB
testcase_27	AC	7 ms 7,296 KB
testcase_28	AC	5 ms 5,376 KB
testcase_29	AC	14 ms 11,264 KB
testcase_30	AC	14 ms 11,392 KB
testcase_31	AC	13 ms 11,392 KB
testcase_32	AC	14 ms 11,264 KB
testcase_33	AC	8 ms 7,168 KB
testcase_34	AC	5 ms 5,376 KB
testcase_35	AC	3 ms 5,376 KB
testcase_36	AC	13 ms 11,392 KB
testcase_37	AC	13 ms 11,264 KB
testcase_38	AC	5 ms 5,376 KB
testcase_39	AC	13 ms 11,264 KB
testcase_40	AC	14 ms 11,264 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	2 ms 5,376 KB
testcase_43	AC	2 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	4 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB
testcase_48	AC	2 ms 5,376 KB
testcase_49	AC	2 ms 5,376 KB
testcase_50	AC	2 ms 5,376 KB
testcase_51	AC	2 ms 5,376 KB
testcase_52	AC	2 ms 5,376 KB
testcase_53	AC	2 ms 5,376 KB
testcase_54	AC	2 ms 5,376 KB
testcase_55	AC	2 ms 5,376 KB
testcase_56	AC	2 ms 5,376 KB
testcase_57	AC	2 ms 5,376 KB
testcase_58	AC	2 ms 5,376 KB
testcase_59	AC	2 ms 5,376 KB
testcase_60	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		x %= mod;
		this->x = x < 0 ? x+mod : x;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;}
typedef ModInt<1000000007> mint;



class ConvQuery {
	vector<mint> fac;
	vector<mint> facinv;

public:
	
	ConvQuery(int n) {
		fac = vector<mint>(n+1);
		facinv = vector<mint>(n+1);
		fac[0] = 1;
		facinv[0] = 1;
		for(int i = 0; i < n; ++i) {
			fac[i+1] = fac[i]*(i+1);
			facinv[i+1] = fac[i+1].inverse();
		}
	}

	mint operator()(int n, int m) {
		if(n >= 0 and 0 <= m and m <= n) return fac[n]*facinv[n-m]*facinv[m];
		else return 0;
	}
};


int main()
{
	ios_init();
	int d, l, r, k;
	while(cin >> d >> l >> r >> k) {
		int ld = 0;
		int t = l;
		while(t > 0) {
			t /= 2;
			ld++;
		}

		int rd = 0;
		t = r;
		while(t > 0) {
			t /= 2;
			rd++;
		}

		vector<mint> fact(1<<d);
		fact[0] = 1;
		REP(i, SZ(fact) - 1) fact[i+1] = fact[i] * (i + 1);

		DEBUG(ld); DEBUG(rd);
		mint ans = 0;
		int cand = (1<<(rd - 2));
		REP(i, ld - 1) {
			DEBUG(i);
			int di = (ld - i - 1) * 2 + (rd - ld);
			DEBUG(di);
			if(di == k) {
				DEBUG(cand);
				mint x = cand;
				// DEBUG(ld); DEBUG(rd);
				// if(rd != ld){
				// 	x = cand;
				//  } else {
				//  	x = cand;
				//  }
				int num = 1;
				REP(j, d) {
					int a = num;
					if(j + 1 == ld) a--;
					if(j + 1 == rd) a--;
					DEBUG(fact[a]);
					x *= fact[a];
					num *= 2;
				}
				ans += x * (1 << (ld - 1));
				DEBUG((1 << (ld - 1)));
				DEBUG(x);
				DEBUG(ans);
			}
			// cand--;
			cand /= 2;
		}
		if(ld != rd){
			int di = rd - ld;
			int cand = 1<< (rd - ld);
			if(di == k) {
				DEBUG(cand);
				mint x = cand;
				int num = 1;
				REP(j, d) {
					int a = num;
					if(j + 1 == ld) a--;
					if(j + 1 == rd) a--;
					DEBUG(fact[a]);
					x *= fact[a];
					num *= 2;
				}
				ans += x * (1 << (ld - 1));
				DEBUG((1 << (ld - 1)));
				DEBUG(x);
				DEBUG(ans);
			}
		}

		cout << ans << endl;
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード