提出 #43740264

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 2e5 + 5;

int n, m, q, x[N], y[N], a[N], b[N], c[N], d[N], e[N], f[N];

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	
	for(int i=1; i<=n; i++)
		cin >> x[i] >> y[i];
	
	cin >> m;
	a[0] = 1, e[0] = 1;
	for(int i=1; i<=m; i++)
	{
		int opt, p; cin >> opt;
		if(opt == 1) a[i] = d[i-1], b[i] = e[i-1], c[i] = f[i-1], d[i] = -a[i-1], e[i] = -b[i-1], f[i] = -c[i-1];
		if(opt == 2) a[i] = -d[i-1], b[i] = -e[i-1], c[i] = -f[i-1], d[i] = a[i-1], e[i] = b[i-1], f[i] = c[i-1];
		if(opt == 3) cin >> p, a[i] = -a[i-1], b[i] = -b[i-1], c[i] = 2 * p - c[i-1], d[i] = d[i-1], e[i] = e[i-1], f[i] = f[i-1];
		if(opt == 4) cin >> p, d[i] = -d[i-1], e[i] = -e[i-1], f[i] = 2 * p - f[i-1], a[i] = a[i-1], b[i] = b[i-1], c[i] = c[i-1];
	}
	
	cin >> q;
	
	while(q--) {
		int A, B; cin >> A >> B; 
		cout << a[A] * x[B] + b[A] * y[B] + c[A] << " " << d[A] * x[B] + e[A] * y[B] + f[A] << "\n";
	}
	
	return 0;
}

提出情報

ジャッジ結果