#1009781 (C++17) No.2888 Mamehinata

提出ソース

結果

問題	No.2888 Mamehinata
ユーザー	dyktr_06
提出日時	2024-09-13 21:30:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,345 bytes
コンパイル時間	2,439 ms
コンパイル使用メモリ	215,852 KB
実行使用メモリ	25,984 KB
最終ジャッジ日時	2024-09-13 21:30:51
合計ジャッジ時間	8,813 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	26 ms 8,448 KB
testcase_14	AC	22 ms 10,240 KB
testcase_15	WA	-
testcase_16	AC	138 ms 22,032 KB
testcase_17	WA	-
testcase_18	AC	52 ms 11,724 KB
testcase_19	AC	155 ms 22,920 KB
testcase_20	AC	123 ms 19,764 KB
testcase_21	AC	121 ms 19,676 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	128 ms 23,184 KB
testcase_25	AC	85 ms 22,144 KB
testcase_26	AC	95 ms 21,760 KB
testcase_27	AC	45 ms 18,176 KB
testcase_28	AC	18 ms 6,528 KB
testcase_29	AC	51 ms 11,392 KB
testcase_30	AC	158 ms 23,424 KB
testcase_31	AC	123 ms 20,224 KB
testcase_32	AC	81 ms 15,232 KB
testcase_33	AC	115 ms 18,816 KB
testcase_34	AC	92 ms 16,512 KB
testcase_35	AC	77 ms 14,720 KB
testcase_36	AC	181 ms 25,216 KB
testcase_37	AC	200 ms 25,984 KB
testcase_38	AC	35 ms 9,728 KB
testcase_39	AC	136 ms 21,504 KB
testcase_40	AC	166 ms 25,472 KB
testcase_41	AC	21 ms 7,296 KB
testcase_42	AC	143 ms 22,144 KB
testcase_43	AC	117 ms 22,220 KB
testcase_44	AC	131 ms 23,920 KB
testcase_45	AC	148 ms 25,716 KB
testcase_46	AC	16 ms 6,072 KB
testcase_47	AC	128 ms 23,496 KB
testcase_48	AC	102 ms 18,452 KB
testcase_49	AC	11 ms 6,016 KB
testcase_50	AC	37 ms 12,544 KB
testcase_51	AC	3 ms 5,376 KB
testcase_52	AC	2 ms 5,376 KB
testcase_53	AC	7 ms 5,376 KB
testcase_54	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const 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, const 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 <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
vector<long long> dijkstra(const vector<vector<array<long long, 2>>> &G, T x){
    const long long INF = 0x1fffffffffffffff;
    vector<long long> cost((int) G.size(), INF);
    using P = pair<long long, long long>;
    priority_queue<P, vector<P>, greater<>> q;
    cost[x] = 0;
    q.emplace(0, x);

    while(q.size()){
        auto [c, at] = q.top();
        q.pop();
        if(c > cost[at]) continue;
        for(auto &[to, t] : G[at]){
            if(cost[to] > c + t){
                cost[to] = c + t;
                q.emplace(cost[to], to);
            }
        }
    }
    return cost;
}

ll T;

void input(){
    in(T);
}

void solve(){
    ll n, m; in(n, m);
    vector<vector<array<ll, 2>>> G(n);
    rep(i, m){
        ll a, b; in(a, b);
        a--, b--;
        G[a].push_back({b, 1});
        G[b].push_back({a, 1});
    }
    vll visited(n);
    vll dist = dijkstra(G, 0);
    vll cnt(n + 1);
    rep(i, n){
        if(dist[i] == INF) continue;
        cnt[dist[i]]++;
    }
    vll ans(n);
    vll res(2);
    rep(i, n + 1){
        res[i % 2] += cnt[i];
        if(i >= 1) ans[i - 1] = res[i % 2];
    }
    vout(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    T = 1;
    // input();
    while(T--) solve();
}

yukicoder

結果

テストケース

ソースコード