Submission #36194066

---

Source Code Expand

#include <bits/stdc++.h>
namespace // to fold that junk code
{
#define filein(x) {freopen(x".in", "r", stdin);}
#define file(x) {freopen(x".in", "r", stdin); freopen(x".out", "w", stdout);}
#define files(x) {freopen(x".in", "r", stdin); freopen(x".ans", "w", stdout);}
#define mem(x, a) memset(x, a, sizeof x);
#define cls(x) mem(x, 0)
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
template <typename T>
inline bool separate(cT l, cT r, cT L, cT R){return (R < l) || (L > r);}
template <typename T>
inline T sqr(cT _){return _ * _;}
template <typename T>
inline T read(){T x; cin >> x; return x;}
template <typename T1, typename T2>
inline pair<T1, T2> read(){T1 x; T2 y; cin >> x >> y; return make_pair(x, y);}
template <typename T>
inline void clear(T& q){typename remove_reference<decltype(q)> :: type _; swap(q, _);} // remove_reference_t is since C++14
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
template <typename T>
using pr = pair<T, T>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T1, typename T2 = unsigned>
using umap = unordered_map<T1, T2>;
template <typename T1, typename T2 = unsigned>
using uset = unordered_set<T1, T2>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd;
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "Yes" : "No");}
}
const int N = (1 << 18) + 233, P = 998244353;
inline void fstmod(int& x){if (x >= P) x -= P;}
struct matrix
{
	int a[2][2];
	matrix(int a=0, int b=0, int c=0, int d=0) : a{{a,b},{c,d}}{}
	int* operator[](const int& i){return a[i];}
	const int* operator[](const int& i) const {return a[i];}
	inline matrix operator * (const matrix& rhs) const
	{
		matrix ans;
		for (int i=0; i<2; i++)
			for (int k=0; k<2; k++)
				for (int j=0; j<2; j++) fstmod(ans[i][j] += 1ll * a[i][k] * rhs[k][j] % P);
		return ans;
	}
	inline matrix& operator *= (const matrix rhs){return *this = *this * rhs;}
}M[2]{matrix(1, 0, 1, 1), matrix(1, 1, 0, 1)}, id(1, 0, 0, 1);
int n, q, a[N];
vi v[N];
int main()
{
	scanf("%d%d", &n, &q); int m = 1 << n;
	for (int i=0; i<m; i++) scanf("%d", a+i);
	for (int i=1, x, y; i<=q; i++){scanf("%d%d", &x, &y); v[x].emplace_back(y);}
	for (int i=0; i<n; i++) reverse(v[i].begin(), v[i].end());
	for (int i=0; i<n; i++)
	{
		matrix now(id);
		for (int x : v[i]) now *= M[x];
		for (int j=0; j<m; j++)
			if (j >> i & 1)
			{
				matrix tmp(a[j ^ (1 << i)], 0, a[j], 0); tmp = now * tmp;
				a[j ^ (1 << i)] = tmp[0][0]; a[j] = tmp[1][0];
			}
	}
	for (int i=0; i<m; i++) printf("%d ", a[i]);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:73:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   73 |  scanf("%d%d", &n, &q); int m = 1 << n;
      |  ~~~~~^~~~~~~~~~~~~~~~
./Main.cpp:74:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   74 |  for (int i=0; i<m; i++) scanf("%d", a+i);
      |                          ~~~~~^~~~~~~~~~~
./Main.cpp:75:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   75 |  for (int i=1, x, y; i<=q; i++){scanf("%d%d", &x, &y); v[x].emplace_back(y);}
      |                                 ~~~~~^~~~~~~~~~~~~~~~

Judge Result