17822번 원판 돌리기

아흉 어렵다

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <tuple>
using namespace std;
int n, m, t;
void go(vector<vector<int>>& a, int x, int d, int k) {
	if (d == 0) { //시계방향으로 돌려라
		rotate(a[x-1].rbegin(), a[x-1].rbegin() + k, a[x-1].rend());
	}
	else {
		rotate(a[x-1].begin(), a[x-1].begin() + k, a[x-1].end());
	}
}
bool check(vector<vector<int>> &a) {
	bool ch = false;
	vector < vector<int> >d(n, vector<int>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if(a[i][j]==0) continue;
			if (a[i][j] == a[i][(j + 1) % m]) {
				d[i][j] = d[i][(j + 1) % m] = 1;
			}
			if (i + 1 < n && a[i][j] == a[i + 1][j]) {
				d[i][j] = d[i + 1][j] = 1;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (d[i][j] == 1) {
				a[i][j] = 0;
				ch = true;
			}
		}
	}
	return ch;
}
void adjust(vector<vector<int>> &a) {
	int sum = 0;
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (a[i][j] == 0) continue;
			sum += a[i][j];
			cnt++;
		}
	}
	if (cnt == 0) return;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (a[i][j] == 0) continue;
			if (sum < (long long)a[i][j] * cnt) a[i][j]--;
			else if(sum > (long long)a[i][j]*cnt) a[i][j]++;
		}
	}
}

int main() {
	//freopen("in1.txt", "rt", stdin);
	cin >> n >> m >> t;
	vector<vector<int>> a(n, vector<int>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
		}
	}
	while (t--) {
		int x, d, k;
		cin >> x >> d >> k;
		for (int y = x; y <= n; y += x) {
			go(a, y, d, k);
		}
		bool ch = check(a);
		if (ch == false) adjust(a);

	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			ans += a[i][j];
		}
	}
	cout << ans << '\n';
	return 0;
}