結果
問題 | No.1401 全自動マクロの作り方 |
ユーザー |
![]() |
提出日時 | 2020-11-28 14:22:00 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 3,153 ms |
コード長 | 3,941 bytes |
コンパイル時間 | 14,156 ms |
コンパイル使用メモリ | 294,876 KB |
最終ジャッジ日時 | 2025-01-16 09:20:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 7 |
ソースコード
#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)output(i);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#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)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 returnvector(arg,make_vector<T>(x,args...));}#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))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;}//#include "../graph_tree/graph_template.hpp"template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}#line 4 "cpplib/graph_tree/topological_sort.hpp"/*** @brief トポロジカルソート*/std::vector<int>tsort(std::vector<std::vector<int>>G){std::vector<int> visited(G.size(),0);std::vector<int> start(G.size(),1);for(int i=0;i<(int)G.size();i++)for(int j=0;j<(int)G[i].size();j++){start[G[i][j]]=0;}std::vector<int>res;auto f=[&](auto f,int v)->void{if(visited[v])return;for(auto t:G[v])f(f,t);res.push_back(v);visited[v]=1;};for(int i=0;i<(int)G.size();i++)if(start[i])f(f,i);std::reverse(res.begin(),res.end());return res;}#line 3 "code.cpp"int main(){lint n;cin>>n;vector<vector<int>> g(2000);rep(i,n){lint d;cin>>d;vec v(d);rep(i,d)cin>>v[i];if(v[0]!=v.back())g[v[0]].push_back(v.back());}auto d=tsort(g);if(d.size()!=2000){cout<<0<<endl;}else{cout<<d.size()<<endl;output(d);}}