結果
問題 | No.1558 Derby Live |
ユーザー |
![]() |
提出日時 | 2021-06-25 22:13:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 165 ms / 2,000 ms |
コード長 | 2,684 bytes |
コンパイル時間 | 2,648 ms |
コンパイル使用メモリ | 205,536 KB |
最終ジャッジ日時 | 2025-01-22 12:19:57 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:92:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 92 | scanf("%d%d%d", &n, &m, &q); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:96:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 96 | scanf("%d", &t); | ~~~~~^~~~~~~~~~ main.cpp:99:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 99 | scanf("%d", &d); | ~~~~~^~~~~~~~~~ main.cpp:103:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 103 | scanf("%d", &tmp[i]); | ~~~~~^~~~~~~~~~~~~~~ main.cpp:109:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 109 | scanf("%d", &s); | ~~~~~^~~~~~~~~~ main.cpp:117:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 117 | scanf("%d%d", &l, &r); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#include <atcoder/segtree>#define For(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)#define rFor(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)#define rep(i, n) For((i), 0, (n))#define rrep(i, n) rFor((i), (n), 0)#define fi first#define se secondusing namespace std;typedef long long lint;typedef unsigned long long ulint;typedef pair<int, int> pii;typedef pair<lint, lint> pll;template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}template <typename T>struct coord_comp {vector<T> v;bool sorted = false;coord_comp() {}int size() { return v.size(); }void add(T x) { v.push_back(x); }void build() {sort(v.begin(), v.end());v.erase(unique(v.begin(), v.end()), v.end());sorted = true;}int get_idx(T x) {assert(sorted);return lower_bound(v.begin(), v.end(), x) - v.begin();}T &operator[](int i) { return v[i]; }};constexpr lint mod = 1000000007;constexpr lint INF = mod * mod;constexpr int MAX = 100010;using namespace atcoder;int n, m, q;vector<int> op(vector<int> a, vector<int> b) {rep(i, a.size()) a[i] = b[a[i]];return a;}vector<int> e() {vector<int> ret(n, 0);iota(ret.begin(), ret.end(), 0);return ret;}int main() {scanf("%d%d%d", &n, &m, &q);segtree<vector<int>, op, e> st(vector<vector<int>>(m, e()));rep(_, q) {int t;scanf("%d", &t);if (t == 1) {int d;scanf("%d", &d);--d;vector<int> tmp(n);rep(i, n) {scanf("%d", &tmp[i]);--tmp[i];}st.set(d, tmp);} else if (t == 2) {int s;scanf("%d", &s);auto tmp = st.prod(0, s);vector<int> ans(n);rep(i, n) ans[tmp[i]] = i;for (auto x : ans) printf("%d ", x + 1);printf("\n");} else {int l, r;scanf("%d%d", &l, &r);--l;auto tmp = st.prod(l, r);int ans = 0;rep(i, n) ans += abs(i - tmp[i]);printf("%d\n", ans);}}}