結果
問題 | No.812 Change of Class |
ユーザー | shibh308 |
提出日時 | 2019-04-12 22:16:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 637 ms / 4,000 ms |
コード長 | 5,330 bytes |
コンパイル時間 | 2,747 ms |
コンパイル使用メモリ | 210,796 KB |
最終ジャッジ日時 | 2025-01-07 01:52:34 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
8,448 KB |
testcase_01 | AC | 14 ms
6,820 KB |
testcase_02 | AC | 43 ms
6,816 KB |
testcase_03 | AC | 90 ms
9,492 KB |
testcase_04 | AC | 82 ms
8,708 KB |
testcase_05 | AC | 599 ms
9,220 KB |
testcase_06 | AC | 419 ms
8,096 KB |
testcase_07 | AC | 8 ms
6,820 KB |
testcase_08 | AC | 4 ms
6,816 KB |
testcase_09 | AC | 577 ms
9,728 KB |
testcase_10 | AC | 620 ms
9,856 KB |
testcase_11 | AC | 25 ms
6,916 KB |
testcase_12 | AC | 366 ms
9,276 KB |
testcase_13 | AC | 2 ms
6,820 KB |
testcase_14 | AC | 2 ms
6,820 KB |
testcase_15 | AC | 386 ms
7,424 KB |
testcase_16 | AC | 20 ms
6,820 KB |
testcase_17 | AC | 339 ms
7,948 KB |
testcase_18 | AC | 236 ms
6,824 KB |
testcase_19 | AC | 279 ms
7,196 KB |
testcase_20 | AC | 637 ms
9,460 KB |
testcase_21 | AC | 214 ms
6,816 KB |
testcase_22 | AC | 88 ms
6,816 KB |
testcase_23 | AC | 15 ms
6,820 KB |
testcase_24 | AC | 24 ms
6,820 KB |
testcase_25 | AC | 69 ms
6,816 KB |
testcase_26 | AC | 473 ms
8,524 KB |
testcase_27 | AC | 422 ms
7,936 KB |
testcase_28 | AC | 249 ms
7,040 KB |
testcase_29 | AC | 53 ms
6,820 KB |
testcase_30 | AC | 380 ms
7,808 KB |
testcase_31 | AC | 314 ms
7,040 KB |
testcase_32 | AC | 114 ms
6,820 KB |
testcase_33 | AC | 400 ms
8,368 KB |
testcase_34 | AC | 22 ms
6,820 KB |
testcase_35 | AC | 55 ms
6,820 KB |
testcase_36 | AC | 26 ms
6,820 KB |
testcase_37 | AC | 162 ms
6,824 KB |
testcase_38 | AC | 11 ms
6,824 KB |
testcase_39 | AC | 173 ms
6,820 KB |
testcase_40 | AC | 36 ms
6,816 KB |
testcase_41 | AC | 10 ms
6,820 KB |
testcase_42 | AC | 394 ms
7,748 KB |
testcase_43 | AC | 38 ms
6,820 KB |
testcase_44 | AC | 243 ms
6,816 KB |
testcase_45 | AC | 26 ms
6,820 KB |
testcase_46 | AC | 34 ms
6,816 KB |
testcase_47 | AC | 237 ms
6,816 KB |
testcase_48 | AC | 251 ms
7,168 KB |
testcase_49 | AC | 72 ms
6,820 KB |
testcase_50 | AC | 4 ms
6,820 KB |
testcase_51 | AC | 56 ms
6,816 KB |
testcase_52 | AC | 110 ms
6,820 KB |
testcase_53 | AC | 46 ms
6,824 KB |
testcase_54 | AC | 41 ms
6,816 KB |
testcase_55 | AC | 250 ms
8,632 KB |
testcase_56 | AC | 307 ms
10,172 KB |
testcase_57 | AC | 329 ms
10,616 KB |
testcase_58 | AC | 166 ms
7,044 KB |
testcase_59 | AC | 374 ms
11,344 KB |
testcase_60 | AC | 2 ms
6,820 KB |
testcase_61 | AC | 2 ms
6,816 KB |
testcase_62 | AC | 2 ms
6,816 KB |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("O3")#pragma GCC target("tune=native")#pragma GCC target("avx")// #pragma GCC target("avx2")#pragma GCC optimize("unroll-loops")using namespace std;using i64 = int64_t;const i64 MOD = 1e9+7;const i64 INF = 1e18+7;// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10)) のように書くtemplate <typename T = i64>struct Range{struct iterator{T value;const T step, last;const T& operator*(){return value;}iterator(T value, T step, T last) :value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),step(step),last(last){}iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}bool operator!=(const iterator& x){return value != x.value;}};const T start, last, step;Range(const T start, const T last, const T step = static_cast<T>(1)) :start(start),last(last),step(step){}Range(const T last) :start(0),last(last),step(1){}iterator begin(){return iterator(start, step, last);}iterator end(){return iterator(last, step, last);}};// lambda式を用いた再帰template <typename F>struct FixPoint{const F _f;FixPoint(F&& f) : _f(forward<F>(f)){}template<typename... Types>decltype(auto) operator()(Types&&... args) const{return _f(*this, forward<Types>(args)...);}};template <typename F>static decltype(auto) makeRec(F&& f){return FixPoint<F>(forward<F>(f));}// 多次元vectorの一斉初期化 makeVector<i64, 0>(a, b, ...)のように書くtemplate <typename T, T Value = T()>vector<T> makeVector(size_t x){return vector<T>(x, T(Value));}template <typename T, T Value = T(), typename... Types>auto makeVector(size_t x, Types... args){return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));}// 最大値を更新し、更新できた時にはtrueを返すtemplate <typename T = i64>bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}// 同様に最小値を更新するtemplate <typename T = i64>bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}// 行数と変数名、値をclogに表示するデバッグ用print#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;// 同様の配列向けデバッグ用print#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);void _dump(int, string& x){clog << x << endl;}template <typename T>void _dump(bool, T& x){clog << x << " ";}template <typename T, typename U = typename T::iterator>void _dump(int, T& x){for(auto& elm : x)_dump(0, elm);clog << endl;}template <typename T>void _dump_macro(T& x){_dump(0, x);}// input用の関数群void _input(int, string& x){cin >> x;}template <typename T>void _input(bool, T& x){cin >> x;}template <typename T, typename U = typename T::iterator>void _input(int, T& x){for(auto& elm : x)_input(0, elm);}template <typename T>void input_single(T& x){_input(0, x);}auto input(){}template <typename T, typename... Types>void input(T& value, Types&&... args){input_single(value);input(forward<Types>(args)...);};void _pararell_input(size_t){}template <typename T, typename... Types>void _pararell_input(size_t index, T& value, Types&&... args){input(value[index]);_pararell_input(index, forward<Types>(args)...);}template <typename... Types>void pararell_input(size_t count, Types&&... args){for(const auto& i : Range<>(count))_pararell_input(i, forward<Types>(args)...);}signed main(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);int n, m;input(n, m);vector<int> p(m), q(m);pararell_input(m, p, q);vector<vector<int>> edges(n);for(const auto& i : Range<>(m)){edges[--p[i]].emplace_back(--q[i]);edges[q[i]].emplace_back(p[i]);}auto calc = [&](int st){vector<int> range(n, MOD);priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> que;range[st] = 0;que.emplace(0, st);while(!que.empty()){int pos = que.top().second;que.pop();for(auto& ed : edges[pos])if(chmin(range[ed], range[pos] + 1))que.emplace(range[ed], ed);}int cnt = count_if(range.begin(), range.end(), [](i64 x){return x != MOD;}) - 1;int ma = *max_element(range.begin(), range.end(), [](i64 x, i64 y){return x == MOD ? true : (y == MOD ? false : x < y);});cout << cnt << " ";if(ma <= 1)return 0;int ret = 0;while((1 << ret) < ma)++ret;return ret;};int t;input(t);for(const auto& _ : Range<>(t)){int val;input(val);cout << calc(--val) << endl;}}