#730866 (C++17) No.1813 Magical Stones

提出ソース

結果

問題	No.1813 Magical Stones
ユーザー	heno239
提出日時	2022-01-14 22:19:39
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	132 ms / 2,000 ms
コード長	5,571 bytes
コンパイル時間	2,753 ms
コンパイル使用メモリ	170,380 KB
実行使用メモリ	30,320 KB
最終ジャッジ日時	2024-11-20 11:37:41
合計ジャッジ時間	6,149 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 11,648 KB
testcase_01	AC	8 ms 11,648 KB
testcase_02	AC	8 ms 11,520 KB
testcase_03	AC	30 ms 25,112 KB
testcase_04	AC	9 ms 11,588 KB
testcase_05	AC	9 ms 11,584 KB
testcase_06	AC	11 ms 12,288 KB
testcase_07	AC	8 ms 11,716 KB
testcase_08	AC	9 ms 11,716 KB
testcase_09	AC	9 ms 11,844 KB
testcase_10	AC	9 ms 11,848 KB
testcase_11	AC	32 ms 16,712 KB
testcase_12	AC	8 ms 11,584 KB
testcase_13	AC	9 ms 11,520 KB
testcase_14	AC	30 ms 25,112 KB
testcase_15	AC	120 ms 30,300 KB
testcase_16	AC	124 ms 30,288 KB
testcase_17	AC	113 ms 30,236 KB
testcase_18	AC	116 ms 30,296 KB
testcase_19	AC	116 ms 30,296 KB
testcase_20	AC	112 ms 30,308 KB
testcase_21	AC	116 ms 30,284 KB
testcase_22	AC	132 ms 30,320 KB
testcase_23	AC	120 ms 30,288 KB
testcase_24	AC	9 ms 11,904 KB
testcase_25	AC	23 ms 14,792 KB
testcase_26	AC	13 ms 12,608 KB
testcase_27	AC	80 ms 25,392 KB
testcase_28	AC	87 ms 23,168 KB
testcase_29	AC	89 ms 26,228 KB
testcase_30	AC	85 ms 24,980 KB
testcase_31	AC	107 ms 29,444 KB
testcase_32	AC	9 ms 11,648 KB
testcase_33	AC	9 ms 11,520 KB
testcase_34	AC	12 ms 12,160 KB
testcase_35	AC	18 ms 12,416 KB
testcase_36	AC	11 ms 12,288 KB
testcase_37	AC	31 ms 14,080 KB
testcase_38	AC	29 ms 20,804 KB
testcase_39	AC	80 ms 25,852 KB
testcase_40	AC	11 ms 12,416 KB
testcase_41	AC	11 ms 11,972 KB
testcase_42	AC	18 ms 12,616 KB
testcase_43	AC	15 ms 12,672 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

/////////////////////////////////
struct graph {
private:
	int n;
	vector<vector<int>> G, rG;
	vector<bool> used;
	vector<int> vs;

	int mk;
	vector<vector<int>> fG;
	vector<vector<int>> ori;
	vector<int> trans;
public:
	graph(int sz) {
		n = sz;
		G.resize(n);
		rG.resize(n);
		used.resize(n);

		fG.resize(n);
		trans.resize(n, -1);
		ori.resize(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;
		rep(i, G[v].size()) {
			if (!used[G[v][i]])dfs(G[v][i]);
		}
		vs.push_back(v);
	}
	void rdfs(int v, int k) {
		used[v] = true;
		queue<int> q; q.push(v);
		vector<int> c;
		while (!q.empty()) {
			int id = q.front(); q.pop();
			ori[k].push_back(id);
			rep(j, rG[id].size()) {
				int to = rG[id][j];
				if (used[to]) {
					if (trans[to] >= 0)c.push_back(trans[to]);
					continue;
				}
				used[to] = true; q.push(to);
			}
		}
		sort(c.begin(), c.end());
		int len = unique(c.begin(), c.end()) - c.begin();
		rep(i, len) {
			fG[c[i]].push_back(k);
		}
		rep(i, ori[k].size()) {
			trans[ori[k][i]] = k;
		}
	}
	void scc() {
		fill(used.begin(), used.end(), false);
		rep(i, n) {
			if (!used[i])dfs(i);
		}
		fill(used.begin(), used.end(), false);
		int k = 0;
		per(i, (int)vs.size()) {
			if (!used[vs[i]]) {
				rdfs(vs[i], k); k++;
			}
		}
		mk = k;
	}
	int query() {
		if (mk == 1)return 0;
		int ans = 0;
		int cnt2 = 0;
		vector<bool> used(mk);
		vector<int> cnt(mk);
		rep(i, mk)for (int to : fG[i])cnt[to] = 1;
		int x = 0, y = 0, z = 0;
		rep(i, mk) {
			if (cnt[i] == 0 && fG[i].empty())z++;
			else if (cnt[i] == 0)x++;
			else if (fG[i].empty())y++;
		}
		return max(x, y)+z;
	}
};
void solve() {
	int n, m; cin >> n >> m;
	graph g(n);
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		g.add_edge(a, b);
	}
	g.scc();
	int ans = g.query();
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//useexpr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード