#886461 (C++17) No.2344 (l+r)^2

• 問題: No.2344 (l+r)^2
• ユーザー: sigma425
• 提出日時: 2023-07-01 02:10:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 280 ms / 2,000 ms
• コード長: 2,784 bytes
• コンパイル時間: 2,096 ms
• コンパイル使用メモリ: 202,228 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 13:25:00
• 合計ジャッジ時間: 2,927 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	280 ms; 5,376 KB
testcase_02	AC	13 ms; 5,376 KB
testcase_03	AC	13 ms; 5,376 KB
testcase_04	AC	14 ms; 5,376 KB
testcase_05	AC	13 ms; 5,376 KB
testcase_06	AC	14 ms; 5,376 KB
testcase_07	AC	9 ms; 5,376 KB
testcase_08	AC	9 ms; 5,376 KB
testcase_09	AC	7 ms; 5,376 KB
testcase_10	AC	10 ms; 5,376 KB
testcase_11	AC	6 ms; 5,376 KB
testcase_12	AC	25 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}

uint solve(){
	int N,M; cin >> N >> M;
	V<uint> A(N); rep(i,N) cin >> A[i];
	// x^2 mod 2^m = (x mod 2^{m-1})^2
	// (m >= 1)
	if(N <= 40){
		rep(t,N-1){
			int n = N-1-t;
			rep(i,n) A[i] = (A[i]+A[i+1])*(A[i]+A[i+1]);
		}
		return A[0]%(1<<M);
	}
	V<uint> B(32);
	rep(i,32){
		// [i,i+N-32]
		int n = N-32;
		rep(j,n+1) if((n&j)==j) B[i] += A[i+j];
	}
	rep(t,31){
		int n = 32-1-t;
		rep(i,n) B[i] = (B[i]+B[i+1])*(B[i]+B[i+1]);
	}
	return B[0]%(1<<M);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int T; cin >> T;
	while(T--) cout << solve() << endl;
}