結果
問題 | No.2888 Mamehinata |
ユーザー | komite_kyopro |
提出日時 | 2024-09-13 21:44:37 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 152 ms / 2,000 ms |
コード長 | 7,659 bytes |
コンパイル時間 | 2,579 ms |
コンパイル使用メモリ | 215,268 KB |
実行使用メモリ | 19,936 KB |
最終ジャッジ日時 | 2024-09-13 21:45:04 |
合計ジャッジ時間 | 8,708 ms |
ジャッジサーバーID (参考情報) |
judge4 / 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 | 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 | 29 ms
6,400 KB |
testcase_14 | AC | 26 ms
8,192 KB |
testcase_15 | AC | 97 ms
11,648 KB |
testcase_16 | AC | 139 ms
15,616 KB |
testcase_17 | AC | 23 ms
7,552 KB |
testcase_18 | AC | 54 ms
8,064 KB |
testcase_19 | AC | 124 ms
16,128 KB |
testcase_20 | AC | 100 ms
14,044 KB |
testcase_21 | AC | 107 ms
13,952 KB |
testcase_22 | AC | 42 ms
9,680 KB |
testcase_23 | AC | 60 ms
11,648 KB |
testcase_24 | AC | 107 ms
16,580 KB |
testcase_25 | AC | 89 ms
15,972 KB |
testcase_26 | AC | 91 ms
15,852 KB |
testcase_27 | AC | 46 ms
13,388 KB |
testcase_28 | AC | 17 ms
6,944 KB |
testcase_29 | AC | 42 ms
8,704 KB |
testcase_30 | AC | 119 ms
16,508 KB |
testcase_31 | AC | 104 ms
14,580 KB |
testcase_32 | AC | 63 ms
11,120 KB |
testcase_33 | AC | 87 ms
13,532 KB |
testcase_34 | AC | 75 ms
12,032 KB |
testcase_35 | AC | 67 ms
10,880 KB |
testcase_36 | AC | 152 ms
17,756 KB |
testcase_37 | AC | 150 ms
18,144 KB |
testcase_38 | AC | 34 ms
7,424 KB |
testcase_39 | AC | 124 ms
14,472 KB |
testcase_40 | AC | 143 ms
17,076 KB |
testcase_41 | AC | 21 ms
6,940 KB |
testcase_42 | AC | 120 ms
15,096 KB |
testcase_43 | AC | 84 ms
16,560 KB |
testcase_44 | AC | 91 ms
18,004 KB |
testcase_45 | AC | 106 ms
19,936 KB |
testcase_46 | AC | 15 ms
6,940 KB |
testcase_47 | AC | 90 ms
17,648 KB |
testcase_48 | AC | 83 ms
12,744 KB |
testcase_49 | AC | 14 ms
6,944 KB |
testcase_50 | AC | 42 ms
8,448 KB |
testcase_51 | AC | 3 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 7 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
main.cpp:21: warning: "each" redefined 21 | #define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__) | main.cpp:17: note: this is the location of the previous definition 17 | # define each(i,...) for(auto&& i:__VA_ARGS__) |
ソースコード
#include<bits/stdc++.h> using namespace std; //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") using ll=long long; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(ll i = 0; i < (n); ++i) #define rep2(i, n) for(ll i = 0; i < (n); ++i) #define rep3(i, a, b) for(ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i=n;i--;) #define rrep2(i,n) for(ll i=n;i--;) #define rrep3(i,a,b) for(ll i=b;i-->(a);) #define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c) #define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__) # define each(i,...) for(auto&& i:__VA_ARGS__) #define each1(i,a) for(auto&&i:a) #define each2(x,y,a) for(auto&&[x,y]:a) #define each3(x,y,z,a) for(auto&&[x,y,z]:a) #define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__) #define all(i) begin(i), end(i) #define rall(i) (i).rbegin(), (i).rend() #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define elif else if template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> ll sum(const T& a){ return accumulate(all(a), 0LL); } template<class T> auto min(const T& a){ return *min_element(all(a)); } template<class T> auto max(const T& a){ return *max_element(all(a)); } vector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; } const int INF =0x3fffffff; const ll INFll =0x1fffffffffffffff;// 4times ok const int MOD= int(1e9)+7; const int MODD=998244353; using P= pair<int,int>; using Pl= pair<ll,ll>; using ld=long double; using VVl=vector<vector<ll>>; using VVd=vector<vector<ld>>; using Vd=vector<ld>; using tuplis =array<ll, 3>; using quatro=array<ll,4>; #define vec(type,name,...) vector<type> name(__VA_ARGS__) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; const ll four[] = {0, 1, 0, -1, 0}; const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0}; const ld EPS = 1e-9; const ld PI = 3.1415926535897932; ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; } ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); } ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ a%=p; ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll isqr(ll x){ll r=sqrt(x)-1;while((r+1)*(r+1)<=x)r++;return r;} vector<ll> divisor(ll x){vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; } int scan(){ return getchar(); } void scan(int& a){ scanf("%d", &a); } void scan(unsigned& a){ scanf("%u", &a); } void scan(long& a){ scanf("%ld", &a); } void scan(long long& a){ scanf("%lld", &a); } void scan(unsigned long long& a){ scanf("%llu", &a); } void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); } void scan(float& a){ scanf("%f", &a); } void scan(double& a){ scanf("%lf", &a); } void scan(long double& a){ scanf("%Lf", &a); } void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } } void scan(char a[]){ scanf("%s", a); } void scan(string& a){ cin >> a; } template<class T> void scan(vector<T>&); template<class T, size_t size> void scan(array<T, size>&); template<class T, class L> void scan(pair<T, L>&); template<class T, size_t size> void scan(T(&)[size]); template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); } template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); } template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); } template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); } template<class T> void scan(T& a){ cin >> a; } void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(unsigned a){ printf("%u", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(unsigned long long a){ printf("%llu", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(float a){ printf("%.15f", a); } void print(double a){ printf("%.15f", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); } template<class T> void print(const vector<T>&); template<class T, size_t size> void print(const array<T, size>&); template<class T, class L> void print(const pair<T, L>& p); template<class T, size_t size> void print(const T (&)[size]); template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); } template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type,name,size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) void solve(){ LL(n,m); vv(ll,adj,n); rep(m){ LL(a,b); a--;b--; adj[a].emplace_back(b); adj[b].emplace_back(a); } if(adj[0].empty()){ rep(n){ out(0); } return; } vec(ll,d,n,INFll); d[0]=0; queue<ll> q; q.push(0); while(q.size()){ auto at=q.front();q.pop(); each(to,adj[at]){ if(chmin(d[to],d[at]+1)){ q.push(to); } } } vec(ll,ans,n+1); rep(n){ if(d[i]==INFll)continue; ans[d[i]]++; } rep(i,2,n+1){ ans[i]+=ans[i-2]; } rep(i,1,n+1){ out(ans[i]); } } int main(){ ll t=1; // in(t); while(t--)solve(); return 0; }