結果
問題 | No.2888 Mamehinata |
ユーザー |
|
提出日時 | 2024-09-18 19:48:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,838 bytes |
コンパイル時間 | 2,377 ms |
コンパイル使用メモリ | 207,536 KB |
最終ジャッジ日時 | 2025-02-24 09:22:23 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 45 WA * 7 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i=0; i<n; i++)#define debug 0#define YES cout << "Yes" << endl;#define NO cout << "No" << endl;using ll = long long;using ld = long double;const int mod = 998244353;const int MOD = 1000000007;const double pi = atan2(0, -1);const int inf = 1 << 31-1;const ll INF = 1LL << 63 - 1;#include <time.h>#include <chrono>//vectorの中身を空白区切りで出力template<typename T>void printv(vector<T> v) {for (int i = 0; i < v.size(); i++) {cout << v[i];if (i < v.size() - 1) {cout << " ";}}cout << endl;}//vectorの中身を改行区切りで出力template<typename T>void print1(vector<T> v) {for (auto x : v) {cout << x << endl;}}//二次元配列を出力template<typename T>void printvv(vector<vector<T>> vv) {for (vector<T> v : vv) {printv(v);}}//vectorを降順にソートtemplate<typename T>void rsort(vector<T>& v) {sort(v.begin(), v.end());reverse(v.begin(), v.end());}//昇順priority_queueを召喚template<typename T>struct rpriority_queue {priority_queue<T, vector<T>, greater<T>> pq;void push(T x) {pq.push(x);}void pop() {pq.pop();}T top() {return pq.top();}size_t size() {return pq.size();}bool empty() {return pq.empty();}};//mod mod下で逆元を算出する//高速a^n計算(mod ver.)ll power(ll a, ll n) {if (n == 0) {return 1;}else if (n % 2 == 0) {ll x = power(a, n / 2);x *= x;x %= mod;return x;}else {ll x = power(a, n - 1);x *= a;x %= mod;return x;}}//フェルマーの小定理を利用ll modinv(ll p) {return power(p, mod - 2) % mod;}//Mexを求めるstruct Mex {map<int, int> mp;set<int> s;Mex(int Max) {for (int i = 0; i <= Max; i++) {s.insert(i);}}int _mex = 0;void Input(int x) {mp[x]++;s.erase(x);if (_mex == x) {_mex = *begin(s);}}void Remove(int x) {if (mp[x] == 0) {cout << "Mex ERROR!: NO VALUE WILL BE REMOVED" << endl;}mp[x]--;if (mp[x] == 0) {s.insert(x);if (*begin(s) == x) {_mex = x;}}}int mex(){return _mex;}};int main() {int N, M;cin >> N >> M;vector<vector<int>> path(N);rep(i, M) {int u, v;cin >> u >> v;u--; v--;path[u].push_back(v);path[v].push_back(u);}set<int> enter;enter.insert(0);vector<vector<int>> q(N+1);q[0].push_back(0);set<int> odd, even;even.insert(0);rep(t, N) {for (int x : q[t]) {for (int y : path[x]) {if (!enter.count(y)) {enter.insert(y);if (t % 2 == 0) {odd.insert(y);}else {even.insert(y);}q[t + 1].push_back(y);}}}if (t % 2 == 0) {cout << odd.size() << endl;}else {cout << even.size() << endl;}}}