結果
| 問題 | No.3732 Labyrinth Maker |
| コンテスト | |
| ユーザー |
 mtsd
|
| 提出日時 | 2026-09-19 15:57:27 |
| 言語 | C++23(gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 84 ms / 2,000 ms |
| + 837µs | |
| コード長 | 12,349 bytes |
| 記録 | |
| コンパイル時間 | 2,623 ms |
| コンパイル使用メモリ | 363,044 KB |
| 実行使用メモリ | 11,264 KB |
| 最終ジャッジ日時 | 2026-09-19 15:57:59 |
| 合計ジャッジ時間 | 28,427 ms |
|
ジャッジサーバーID （参考情報） |
judge1_1 / judge4_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 59 |
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:327:22: warning: 'L' may be used uninitialized [-Wmaybe-uninitialized]
327 | for(int j=L;j<R;j++){
| ~^~
main.cpp:314:13: note: 'L' was declared here
314 | int L,R;
| ^
main.cpp:327:22: warning: 'R' may be used uninitialized [-Wmaybe-uninitialized]
327 | for(int j=L;j<R;j++){
| ~^~
main.cpp:314:15: note: 'R' was declared here
314 | int L,R;
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)(n)-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<class T, class U>
ostream& operator<<(ostream& os, const pair<T,U>& pair_var);
template<class T>
ostream& operator<<(ostream& os, const vector<T>& vec);
template<class K, class V>
ostream& operator<<(ostream& os, const map<K,V>& map_var);
template<class T>
ostream& operator<<(ostream& os, const set<T>& set_var);
template<class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t);
template<class T, class C, class Comp>
ostream& operator<<(ostream&, priority_queue<T,C,Comp>);
template<class T, class C>
ostream& operator<<(ostream&, queue<T,C>);
template<class T, class C>
ostream& operator<<(ostream&, stack<T,C>);
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
os << "{";
for (int i = 0; i<(int)vec.size(); i++) {
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, const map<T, U>& map_var) {
os << "{";
for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, const set<T>& set_var) {
os << "{";
for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
os << (*itr);
++itr;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// tuple 出力
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
if(N)os<<", ";
os<<get<N>(t);
out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
os<<"(";
out<0,tuple<Ts...>,Ts...>(os,t);
os<<")";
return os;
}
// priority_queue 出力
template<class T, class C, class Comp>
ostream& operator<<(ostream& os, priority_queue<T,C,Comp> pq){
os << "{";
bool first=true;
while(!pq.empty()){
if(!first) os << ", ";
first=false;
os << pq.top();
pq.pop();
}
return os << "}";
}
// queue 出力
template<class T, class C>
ostream& operator<<(ostream& os, queue<T,C> q){
os << "{";
bool first=true;
while(!q.empty()){
if(!first) os << ", ";
first=false;
os << q.front();
q.pop();
}
return os << "}";
}
// stack 出力
template<class T, class C>
ostream& operator<<(ostream& os, stack<T,C> st){
os << "{";
bool first=true;
while(!st.empty()){
if(!first) os << ", ";
first=false;
os << st.top();
st.pop();
}
return os << "}";
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
for (auto& a : array) {
fill(a, val);
}
}
template <typename T, typename S> T ceil(T x, S y) {
assert(y);
return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
template <typename T, typename S> T floor(T x, S y) {
assert(y);
return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto e : a) v.emplace_back(e);
fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto &&e : a) e = lb(v, e);
renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
vector<S> v;
fold_in(v, head, args...);
sort(all(v)), v.erase(unique(all(v)), v.end());
renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
template <class T, class F> T bin_search(T ok, T ng, const F &f) {
while(abs(ok - ng) > 1) {
T mid = ok + ng >> 1;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {
while(iter--) {
T mid = (ok + ng) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class F> struct REC {
F f;
REC(F &&f_) : f(std::forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }
};
#include<cassert>
void solve(){
INT(n);
VV(int,a,n,n);
ll S = 0;
rep(i,n)S += SUM(a[i]);
if(S%n!=0){
cout << -1 << "\n";
return;
}
vv(int,res,n,n);
vector<int> t(n);
int c = 1;
rep(i,n){
if(i==n-1){
rep(j,n){
for(int k=t[j];k<n;k++){
res[k][j] = c;
}
}
break;
}
vector<int> s(n+1);
rep(j,n){
s[j+1]= a[i][j]+s[j];
s[j+1]%=n;
}
vector<int> p(n,-1);
int L,R;
rep(j,n+1){
if(p[s[j]]!=-1){
L = p[s[j]];
R = j;
break;
}else{
p[s[j]] = j;
}
}
dbg(s);
dbg(L,R,s[L],s[R]);
//[L,R] を利用
for(int j=L;j<R;j++){
for(int k=t[j];k<=i;k++){
res[k][j] = c;
a[k][j] = 0;
}
t[j] = i+1;
}
c++;
if(i!=n-1){
rep(j,n){
a[i+1][j] += a[i][j];
a[i+1][j] %= n;
}
}
}
rep(i,n){
rep(j,n){
cout << res[i][j] << " \n"[j==n-1];
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
INT(T);
rep(zz,T)solve();
return 0;
}