結果
問題 | No.2072 Anatomy |
ユーザー |
![]() |
提出日時 | 2022-09-16 23:13:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,968 bytes |
コンパイル時間 | 3,982 ms |
コンパイル使用メモリ | 257,564 KB |
最終ジャッジ日時 | 2025-02-07 10:36:19 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 7 WA * 20 |
ソースコード
#include <atcoder/all>using namespace atcoder;#include <bits/stdc++.h>using namespace std;// #include <boost/multiprecision/cpp_int.hpp>#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())typedef long long ll;#define int llusing ld = long double;using vi = vector<int>;using vs = vector<string>;using P = pair<int,int>;using vp = vector<P>;// using Bint = boost::multiprecision::cpp_int;template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;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<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}template<class... T> void _IN(T&... a){(cin>> ... >> a);}template<class T> void _OUT(T& a){cout <<a<< '\n';}template<class T,class... Ts> void _OUT(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}#define INT(...) int __VA_ARGS__; _IN(__VA_ARGS__)#define STR(...) string __VA_ARGS__; _IN(__VA_ARGS__)#define pcnt __builtin_popcountllint ceil(int x,int y){if(x*y>=0)return x/y+!!(x%y);return -((-x/y));}int abs(int x,int y){return abs(x-y);}bool ins(string s,string 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};}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 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; }void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}int di[]={-1,0,1,0,-1,-1,1,1};int dj[]={0,1,0,-1,-1,1,-1,1};const int INF = 8e18;//using mint = modint1000000007;//using mint = modint998244353;signed main() {cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);INT(n,m);vp edge(m);for(auto&[u,v]:edge)cin>>u>>v,--u,--v;reverse(all(edge));int p = edge[0].first;dsu uf(n);int ans = 0;for(auto [u,v]:edge){uf.merge(u,v);if(uf.same(u,p))ans++;p = u;}cout<<ans<<endl;return 0;}