結果
問題 | No.812 Change of Class |
ユーザー | hitonanode |
提出日時 | 2019-04-14 08:35:24 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,134 bytes |
コンパイル時間 | 1,781 ms |
コンパイル使用メモリ | 179,004 KB |
実行使用メモリ | 10,748 KB |
最終ジャッジ日時 | 2024-06-12 20:42:00 |
合計ジャッジ時間 | 15,083 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
7,808 KB |
testcase_01 | AC | 11 ms
6,944 KB |
testcase_02 | AC | 36 ms
6,940 KB |
testcase_03 | AC | 78 ms
8,704 KB |
testcase_04 | AC | 68 ms
8,064 KB |
testcase_05 | AC | 647 ms
8,552 KB |
testcase_06 | AC | 638 ms
7,820 KB |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | AC | 544 ms
9,196 KB |
testcase_10 | AC | 584 ms
9,192 KB |
testcase_11 | AC | 17 ms
6,944 KB |
testcase_12 | AC | 305 ms
8,660 KB |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | AC | 381 ms
7,040 KB |
testcase_16 | AC | 20 ms
6,944 KB |
testcase_17 | AC | 326 ms
7,384 KB |
testcase_18 | AC | 237 ms
6,940 KB |
testcase_19 | AC | 274 ms
6,940 KB |
testcase_20 | AC | 575 ms
9,080 KB |
testcase_21 | AC | 227 ms
6,944 KB |
testcase_22 | AC | 91 ms
6,940 KB |
testcase_23 | AC | 16 ms
6,940 KB |
testcase_24 | AC | 25 ms
6,940 KB |
testcase_25 | AC | 73 ms
6,944 KB |
testcase_26 | AC | 475 ms
8,064 KB |
testcase_27 | AC | 406 ms
7,608 KB |
testcase_28 | AC | 259 ms
6,940 KB |
testcase_29 | AC | 56 ms
6,940 KB |
testcase_30 | AC | 357 ms
7,168 KB |
testcase_31 | AC | 299 ms
6,940 KB |
testcase_32 | AC | 115 ms
6,940 KB |
testcase_33 | AC | 358 ms
7,768 KB |
testcase_34 | AC | 22 ms
6,940 KB |
testcase_35 | AC | 47 ms
6,940 KB |
testcase_36 | AC | 23 ms
6,944 KB |
testcase_37 | AC | 138 ms
6,940 KB |
testcase_38 | AC | 8 ms
6,940 KB |
testcase_39 | AC | 143 ms
6,944 KB |
testcase_40 | AC | 31 ms
6,944 KB |
testcase_41 | AC | 7 ms
6,944 KB |
testcase_42 | AC | 333 ms
7,128 KB |
testcase_43 | AC | 32 ms
6,944 KB |
testcase_44 | AC | 218 ms
6,944 KB |
testcase_45 | AC | 24 ms
6,940 KB |
testcase_46 | AC | 28 ms
6,940 KB |
testcase_47 | AC | 216 ms
6,940 KB |
testcase_48 | AC | 219 ms
6,940 KB |
testcase_49 | AC | 63 ms
6,940 KB |
testcase_50 | AC | 5 ms
6,940 KB |
testcase_51 | AC | 50 ms
6,940 KB |
testcase_52 | AC | 99 ms
6,944 KB |
testcase_53 | AC | 40 ms
6,940 KB |
testcase_54 | AC | 36 ms
6,940 KB |
testcase_55 | AC | 217 ms
8,248 KB |
testcase_56 | AC | 264 ms
9,572 KB |
testcase_57 | AC | 287 ms
9,844 KB |
testcase_58 | AC | 142 ms
6,940 KB |
testcase_59 | AC | 323 ms
10,748 KB |
testcase_60 | AC | 2 ms
6,940 KB |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long int; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; #define FI first #define SE second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) using Edges = vector<vector<int>>; Edges e; // rから各ノードへの距離 vector<int> graph_distance(int N, int r) { vector<int> res(N, N); // res[r] = 0; priority_queue<pint, vector<pint>, greater<pint>> pq; pq.emplace(0, r); while (!pq.empty()) { pint pa = pq.top(); pq.pop(); int x = pa.first, now = pa.second; if (mmin(res[now], x)) for (auto nxt : e[now]) if (res[nxt] > x + 1) pq.emplace(x + 1, nxt); } for (auto &v : res) if (v == N) v = 0; return res; } int main() { int N, M; cin >> N >> M; REP(_, M) { e.resize(N + 1); int p, q; cin >> p >> q; e[p].push_back(q); e[q].push_back(p); } int Q; cin >> Q; REP(_, Q) { int A; cin >> A; vector<int> ds = graph_distance(N + 1, A); int maxi = *max_element(ALL(ds)); maxi = max(maxi - 1, 0); int d = 0; REP(dd, 31) if (POW2(dd) & maxi) d = dd + 1; int n = 0; for (auto v : ds) n += (v > 0); cout << n << " " << d << endl; } }