提出 #51933262

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define pii pair<int, int>
#define piii tuple<int, int, int>
#define pll pair<long long, long long>
#define L(n) (n << 1)
#define R(n) (n << 1 | 1)
#define print_vector(n, delimiter) for(auto a0 : n) cout << a0 << delimiter; cout << endl;
#define vector_sort(n) sort(n.begin(), n.end())
#define print_array(n, l, r, delimiter) for(int a0 = l; a0 <= r; a0++) cout << n[a0] << delimiter; cout << '\n';
#define REP(i, l, r) for (int i = l; i <= r; i++) 
#define VREP(i, l, r) for (int i = l; i >= r; i--) 
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ABS(a) ((a) > 0 ? (a) : -(a))
#define LOG2(n) (31 - __builtin_clz(n))
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

template<class T>
istream & operator >> (istream &in, pair<T, T> &p) {
	in >> p.first >> p.second;
	return in;
}

template<class T>
ostream & operator <<(ostream &out, pair<T, T> &p) {
	out << p.first << ' ' << p.second;
	return out;
}

template<class Tuple, std::size_t N>
struct TuplePrinter {
	static void print(ostream &out, const Tuple& t) {
		TuplePrinter<Tuple, N-1>::print(out, t);
		out << ' ' << get<N-1>(t);
	}
};

template<class Tuple>
struct TuplePrinter<Tuple, 1> {
	static void print(ostream &out, const Tuple& t) {
		out << get<0>(t);
	}
};

template<class... Args>
ostream & operator <<(ostream &out, const tuple<Args...> &p) {
	TuplePrinter<decltype(p), sizeof...(Args)>::print(out, p);
	return out;
}

const int MAX_N = 1e3;

int N, D;
int A[MAX_N + 5][MAX_N + 5];
int B[MAX_N + 5][MAX_N + 5];
int C[MAX_N + 5][MAX_N + 5];

void tryAns(int num) {
	int tot = 0;
	// vector<piii> ans;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			int turun = (B[i][j] + D*4 - num) % (D + D);
			int naik = (num + D*4 - B[i][j]) % (D + D);
			if (turun < naik) {
				C[i][j] = A[i][j] - turun;
				tot += turun;
			} else {
				C[i][j] = A[i][j] + naik;
				tot += naik;
			}
		}
	}
	if (tot <= D * N * N / 2) {
		// cout << ans.size() << "\n";
		// print_vector(ans, '\n');
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) {
				cout << C[i][j] << " ";
			}
			cout << "\n";
		}
		exit(0);
	}
}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin >> N >> D;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			cin >> A[i][j];
			B[i][j] = (A[i][j] + D * (i + j + 10000)) % (D + D);
		}
	}
	tryAns(0);
	tryAns(D);
}

提出情報

ジャッジ結果