結果
| 問題 | No.3506 All Distance is Square Number |
| コンテスト | |
| ユーザー |
 siganai
|
| 提出日時 | 2026-04-19 19:38:58 |
| 言語 | C++17 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 1,609 ms / 2,000 ms |
| コード長 | 9,128 bytes |
| 記録 | |
| コンパイル時間 | 2,585 ms |
| コンパイル使用メモリ | 239,832 KB |
| 実行使用メモリ | 27,788 KB |
| 最終ジャッジ日時 | 2026-04-19 19:39:27 |
| 合計ジャッジ時間 | 20,103 ms |
|
ジャッジサーバーID （参考情報） |
judge1_1 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 29 |
ソースコード
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
// #pragma GCC target("avx,avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + (((b)-(a)-1) / (c) - (((b)-(a)-1) % (c) && (((b)-(a)-1) ^ c) < 0)) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#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__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename U,typename T>
U floor(U a, T b) {return a / b - (a % b && (a ^ b) < 0);}
// ceil(x,y) = floor(x+y-1,y)なのでx+y-1がoverflowする可能性あり
template <typename U,typename T>
U ceil(U x, T y) {return floor(x + y - 1, y);}
template <typename U,typename T>
T bmod(U x, T y) {return x - y * floor(x, y);}
template <typename U,typename T>
pair<U, T> divmod(U x, T y) {U q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
void solve() {
INT(N);
if(N == 2) {
cout << 1 << '\n';
cout << "1 2 1" << '\n';
cout << "1 1\n";
return;
}
else if(N == 3) {
cout << 3 << '\n';
cout << "1 2 16\n";
cout << "2 3 9\n";
cout << "1 3 25\n";
cout << "1 1\n";
cout << "1 3\n";
cout << "1 2\n";
return;
}
int L = 2 * N;
if(N == 4) L = 3 * N;
vi V(L);
rep(i,L) V[i] = i + 1;
std::random_device seed_gen;
std::uint32_t seed = seed_gen();
std::mt19937 engine(seed);
int M = 0;
rep(i,L - N + 1,L + 1) M += i;
auto check = [&](vector<vector<tuple<int,int,int>>> &g) -> bool {
vvi ans;
rep(i,N) {
vvi dp(N,vi(M));
vvi pred(N,vi(M,-1));
dp[i][0] = 1;
rep(j,N-1) {
rep(k,M) {
int cur = (i + j) % N;
int nex = (i + j + 1) % N;
if(dp[cur][k]) {
for(auto &[to,id,val]:g[cur]) {
if(to == nex) {
dp[nex][k + val] = 1;
pred[nex][k + val] = id;
}
}
}
}
}
vvi ep(N,vi(M));
vvi pree(N,vi(M,-1));
ep[i][0] = 1;
rep(j,N-1) {
rep(k,M) {
int cur = (i - j + N) % N;
int nex = (i - j - 1 + N) % N;
if(ep[cur][k]) {
for(auto &[to,id,val]:g[cur]) {
if(to == nex) {
ep[nex][k + val] = 1;
pree[nex][k + val] = id;
}
}
}
}
}
rep(j,i+1,N) {
int flg = 0;
rep(k,1,M) {
if(k * k >= M) break;
if(dp[j][k * k] || ep[j][k * k]) {
vi ids;
int wei = k * k;
int cur = j;
if(dp[j][k * k]) {
while(wei > 0) {
ids.emplace_back(pred[cur][wei]);
wei -= V[pred[cur][wei]];
cur--;
if(cur == -1) cur += N;
}
}
else {
while(wei > 0) {
ids.emplace_back(pree[cur][wei]);
assert(pree[cur][wei] != -1);
wei -= V[pree[cur][wei]];
cur++;
if(cur == N) cur -= N;
}
}
flg = 1;
reverse(all(ids));
ans.emplace_back(ids);
break;
}
}
if(!flg) return false;
}
}
cout << 2 * N - 3 << '\n';
int id = 0;
rep(i,3) {
cout << i + 1 << " " << i + 2 << " " << V[id++] << '\n';
}
rep(i,3,N) {
cout << i + 1 << " " << (i + 1) % N + 1 << " " << V[id++] << '\n';
cout << i + 1 << " " << (i + 1) % N + 1 << " " << V[id++] << '\n';
}
for(auto &v:ans) {
cout << v.size();
rep(i,v.size()) cout << " " << v[i] + 1;
cout << '\n';
}
return true;
};
while(1) {
shuffle(all(V),engine);
vector<vector<tuple<int,int,int>>> g(N);
int id = 0;
rep(i,3) {
g[i+1].emplace_back(i,id,V[id]);
g[i].emplace_back(i+1,id,V[id]);
id++;
}
rep(i,3,N) {
g[(i+1)%N].emplace_back(i,id,V[id]);
g[i].emplace_back((i+1)%N,id,V[id]);
id++;
g[(i+1)%N].emplace_back(i,id,V[id]);
g[i].emplace_back((i+1)%N,id,V[id]);
id++;
}
bool ok = check(g);
if(ok) {
break;
}
}
}
int main() {
//INT(TT);
int TT = 1;
rep(i,TT) solve();
}