結果

問題 No.2888 Mamehinata
ユーザー hibit_athibit_at
提出日時 2024-09-13 21:41:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 491 ms / 2,000 ms
コード長 4,760 bytes
コンパイル時間 1,396 ms
コンパイル使用メモリ 120,336 KB
実行使用メモリ 18,396 KB
最終ジャッジ日時 2024-09-13 21:41:22
合計ジャッジ時間 15,459 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 AC 2 ms
5,376 KB
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 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 58 ms
5,376 KB
testcase_14 AC 143 ms
8,064 KB
testcase_15 AC 282 ms
9,600 KB
testcase_16 AC 382 ms
14,592 KB
testcase_17 AC 201 ms
7,552 KB
testcase_18 AC 120 ms
6,272 KB
testcase_19 AC 401 ms
14,336 KB
testcase_20 AC 330 ms
12,416 KB
testcase_21 AC 331 ms
12,032 KB
testcase_22 AC 253 ms
9,340 KB
testcase_23 AC 331 ms
11,264 KB
testcase_24 AC 407 ms
15,832 KB
testcase_25 AC 382 ms
15,616 KB
testcase_26 AC 379 ms
15,232 KB
testcase_27 AC 305 ms
13,252 KB
testcase_28 AC 62 ms
5,376 KB
testcase_29 AC 157 ms
8,320 KB
testcase_30 AC 413 ms
15,676 KB
testcase_31 AC 338 ms
13,568 KB
testcase_32 AC 260 ms
10,496 KB
testcase_33 AC 314 ms
12,800 KB
testcase_34 AC 264 ms
11,392 KB
testcase_35 AC 222 ms
10,240 KB
testcase_36 AC 491 ms
16,784 KB
testcase_37 AC 474 ms
17,064 KB
testcase_38 AC 124 ms
7,168 KB
testcase_39 AC 409 ms
14,436 KB
testcase_40 AC 476 ms
16,768 KB
testcase_41 AC 76 ms
5,760 KB
testcase_42 AC 402 ms
14,848 KB
testcase_43 AC 330 ms
15,152 KB
testcase_44 AC 363 ms
16,340 KB
testcase_45 AC 422 ms
18,396 KB
testcase_46 AC 53 ms
5,376 KB
testcase_47 AC 389 ms
16,236 KB
testcase_48 AC 267 ms
11,456 KB
testcase_49 AC 24 ms
5,376 KB
testcase_50 AC 77 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 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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);
    }
    if(to[0].size() == 0){
        rep(i,n){
            cout << 0 << endl;
        }
        return 0;
    }
    // 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;
    }
}
0