結果
| 問題 | No.1558 Derby Live |
| ユーザー |
 unyon_maru65536
|
| 提出日時 | 2021-06-25 23:15:19 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 23,212 bytes |
| コンパイル時間 | 5,614 ms |
| コンパイル使用メモリ | 291,952 KB |
| 実行使用メモリ | 348,716 KB |
| 最終ジャッジ日時 | 2023-09-07 15:02:05 |
| 合計ジャッジ時間 | 12,609 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
コンパイルメッセージ
main.cpp:554:32: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’
554 | void edge_update(int s,auto g){
| ^~~~
main.cpp:574:34: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’
574 | bool try_reconnect(int s,auto f){
| ^~~~
ソースコード
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#pragma region Macros
// rep macro
#define foa(v, a) for(auto &v : a)
#define REPname(a, b, c, d, e, ...) e
#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int i = 0; i < (x); ++i)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))
#define REPSname(a, b, c, ...) c
#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)
#define REPS0(x) for(int i = 1; i <= (x); ++i)
#define REPS1(i, x) for(int i = 1; i <= (x); ++i)
#define RREPname(a, b, c, d, e, ...) e
#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define RREP0(x) for(int i = (x)-1; i >= 0; --i)
#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)
#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))
#define RREPSname(a, b, c, ...) c
#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)
#define RREPS0(x) for(int i = (x); i >= 1; --i)
#define RREPS1(i, x) for(int i = (x); i >= 1; --i)
// name macro
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T = int>
using VVV = std::vector<std::vector<std::vector<T>>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
using Tp = tuple<ll,ll,ll>;
// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for(T &i : v) is >> i;
return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
std::string s;
is >> s;
__int128_t ret = 0;
for(int i = 0; i < s.length(); i++)
if('0' <= s[i] and s[i] <= '9')
ret = 10 * ret + s[i] - '0';
a = ret * (s[0] == '-' ? -1 : 1);
return is;
}
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
scan(head);
INPUT(tail...);
}
} // namespace scanner
#define VEC(type, name, size) \
std::vector<type> name(size); \
scanner::INPUT(name)
#define VVEC(type, name, h, w) \
std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
scanner::INPUT(name)
#define INT(...) \
int __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define STR(...) \
std::string __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...) \
double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
for(int i = 0; i < int(a.size()); ++i) {
if(i) os << " ";
os << a[i];
}
return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
std::ostream::sentry s(dest);
if(s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while(tmp != 0);
if(value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if(dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
std::cout << H << ' ';
print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
for(const auto &v : a)
std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
std::cout << H << '\n';
printel(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "No\n"; }
void err(const bool b = true) {
if(b) {
std::cout << "-1\n", exit(0);
}
}
//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
std::cerr << "{ ";
for(const auto &v : a) {
std::cerr << v << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
std::cerr << "{\n";
for(const auto &v : a) {
std::cerr << "\t";
view(v);
std::cerr << "\n";
}
std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
std::cerr << "{\n";
for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
std::cerr << "{\n";
for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
std::cerr << "{ ";
for(auto &v : s) {
view(v);
std::cerr << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const T &e) { std::cerr << e; }
} // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
debugger::view(H);
std::cerr << ", ";
debug_out(T...);
}
#define debug(...) \
do { \
std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
debug_out(__VA_ARGS__); \
std::cerr << "\b\b]\n"; \
} while(false)
#else
#define debug(...) (void(0))
#endif
// vector macro
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
std::sort(a.begin(), a.end());
a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
auto res = a;
UNIQUE(res);
for(auto &v : a)
v = lb(res, v);
return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a) std::sort((a).begin(), (a).end())
#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x) {
for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
for(auto &v : a) v -= x;
}
template <class T>
void MUL(std::vector<T> &a, const T x) {
for(auto &v : a) v *= x;
}
template <class T>
void DIV(std::vector<T> &a, const T x) {
for(auto &v : a) v /= x;
}
// math macro
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
T ret = 1;
while(n) {
if(n & 1) ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template<typename T>
T ADD(T a, T b){
T res;
return __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
template<typename T>
T MUL(T a, T b){
T res;
return __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
// modpow
long long POW(long long a, long long n, const int mod) {
long long ret = 1;
while(n) {
if(n & 1) (ret *= a) %= mod;
(a *= a) %= mod;
n >>= 1;
}
return ret;
}
// others
struct fast_io {
fast_io() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
}
} fast_io_;
#pragma endregion
using R = long double;
constexpr R EPS=1E-11;
// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.
int sgn(const R& r){ return (r > EPS) - (r < -EPS); }
// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.
int sgn(const R& a, const R &b){ return sgn(a-b); }
// a > 0 は sgn(a) > 0
// a < b は sgn(a, b) < 0
// a >= b は sgn(a, b) >= 0
// のように書く.
// return s * 10^n
//https://atcoder.jp/contests/abc191/submissions/20028529
long long x10(const string& s, size_t n) {
if (s.front() == '-') return -x10(s.substr(1), n);
auto pos = s.find('.');
if (pos == string::npos) return stoll(s + string(n, '0'));
return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));
}
long long ceildiv(long long a, long long b) {
if (b < 0) a = -a, b = -b;
if (a >= 0) return (a + b - 1) / b;
else return a / b;
}
long long floordiv(long long a, long long b) {
if (b < 0) a = -a, b = -b;
if (a >= 0) return a / b;
else return (a - b + 1) / b;
}
long long floorsqrt(long long x) {
assert(x >= 0);
long long ok = 0;
long long ng = 1;
while (ng * ng <= x) ng <<= 1;
while (ng - ok > 1) {
long long mid = (ng + ok) >> 1;
if (mid * mid <= x) ok = mid;
else ng = mid;
}
return ok;
}
inline int topbit(unsigned long long x){
return x?63-__builtin_clzll(x):-1;
}
inline int popcount(unsigned long long x){
return __builtin_popcountll(x);
}
inline int parity(unsigned long long x){//popcount%2
return __builtin_parity(x);
}
const int inf = 1e9;
const ll INF = 1e18;
template<typename T>
class dynamic_connectivity{
class euler_tour_tree{
public:
struct node;
using np=node*;
using lint=long long;
struct node{
np ch[2]={nullptr,nullptr};
np p=nullptr;
int l,r,sz;
T val=et,sum=et;
bool exact;
bool child_exact;
bool edge_connected=0;
bool child_edge_connected=0;
node(){}
node(int l,int r):l(l),r(r),sz(l==r),exact(l<r),child_exact(l<r){}
bool is_root() {
return !p;
}
};
vector<unordered_map<int,np>>ptr;
np get_node(int l,int r){
if(ptr[l].find(r)==ptr[l].end())ptr[l][r]=new node(l,r);
return ptr[l][r];
}
np root(np t){
if(!t)return t;
while(t->p)t=t->p;
return t;
}
bool same(np s,np t){
if(s)splay(s);
if(t)splay(t);
return root(s)==root(t);
}
np reroot(np t){
auto s=split(t);
return merge(s.second,s.first);
}
pair<np,np> split(np s){
splay(s);
np t=s->ch[0];
if(t)t->p=nullptr;
s->ch[0]=nullptr;
return {t,update(s)};
}
pair<np,np> split2(np s){
splay(s);
np t=s->ch[0];
np u=s->ch[1];
if(t)t->p=nullptr;
s->ch[0]=nullptr;
if(u)u->p=nullptr;
s->ch[1]=nullptr;
return {t,u};
}
tuple<np,np,np> split(np s,np t){
auto u=split2(s);
if(same(u.first,t)){
auto r=split2(t);
return make_tuple(r.first,r.second,u.second);
}else{
auto r=split2(t);
return make_tuple(u.first,r.first,r.second);
}
}
template<typename First, typename... Rest>
np merge(First s,Rest... t){
return merge(s,merge(t...));
}
np merge(np s,np t){
if(!s)return t;
if(!t)return s;
while(s->ch[1])s=s->ch[1];
splay(s);
s->ch[1]=t;
if(t)t->p=s;
return update(s);
}
int size(np t){return t?t->sz:0;}
np update(np t){
t->sum=et;
if(t->ch[0])t->sum=fn(t->sum,t->ch[0]->sum);
if(t->l==t->r)t->sum=fn(t->sum,t->val);
if(t->ch[1])t->sum=fn(t->sum,t->ch[1]->sum);
t->sz=size(t->ch[0])+(t->l==t->r)+size(t->ch[1]);
t->child_edge_connected=(t->ch[0]?t->ch[0]->child_edge_connected:0)|(t->edge_connected)|(t->ch[1]?t->ch[1]->child_edge_connected:0);
t->child_exact=(t->ch[0]?t->ch[0]->child_exact:0)|(t->exact)|(t->ch[1]?t->ch[1]->child_exact:0);
return t;
}
void push(np t){
//遅延評価予定
}
void rot(np t,bool b){
np x=t->p,y=x->p;
if((x->ch[1-b]=t->ch[b]))t->ch[b]->p=x;
t->ch[b]=x,x->p=t;
update(x);update(t);
if((t->p=y)){
if(y->ch[0]==x)y->ch[0]=t;
if(y->ch[1]==x)y->ch[1]=t;
update(y);
}
}
void splay(np t){
push(t);
while(!t->is_root()){
np q=t->p;
if(q->is_root()){
push(q), push(t);
rot(t,q->ch[0]==t);
}else{
np r=q->p;
push(r), push(q), push(t);
bool b=r->ch[0]==q;
if(q->ch[1-b]==t)rot(q,b),rot(t,b);
else rot(t,1-b),rot(t,b);
}
}
}
public:
euler_tour_tree(){}
euler_tour_tree(int sz){
ptr.resize(sz);
for(int i=0;i<sz;i++)ptr[i][i]=new node(i,i);
}
int size(int s){
np t=get_node(s,s);
splay(t);
return t->sz;
}
bool same(int s,int t){
return same(get_node(s,s),get_node(t,t));
}
void set_size(int sz){
ptr.resize(sz);
for(int i=0;i<sz;i++)ptr[i][i]=new node(i,i);
}
void update(int s,T x){
np t=get_node(s,s);
splay(t);
t->val=fn(t->val,x);
update(t);
}
void edge_update(int s,auto g){
np t=get_node(s,s);
splay(t);
function<void(np)>dfs=[&](np t){
assert(t);
if(t->l<t->r&&t->exact){
splay(t);
t->exact=0;
update(t);
g(t->l,t->r);
return;
}
if(t->ch[0]&&t->ch[0]->child_exact)dfs(t->ch[0]);
else dfs(t->ch[1]);
};
while(t&&t->child_exact){
dfs(t);
splay(t);
}
}
bool try_reconnect(int s,auto f){
np t=get_node(s,s);
splay(t);
function<bool(np)>dfs=[&](np t)->bool{
assert(t);
if(t->edge_connected){
splay(t);
return f(t->l);
}
if(t->ch[0]&&t->ch[0]->child_edge_connected)return dfs(t->ch[0]);
else return dfs(t->ch[1]);
};
while(t->child_edge_connected){
if(dfs(t))return 1;
splay(t);
}
return 0;
}
void edge_connected_update(int s,bool b){
np t=get_node(s,s);
splay(t);
t->edge_connected=b;
update(t);
}
bool link(int l,int r){
if(same(l,r))return 0;
merge(reroot(get_node(l,l)),get_node(l,r),reroot(get_node(r,r)),get_node(r,l));
return 1;
}
bool cut(int l,int r){
if(ptr[l].find(r)==ptr[l].end())return 0;
np s,t,u;
tie(s,t,u)=split(get_node(l,r),get_node(r,l));
merge(s,u);
np p=ptr[l][r];
np q=ptr[r][l];
ptr[l].erase(r);
ptr[r].erase(l);
delete p;delete q;
return 1;
}
T get_sum(int p,int v){
cut(p,v);
np t=get_node(v,v);
splay(t);
T res=t->sum;
link(p,v);
return res;
}
T get_sum(int s){
np t=get_node(s,s);
splay(t);
return t->sum;
}
};
int dep=1;
vector<euler_tour_tree> ett;
vector<vector<unordered_set<int>>>edges;
int sz;
public:
dynamic_connectivity(int sz):sz(sz){
ett.emplace_back(sz);
edges.emplace_back(sz);
}
bool link(int s,int t){
if(s==t)return 0;
if(ett[0].link(s,t))return 1;
edges[0][s].insert(t);
edges[0][t].insert(s);
if(edges[0][s].size()==1)ett[0].edge_connected_update(s,1);
if(edges[0][t].size()==1)ett[0].edge_connected_update(t,1);
return 0;
}
bool same(int s,int t){
return ett[0].same(s,t);
}
int size(int s){
return ett[0].size(s);
}
vector<int>get_vertex(int s){
return ett[0].vertex_list(s);
}
void update(int s,T x){
ett[0].update(s,x);
}
T get_sum(int s){
return ett[0].get_sum(s);
}
bool cut(ll s,ll t){
if(s==t)return 0;
for(int i=0;i<dep;i++){
edges[i][s].erase(t);
edges[i][t].erase(s);
if(edges[i][s].size()==0)ett[i].edge_connected_update(s,0);
if(edges[i][t].size()==0)ett[i].edge_connected_update(t,0);
}
for(int i=dep-1;i>=0;i--){
if(ett[i].cut(s,t)){
if(dep-1==i){
dep++;
ett.emplace_back(sz);
edges.emplace_back(sz);
}
return !try_reconnect(s,t,i);
}
}
return 0;
}
bool try_reconnect(int s,int t,int k){
for(int i=0;i<k;i++){
ett[i].cut(s,t);
}
for(int i=k;i>=0;i--){
if(ett[i].size(s)>ett[i].size(t))swap(s,t);
auto g=[&](int s,int t){ett[i+1].link(s,t);};
ett[i].edge_update(s,g);
auto f=[&](int x)->bool{
for(auto itr=edges[i][x].begin();itr!=edges[i][x].end();){
auto y=*itr;
itr=edges[i][x].erase(itr);
edges[i][y].erase(x);
if(edges[i][x].size()==0)ett[i].edge_connected_update(x,0);
if(edges[i][y].size()==0)ett[i].edge_connected_update(y,0);
if(ett[i].same(x,y)){
edges[i+1][x].insert(y);
edges[i+1][y].insert(x);
if(edges[i+1][x].size()==1)ett[i+1].edge_connected_update(x,1);
if(edges[i+1][y].size()==1)ett[i+1].edge_connected_update(y,1);
}else{
for(int j=0;j<=i;j++){
ett[j].link(x,y);
}
return 1;
}
}
return 0;
};
if(ett[i].try_reconnect(s,f))return 1;
}
return 0;
}
constexpr static T et=T();
constexpr static T fn(T s,T t){
return s+t;
}
};
void main_() {
LL(N,M,Q);
dynamic_connectivity<ll> dc((int)(Q+1)*N);
ll id = 0;
V<ll> num(M+1);
VV<ll> link1(M+1,V<ll>(N));
REP(i,N){
link1[1][i] = i;
}
num[0] = 0;
REP(i,Q){
LL(t);
if(t == 1){
LL(D);
VEC(ll,P,N);
ll pre = num[D-1];
ll suf = -1;
if(D < M && num[D+1] != 0)suf = num[D+1];
ll now = num[D];
REP(j,N){
REP(k,N){
if(now == 0)break;
ll bf = pre * N + j;
ll cur = now * N + k;
if(dc.same(bf,cur))dc.cut(bf,cur);
if(D < M && suf != -1){
ll af = suf * N + j;
if(dc.same(af,cur))dc.cut(af,cur);
}
}
}
id++;
num[D] = id;
REP(j,N){
ll idx = N * id + P[j] - 1;
ll bf = N * pre + j;
dc.link(bf,idx);
}
link1[D] = P;
if(D < M && suf != -1){
REP(j,N){
ll idx = N * id + j;
ll af = N * suf + link1[D+1][j]-1;
dc.link(idx,af);
}
}
}
if(t == 2){
LL(S);
ll idx = num[S];
V<ll> ans(N);
REP(j,N){
REP(k,N){
ll now = idx * N + j;
if(dc.same(now,k)){
ans[j] = k + 1;
break;
}
}
}
REP(j,N){
if(j)cout << " ";
cout << ans[j];
}
cout << endl;
}
if(t == 3){
LL(L,R);
L--;
ll ans = 0;
ll idx1 = num[L];
ll idx2 = num[R];
REP(j,N){
REP(k,N){
ll bf = idx1 * N + j;
ll af = idx2 * N + k;
if(dc.same(bf,af)){
ans += abs(k - j);
break;
}
}
}
cout << ans << endl;
}
}
}
int main() {
int t = 1;
//cin >> t;
while(t--) main_();
return 0;
}