結果
問題 | No.1558 Derby Live |
ユーザー |
![]() |
提出日時 | 2021-06-25 22:13:40 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,485 bytes |
コンパイル時間 | 2,004 ms |
コンパイル使用メモリ | 180,160 KB |
実行使用メモリ | 5,632 KB |
最終ジャッジ日時 | 2024-06-25 08:30:48 |
合計ジャッジ時間 | 7,874 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | WA * 33 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>//using namespace atcoder;#pragma GCC target ("avx2")#pragma GCC optimization ("O3")#pragma GCC optimization ("unroll-loops")using namespace std;typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef pair<int, int> pii;typedef pair<long long, long long> PLL;typedef pair<int, PII> TIII;typedef long long ll;typedef long double ld;typedef unsigned long long ull;#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)#define REP(i, n) FOR(i, 0, n)#define rep(i, a, b) for (int i = a; i < (b); ++i)#define trav(a, x) for (auto &a : x)#define all(x) x.begin(), x.end()#define MOD 1000000007template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}const double EPS = 1e-12, PI = acos(-1);const double pi = 3.141592653589793238462643383279;//ここから編集typedef string::const_iterator State;ll GCD(ll a, ll b){return (b==0)?a:GCD(b, a%b);}ll LCM(ll a, ll b){return a/GCD(a, b) * b;}template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< 1000000007 >;template< typename T >struct Combination {vector< T > _fact, _rfact, _inv;Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {_fact[0] = _rfact[sz] = _inv[0] = 1;for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;_rfact[sz] /= _fact[sz];for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];}inline T fact(int k) const { return _fact[k]; }inline T rfact(int k) const { return _rfact[k]; }inline T inv(int k) const { return _inv[k]; }T P(int n, int r) const {if(r < 0 || n < r) return 0;return fact(n) * rfact(n - r);}T C(int p, int q) const {if(q < 0 || p < q) return 0;return fact(p) * rfact(q) * rfact(p - q);}T H(int n, int r) const {if(n < 0 || r < 0) return (0);return r == 0 ? 1 : C(n + r - 1, r);}};ll modpow(ll x, ll n, ll mod) {ll res = 1;while(n) {if(n&1) res = (res * x) % mod;x = (x * x) % mod;n >>= 1;}return res;}inline long long mod(long long a, long long m) {return (a % m + m) % m;}template<typename T>struct Segtree {int n, n_org;T e;vector<T> dat;typedef function<T(T& a, T& b)> Func;Func f;Segtree(){}Segtree(int n_input, Func f_input, T e_input){initialize(n_input, f_input, e_input);}void initialize(int n_input, Func f_input, T e_input){n_org = n_input;f = f_input;e = e_input;n = 1;while(n < n_input) n <<= 1;dat.resize(2*n-1, e);}void update(int k, int x, int y){k += n - 1;dat[k][x] = y;while(k > 0){k = (k - 1)/2;dat[k] = f(dat[2*k+1], dat[2*k+2]);}}T get(int k){return dat[k+n-1];}T between(int a, int b){return query(a, b+1, 0, 0, n);}T query(int a, int b, int k, int l, int r){if(r<=a || b<=l) return e;if(a<=l && r<=b) return dat[k];T vl = query(a, b, 2*k+1, l, (l+r)/2);T vr = query(a, b, 2*k+2, (l+r)/2, r);return f(vl, vr);}};int main(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);int N, M, Q; cin >> N >> M >> Q;using V = array<int, 18>;V E;for(int i=0; i<18; i++) E[i] = i;Segtree<V> st(M, [](V& a, V& b){V c;for(int i=0; i<18; i++) c[i] = b[a[i]];return c;}, E);while(Q--) {int t; cin >> t;if(t == 1) {int D; cin >> D;D--;REP(i,N) {int a; cin >> a; a--;st.update(D, i, a);}}else if(t == 2) {int S; cin >> S;auto res = st.query(0, S, 0, 0, M);vector<int> tmp(N);for(int i=0; i<N; i++) {tmp[res[i]] = i;}for(int i=0; i<N; i++) {if(i) cout << " ";cout << tmp[i] + 1;}cout << '\n';}else{int L, R; cin >> L >> R;auto res1 = st.query(0, L, 0, 0, M);auto res2 = st.query(0, R, 0, 0, M);vector<int> tmp(N), tmp2(N);for(int i=0; i<N; i++) {tmp[res1[i]] = i; // tmp[i] Lをi番目のウマの番号tmp2[res2[i]] = i; // tmp2[i] Rをi番目に抜けたウマの番号}int res = 0;for(int i=0; i<N; i++) {int idx = -1;for(int j=0; j<N; j++) {if(tmp[i] == tmp2[j]) {idx = j;break;}}res += abs(i-idx);}cout << res << '\n';}}return 0;}