結果
問題 | No.2888 Mamehinata |
ユーザー | hibit_at |
提出日時 | 2024-09-13 21:36:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,647 bytes |
コンパイル時間 | 1,446 ms |
コンパイル使用メモリ | 119,956 KB |
実行使用メモリ | 18,264 KB |
最終ジャッジ日時 | 2024-09-13 21:36:37 |
合計ジャッジ時間 | 15,294 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | WA | - |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 57 ms
5,376 KB |
testcase_14 | AC | 144 ms
7,936 KB |
testcase_15 | WA | - |
testcase_16 | AC | 391 ms
14,464 KB |
testcase_17 | WA | - |
testcase_18 | AC | 122 ms
6,144 KB |
testcase_19 | AC | 411 ms
14,336 KB |
testcase_20 | AC | 332 ms
12,544 KB |
testcase_21 | AC | 320 ms
12,032 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 416 ms
15,872 KB |
testcase_25 | AC | 378 ms
15,488 KB |
testcase_26 | AC | 412 ms
15,360 KB |
testcase_27 | AC | 307 ms
13,184 KB |
testcase_28 | AC | 63 ms
5,376 KB |
testcase_29 | AC | 163 ms
8,320 KB |
testcase_30 | AC | 433 ms
15,616 KB |
testcase_31 | AC | 342 ms
13,568 KB |
testcase_32 | AC | 233 ms
10,496 KB |
testcase_33 | AC | 323 ms
12,800 KB |
testcase_34 | AC | 291 ms
11,520 KB |
testcase_35 | AC | 219 ms
10,240 KB |
testcase_36 | AC | 466 ms
16,768 KB |
testcase_37 | AC | 501 ms
17,152 KB |
testcase_38 | AC | 126 ms
7,168 KB |
testcase_39 | AC | 390 ms
14,464 KB |
testcase_40 | AC | 508 ms
16,896 KB |
testcase_41 | AC | 76 ms
5,632 KB |
testcase_42 | AC | 402 ms
14,848 KB |
testcase_43 | AC | 330 ms
15,276 KB |
testcase_44 | AC | 392 ms
16,472 KB |
testcase_45 | AC | 418 ms
18,264 KB |
testcase_46 | AC | 53 ms
5,376 KB |
testcase_47 | AC | 360 ms
16,368 KB |
testcase_48 | AC | 291 ms
11,432 KB |
testcase_49 | AC | 24 ms
5,376 KB |
testcase_50 | AC | 76 ms
6,016 KB |
testcase_51 | AC | 5 ms
5,376 KB |
testcase_52 | AC | 3 ms
5,376 KB |
testcase_53 | AC | 12 ms
5,376 KB |
testcase_54 | WA | - |
ソースコード
#include <algorithm> #include <iostream> #include <iomanip> #include <limits.h> #include <map> #include <math.h> #include <numeric> #include <queue> #include <set> #include <sstream> #include <string> #include <utility> #include <vector> #include <stack> #include <complex> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i < n + 1; i++) #define rev(i, n) for (int i = n - 1; i >= 0; i--) #define all(A) A.begin(), A.end() #define itr(A, l, r) A.begin() + l, A.begin() + r #define debug(var) cout << #var << " = " << var << endl; typedef long long ll; template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } template <typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << endl; } return os; } template <typename T> ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v) { int n = v.size(); int m = v[0].size(); int p = v[0][0].size(); rep(k, p) { os << "k = " << k << endl; rep(i, n) { rep(j, m) { os << v[i][j][k]; if (j < m - 1) { os << " "; } else { os << endl; } } } } return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template <typename T, typename S> ostream &operator<<(ostream &os, map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } cout << endl; return os; } template <typename T> ostream &operator<<(ostream &os, set<T> st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, multiset<T> st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, priority_queue<T> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq) { while (mpq.size()) { os << mpq.top() << " "; mpq.pop(); } return os; } int main(){ int n,m; cin >> n >> m; vector<vector<int>> to(n); rep(i,m){ int u,v; cin >> u >> v; u--; v--; to[u].push_back(v); to[v].push_back(u); } // cout << to << endl; queue<int> q; q.push(0); vector<bool> seen(n); vector<int> dist(n,-1); seen[0] = true; dist[0] = 0; while(q.size()){ int now = q.front(); q.pop(); // debug(now); for(int next : to[now]){ if(seen[next]){ continue; } dist[next] = dist[now]+1; seen[next] = true; q.push(next); } } // debug(dist); vector<vector<int>> cnt(2,vector<int>(n+1)); rep(i,n){ if(dist[i]==-1){ continue; } cnt[dist[i]%2][dist[i]]++; } // cout << cnt << endl; rep(i,2){ rep(j,n){ cnt[i][j+1] += cnt[i][j]; } } // cout << cnt << endl; rep(i,n){ cout << cnt[(i+1)%2][i+1] << endl; } }