# include using namespace std; using ll = long long; using ull = unsigned long long; const double pi = acos(-1); templateconstexpr T inf() { return ::std::numeric_limits::max(); } templateconstexpr T hinf() { return inf() / 2; } template T_char TL(T_char cX) { return tolower(cX); } template T_char TU(T_char cX) { return toupper(cX); } template bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; } template bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; } int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; } int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; } int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; } ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); }; ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; }; ll MOD(ll x, ll m){return (x%m+m)%m; } ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; } template using dijk = priority_queue, greater>; # define all(qpqpq) (qpqpq).begin(),(qpqpq).end() # define UNIQUE(wpwpw) (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end()) # define LOWER(epepe) transform(all((epepe)),(epepe).begin(),TL) # define UPPER(rprpr) transform(all((rprpr)),(rprpr).begin(),TU) # define rep(i,upupu) for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++) # define reps(i,opopo) for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++) # define len(x) ((ll)(x).size()) # define bit(n) (1LL << (n)) # define pb push_back # define exists(c, e) ((c).find(e) != (c).end()) struct INIT{ INIT(){ std::ios::sync_with_stdio(false); std::cin.tie(0); cout << fixed << setprecision(20); } }INIT; namespace mmrz { void solve(); } int main(){ mmrz::solve(); } #define debug(...) (static_cast(0)) using namespace mmrz; struct scc_graph { int n; int k; vector> g; vector> rg; vector used; vector cmp; vector vs; scc_graph(int _n) : n(_n), k(0), g(n), rg(n), used(n), cmp(n) {} void add_edge(int a, int b) { g[a].push_back(b); rg[b].push_back(a); } void dfs(int v){ used[v] = true; for(auto to : g[v]){ if(not used[to])dfs(to); } vs.pb(v); } void rdfs(int v, int col){ used[v] = true; cmp[v] = col; for(auto to : rg[v]){ if(not used[to])rdfs(to, col); } } vector> scc() { for(int i = 0;i < n;i++){ if(not used[i])dfs(i); } for(int i = 0;i < n;i++){ used[i] = false; } for(auto i = vs.rbegin();i != vs.rend();i++){ if(not used[*i])rdfs(*i, k++); } vector> ret(k); for(int i = 0;i < n;i++){ ret[cmp[i]].push_back(i); } return ret; } }; void SOLVE(){ int n, m; cin >> n >> m; if(m == 0){ cout << "Happy" << endl; return; } scc_graph scc(n); int A = -1; while(m--){ int a, b; cin >> a >> b; a--, b--; scc.add_edge(a, b); } auto ret = scc.scc(); int ans = n; for(auto v : ret){ if(len(v) == 1)ans--; } if(ans == 0){ cout << "Happy" << endl; }else{ cout << ans << endl; } } void mmrz::solve(){ int t = 1; //cin >> t; while(t--)SOLVE(); }

提出日時	12/23 13:16:55
問題	K: Say!Yes!Kyosan Beam
ユーザ	MMRZ
言語	C++23 (g++ 12.2.0)
得点
結果	WJ