結果
問題 | No.1553 Lovely City |
ユーザー |
![]() |
提出日時 | 2021-06-18 22:07:50 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 5,970 bytes |
コンパイル時間 | 5,868 ms |
コンパイル使用メモリ | 205,972 KB |
実行使用メモリ | 33,956 KB |
最終ジャッジ日時 | 2023-09-04 23:13:39 |
合計ジャッジ時間 | 10,834 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 51 ms
33,956 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 99 ms
18,568 KB |
testcase_09 | AC | 107 ms
19,448 KB |
testcase_10 | AC | 126 ms
23,832 KB |
testcase_11 | AC | 81 ms
17,964 KB |
testcase_12 | AC | 129 ms
29,384 KB |
testcase_13 | AC | 86 ms
17,408 KB |
testcase_14 | AC | 101 ms
19,068 KB |
testcase_15 | AC | 91 ms
19,232 KB |
testcase_16 | AC | 110 ms
20,292 KB |
testcase_17 | AC | 88 ms
19,632 KB |
testcase_18 | AC | 160 ms
31,388 KB |
testcase_19 | AC | 156 ms
30,948 KB |
testcase_20 | AC | 154 ms
30,668 KB |
testcase_21 | AC | 163 ms
31,904 KB |
testcase_22 | AC | 160 ms
30,768 KB |
testcase_23 | AC | 162 ms
31,240 KB |
testcase_24 | AC | 156 ms
30,804 KB |
testcase_25 | AC | 166 ms
31,060 KB |
testcase_26 | AC | 160 ms
31,660 KB |
testcase_27 | AC | 165 ms
31,132 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; using datas=pair<ll,ll>; using ddatas=pair<long double,long double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define popcount __builtin_popcountll #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) // constexpr ll mod=1000000007; constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif inline void startupcpp(void) noexcept{ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } ll modinv(ll a,const ll m=mod) noexcept{ ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(const ll n,const ll r) noexcept{ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[n]=modinv(modncrlistp[n]); for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod; } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n,const ll m=mod){ if(n<0)return 0; ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);} constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;} struct unionfind{ private: int maxN; vector<int> par,treesize; public:unionfind(int N) :maxN(N),par(N),treesize(N,1){ for(int i=0;i<maxN;++i)par[i]=i; } int root(int x){ while(par[x]!=x){ x=par[x]=par[par[x]]; } return x; } bool unite(int x,int y){ x=root(x); y=root(y); if(x==y)return false; if(treesize[x]>treesize[y])swap(x,y); par[x]=y; treesize[y]+=treesize[x]; return true; } bool unite(pair<int,int> v){ return unite(v.first,v.second); } bool parcheck(int x,int y){ return root(x)==root(y); } bool parcheck(pair<int,int> v){ return parcheck(v.first,v.second); } int size(int x){ return treesize[root(x)]; } void clear(){ treesize.assign(maxN,1); for(int i=0;i<maxN;++i)par[i]=i; } vector<vector<int>> groups(){ vector<vector<int>> res(maxN); for(int i=0;i<maxN;++i)res[root(i)].eb(i); // return res; vector<vector<int>> res2; for(vector<int> x:res){ if(x.size())res2.eb(x); } return res2; } }; ll N,M,K,H,W,A,B,C,D; string s,t; ll ans; int main(){ startupcpp(); ll i; cin>>N>>M; mat g(N),ans; unionfind dsu(N); while(M--){ cin>>A>>B; --A;--B; g[A].emplace_back(B); dsu.unite(A,B); } vec h(N,0); queue<ll> que; for(auto v:dsu.groups()){ if(v.size()==1)continue; for(auto p:v)for(auto x:g[p])h[x]++; vec ch; ch.reserve(v.size()); for(auto x:v)if(h[x]==0)que.emplace(x); while(!que.empty()){ auto x=que.front();que.pop(); ch.emplace_back(x); for(auto nx:g[x])if(--h[nx]==0)que.emplace(nx); } if(v.size()==ch.size()){ rep1(i,ch.size())ans.push_back({ch[i-1]+1,ch[i]+1}); }else{ rep1(i,v.size())ans.push_back({v[i-1]+1,v[i]+1}); ans.push_back({v.back()+1,v[0]+1}); } } print(ans.size()); matoutput(ans); }