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

提出ソース

結果

問題	No.2888 Mamehinata
ユーザー	👑 binap
提出日時	2024-09-13 21:36:33
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	324 ms / 2,000 ms
コード長	4,408 bytes
コンパイル時間	5,311 ms
コンパイル使用メモリ	284,692 KB
実行使用メモリ	31,344 KB
最終ジャッジ日時	2024-09-13 21:37:14
合計ジャッジ時間	14,943 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	3 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	3 ms 5,376 KB
testcase_13	AC	86 ms 9,636 KB
testcase_14	AC	40 ms 9,800 KB
testcase_15	AC	168 ms 18,256 KB
testcase_16	AC	246 ms 21,252 KB
testcase_17	AC	29 ms 12,020 KB
testcase_18	AC	153 ms 14,168 KB
testcase_19	AC	288 ms 22,248 KB
testcase_20	AC	249 ms 19,572 KB
testcase_21	AC	248 ms 19,284 KB
testcase_22	AC	65 ms 15,360 KB
testcase_23	AC	101 ms 19,580 KB
testcase_24	AC	227 ms 22,708 KB
testcase_25	AC	152 ms 21,752 KB
testcase_26	AC	157 ms 21,116 KB
testcase_27	AC	70 ms 16,912 KB
testcase_28	AC	36 ms 6,564 KB
testcase_29	AC	102 ms 11,432 KB
testcase_30	AC	286 ms 23,116 KB
testcase_31	AC	219 ms 19,980 KB
testcase_32	AC	150 ms 15,120 KB
testcase_33	AC	215 ms 19,104 KB
testcase_34	AC	165 ms 16,268 KB
testcase_35	AC	144 ms 14,492 KB
testcase_36	AC	293 ms 25,096 KB
testcase_37	AC	324 ms 25,540 KB
testcase_38	AC	67 ms 9,788 KB
testcase_39	AC	232 ms 21,316 KB
testcase_40	AC	281 ms 25,288 KB
testcase_41	AC	39 ms 7,380 KB
testcase_42	AC	233 ms 22,096 KB
testcase_43	AC	214 ms 26,436 KB
testcase_44	AC	235 ms 28,528 KB
testcase_45	AC	262 ms 31,344 KB
testcase_46	AC	29 ms 7,012 KB
testcase_47	AC	239 ms 28,040 KB
testcase_48	AC	219 ms 21,448 KB
testcase_49	AC	40 ms 7,244 KB
testcase_50	AC	142 ms 17,664 KB
testcase_51	AC	6 ms 5,376 KB
testcase_52	AC	4 ms 5,376 KB
testcase_53	AC	19 ms 5,376 KB
testcase_54	AC	2 ms 5,376 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

const long long INF = 1001001001001001;
using S = long long;
S _INF(INF);
S _ZERO(0LL);
using F = long long;
S apply(F f, S x){
	return f + x;
}

template<typename S, typename F>
struct Dijkstra{
	struct Edge{
		int from, to;
		F cost;
		Edge(int from, int to, F cost) : from(from), to(to), cost(cost) {};
	};
	int n, m;
	vector<bool> initialized;
	vector<Edge> E;
	vector<vector<int>> G;
	map<int, vector<S>> dist;
	map<int, vector<int>> idx;
	Dijkstra(int _n) : n(_n), m(0), initialized(n, false), G(n){}
	void add_edge(int from, int to, F cost){
		Edge e(from, to, cost);
		E.push_back(e);
		G[from].emplace_back(m);
		m++;
	}
	void calc(int s){
		initialized[s] = true;
		dist[s] = vector<S>(n, _INF);
		idx[s] = vector<int>(n, -1);
		priority_queue<tuple<S, int, int>, vector<tuple<S, int, int>>, greater<tuple<S, int, int>>> pq;
		pq.emplace(_ZERO, s, -1);
		while(pq.size()){
			auto [dist_from, from, index] = pq.top(); pq.pop();
			if(dist[s][from] <= dist_from) continue;
			dist[s][from] = dist_from;
			idx[s][from] = index;
			for(int index : G[from]){
				int to = E[index].to;
				S dist_to = apply(E[index].cost, dist_from);
				if(dist[s][to] <= dist_to) continue;
				pq.emplace(dist_to, to, index);
			}
		}
	}
	int farthest(int s){
		if(!initialized[s]) calc(s);
		int idx = 0;
		rep(i, n) if(dist[s][i] > dist[s][idx]) idx = i;
		return idx;
	}
	S get_dist(int s, int t){
		if(!initialized[s]) calc(s);
		return dist[s][t];
	}
	vector<int> restore(int s, int t){
		if(!initialized[s]) calc(s);
		if(dist[s][t] == _INF) return vector<int>(0);
		vector<int> res;
		while(idx[s][t] != -1){
			auto e = E[idx[s][t]];
			res.push_back(idx[s][t]);
			t = e.from;
		}
	reverse(res.begin(), res.end());
	return res;
	}
};
int main(){
	int n, m;
	cin >> n >> m;
	Dijkstra<long long, long long> graph(n);
	rep(i, m){
		int u, v;
		cin >> u >> v;
		u--; v--;
		graph.add_edge(u, v, 1);
		graph.add_edge(v, u, 1);
	}
	vector<long long> d(n, INF);
	rep(i, n) d[i] = graph.get_dist(0, i);
	vector<int> cnt(n + 1);
	rep(i, n){
		if(d[i] <= n) cnt[d[i]]++;
	}
	vector<int> example(n + 1);
	example[0] = 1;
	if(cnt == example){
		rep(i, n) cout << "0\n";
		return 0;
	}
	vector<int> p(2);
	rep(t, n + 1){
		p[t % 2] += cnt[t];
		if(t > 0) cout << p[t % 2] << "\n";
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード