#1010008 (C++23) No.2888 Mamehinata

提出ソース

結果

問題	No.2888 Mamehinata
ユーザー	mikam
提出日時	2024-09-13 21:56:10
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	136 ms / 2,000 ms
コード長	4,387 bytes
コンパイル時間	9,591 ms
コンパイル使用メモリ	451,176 KB
実行使用メモリ	19,824 KB
最終ジャッジ日時	2024-09-13 21:56:29
合計ジャッジ時間	15,297 ms
ジャッジサーバーID （参考情報）	judge6 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	22 ms 6,940 KB
testcase_14	AC	19 ms 8,064 KB
testcase_15	AC	87 ms 11,392 KB
testcase_16	AC	92 ms 15,488 KB
testcase_17	AC	18 ms 7,552 KB
testcase_18	AC	42 ms 7,936 KB
testcase_19	AC	105 ms 15,840 KB
testcase_20	AC	105 ms 13,968 KB
testcase_21	AC	98 ms 13,824 KB
testcase_22	AC	33 ms 9,392 KB
testcase_23	AC	47 ms 11,480 KB
testcase_24	AC	91 ms 16,468 KB
testcase_25	AC	71 ms 15,920 KB
testcase_26	AC	71 ms 15,628 KB
testcase_27	AC	36 ms 13,344 KB
testcase_28	AC	14 ms 6,944 KB
testcase_29	AC	35 ms 8,704 KB
testcase_30	AC	111 ms 16,368 KB
testcase_31	AC	79 ms 14,296 KB
testcase_32	AC	56 ms 11,008 KB
testcase_33	AC	71 ms 13,440 KB
testcase_34	AC	64 ms 11,916 KB
testcase_35	AC	49 ms 10,712 KB
testcase_36	AC	136 ms 17,504 KB
testcase_37	AC	125 ms 18,080 KB
testcase_38	AC	28 ms 7,296 KB
testcase_39	AC	95 ms 14,428 KB
testcase_40	AC	127 ms 16,864 KB
testcase_41	AC	17 ms 6,940 KB
testcase_42	AC	115 ms 14,920 KB
testcase_43	AC	69 ms 16,204 KB
testcase_44	AC	78 ms 17,904 KB
testcase_45	AC	84 ms 19,824 KB
testcase_46	AC	11 ms 6,940 KB
testcase_47	AC	76 ms 17,668 KB
testcase_48	AC	61 ms 12,508 KB
testcase_49	AC	10 ms 6,940 KB
testcase_50	AC	30 ms 8,448 KB
testcase_51	AC	3 ms 6,940 KB
testcase_52	AC	2 ms 6,940 KB
testcase_53	AC	7 ms 6,944 KB
testcase_54	AC	2 ms 6,948 KB

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

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
#define pb push_back
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using ull = unsigned long long;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}
struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;
int di[]={0,1,0,-1,-1,-1,1,1};
int dj[]={1,0,-1,0,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {

	INT(n,m);
	vector<vi> g(n);
	rep(i,m){
		INT(u,v);
		--u;--v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	if(g[0].size()==0){
		rep(i,n)print(0);
		return 0;
	}
	queue<int> q;
	q.push(0);
	vi dist(n,INF);
	dist[0] = 0;
	while(q.size()){
		auto u = q.front();q.pop();
		for(auto v:g[u]){
			if(chmin(dist[v],dist[u]+1))q.push(v);
		}
	}
	vi cnt(n+1);
	rep(i,n)if(dist[i]!=INF)cnt[dist[i]]++;
	vi res(2);
	for(int i=0;i<n+1;i++){
		res[i%2]+=cnt[i];
		if(i)print(res[i%2]);
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード