結果
問題 | No.2418 情報通だよ!Nafmoくん |
ユーザー |
|
提出日時 | 2023-08-27 09:47:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 2,096 bytes |
コンパイル時間 | 4,496 ms |
コンパイル使用メモリ | 254,428 KB |
最終ジャッジ日時 | 2025-02-16 15:00:15 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}ll inva(ll N, ll M) {ll mod = M;ll a = N, b = mod, c = 1, d = 0;while (b > 0) {ll t = a / b;a -= t * b;swap(a, b);c -= t * d;swap(c, d);}c %= mod;if (c < 0)c += mod;return c;}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;using vvvvm = vector<vvvm>;using vvvvvm = vector<vvvvm>;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N,M;cin>>N>>M;dsu d(2*N);rep(i,M){ll A,B;cin>>A>>B;d.merge(A-1,B-1);}auto V=d.groups();ll an=0;for(auto v:V)an+=v.size()%2;cout<<an/2<<endl;}