結果
| 問題 | No.1553 Lovely City |
| ユーザー |
 hotman78
|
| 提出日時 | 2021-06-18 22:10:44 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 439 ms / 2,000 ms |
| コード長 | 6,993 bytes |
| コンパイル時間 | 4,318 ms |
| コンパイル使用メモリ | 258,484 KB |
| 実行使用メモリ | 50,448 KB |
| 最終ジャッジ日時 | 2024-06-22 20:33:47 |
| 合計ジャッジ時間 | 15,524 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 226 ms
43,056 KB |
| testcase_03 | AC | 3 ms
5,376 KB |
| testcase_04 | AC | 2 ms
5,376 KB |
| testcase_05 | AC | 3 ms
5,376 KB |
| testcase_06 | AC | 2 ms
5,376 KB |
| testcase_07 | AC | 2 ms
5,376 KB |
| testcase_08 | AC | 231 ms
31,040 KB |
| testcase_09 | AC | 273 ms
33,120 KB |
| testcase_10 | AC | 324 ms
40,120 KB |
| testcase_11 | AC | 174 ms
28,364 KB |
| testcase_12 | AC | 320 ms
42,868 KB |
| testcase_13 | AC | 186 ms
27,904 KB |
| testcase_14 | AC | 218 ms
31,704 KB |
| testcase_15 | AC | 217 ms
31,760 KB |
| testcase_16 | AC | 241 ms
34,700 KB |
| testcase_17 | AC | 229 ms
32,592 KB |
| testcase_18 | AC | 362 ms
49,480 KB |
| testcase_19 | AC | 439 ms
49,352 KB |
| testcase_20 | AC | 380 ms
49,408 KB |
| testcase_21 | AC | 366 ms
49,400 KB |
| testcase_22 | AC | 386 ms
49,496 KB |
| testcase_23 | AC | 378 ms
49,328 KB |
| testcase_24 | AC | 367 ms
49,388 KB |
| testcase_25 | AC | 388 ms
50,448 KB |
| testcase_26 | AC | 371 ms
49,304 KB |
| testcase_27 | AC | 379 ms
49,316 KB |
ソースコード
#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)
// #define rep(i,...) for(auto i:range(__VA_ARGS__))
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
#if __cplusplus>=201703L
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#endif
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#if __cplusplus>=201703L
constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#endif
template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}
template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}
template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}
template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}
#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
#line 4 "cpplib/graph_tree/topological_sort.hpp"
/**
* @brief トポロジカルソート
*/
std::vector<int>tsort(std::vector<std::vector<int>>G){
std::vector<int> in(G.size(),0);
std::vector<int> vis(G.size(),0);
std::vector<int> res;
for(int i=0;i<(int)G.size();i++)for(int j=0;j<(int)G[i].size();j++){
in[G[i][j]]++;
}
for(int i=0;i<(int)G.size();++i){
auto dfs=[&](auto dfs,int v)->void{
vis[v]=1;
res.push_back(v);
for(auto e:G[v]){
in[e]--;
if(in[e]==0)dfs(dfs,e);
}
};
if(vis[i]==0&&in[i]==0)dfs(dfs,i);
}
return res;
}
#line 1 "cpplib/dsu/union_find.hpp"
/**
* @brief Union Find
* @see https://ja.wikipedia.org/wiki/%E7%B4%A0%E9%9B%86%E5%90%88%E3%83%87%E3%83%BC%E3%82%BF%E6%A7%8B%E9%80%A0
*/
class UF{
public:
vector<int> data;
int sz;
public:
UF(int sz):sz(sz){data.resize(sz,-1);}
bool unite(int x,int y){
x=root(x);y=root(y);
if(x==y)return 0;
if(data[x]>data[y])swap(x,y);
data[x]+=data[y];
data[y]=x;
sz--;
return 1;
}
inline int root(int x){return data[x]<0?x:data[x]=root(data[x]);}
inline bool same(int x, int y){return root(x)==root(y);}
inline int size(){return sz;}
inline int size(int x){return -data[root(x)];}
};
#line 4 "code.cpp"
int main(){
lint n,m;
cin>>n>>m;
mat g(n);
UF uf(n);
rep(i,m){
lint s,t;
cin>>s>>t;
s--;t--;
g[s].emplace_back(t);
uf.unite(s,t);
}
map<lint,vec>ma;
map<lint,lint>toid;
rep(i,n){
toid[i]=ma[uf.root(i)].size();
ma[uf.root(i)].emplace_back(i);
}
vector<pair<lint,lint>>ans;
for(auto [s,v]:ma){
graph gr(v.size());
for(auto e:v){
for(auto to:g[e]){
gr[toid[e]].emplace_back(toid[to]);
}
}
auto res=tsort(gr);
if(v.size()==res.size()){
rep(i,(int)res.size()-1){
ans.emplace_back(v[res[i]],v[res[i+1]]);
}
}else{
rep(i,v.size()){
ans.emplace_back(v[i],v[(i+1)%v.size()]);
}
}
}
cout<<ans.size()<<endl;
for(auto [s,t]:ans){
cout<<s+1<<" "<<t+1<<endl;
}
}