結果
問題 | No.1194 Replace |
ユーザー | heno239 |
提出日時 | 2020-08-22 14:21:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 462 ms / 2,000 ms |
コード長 | 5,035 bytes |
コンパイル時間 | 1,880 ms |
コンパイル使用メモリ | 135,980 KB |
実行使用メモリ | 97,856 KB |
最終ジャッジ日時 | 2024-10-15 08:35:37 |
合計ジャッジ時間 | 10,188 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 304 ms
69,264 KB |
testcase_01 | AC | 328 ms
72,008 KB |
testcase_02 | AC | 264 ms
62,520 KB |
testcase_03 | AC | 213 ms
56,432 KB |
testcase_04 | AC | 325 ms
72,000 KB |
testcase_05 | AC | 306 ms
68,500 KB |
testcase_06 | AC | 277 ms
65,560 KB |
testcase_07 | AC | 450 ms
97,712 KB |
testcase_08 | AC | 451 ms
97,712 KB |
testcase_09 | AC | 450 ms
97,732 KB |
testcase_10 | AC | 461 ms
97,732 KB |
testcase_11 | AC | 462 ms
97,664 KB |
testcase_12 | AC | 454 ms
97,856 KB |
testcase_13 | AC | 240 ms
47,716 KB |
testcase_14 | AC | 204 ms
42,180 KB |
testcase_15 | AC | 199 ms
46,060 KB |
testcase_16 | AC | 236 ms
48,016 KB |
testcase_17 | AC | 174 ms
43,404 KB |
testcase_18 | AC | 169 ms
39,660 KB |
testcase_19 | AC | 247 ms
49,428 KB |
testcase_20 | AC | 17 ms
19,780 KB |
testcase_21 | AC | 18 ms
19,780 KB |
testcase_22 | AC | 18 ms
19,908 KB |
testcase_23 | AC | 90 ms
31,892 KB |
testcase_24 | AC | 40 ms
24,772 KB |
testcase_25 | AC | 25 ms
20,672 KB |
testcase_26 | AC | 90 ms
28,780 KB |
testcase_27 | AC | 29 ms
21,184 KB |
testcase_28 | AC | 52 ms
24,100 KB |
testcase_29 | AC | 21 ms
20,800 KB |
ソースコード
#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<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 998244353;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#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;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}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)); }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];}ul gcd(ul a, ul b) {if (a < b)swap(a, b);while (b) {ul r = a % b; a = b; b = r;}return a;}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;}vector<int> query() {vector<int> res(n);vector<int> ma(mk);per(i, mk) {for (int id : ori[i]) {ma[i] = max(ma[i], id);}for (int to : fG[i]) {ma[i] = max(ma[i], ma[to]);}for (int id : ori[i]) {res[id] = ma[i];}}return res;}};void solve() {ll s; cin >> s;int m; cin >> m;vector<int> b(m), c(m);vector<int> vx;rep(i, m) {cin >> b[i] >> c[i];vx.push_back(b[i]);vx.push_back(c[i]);}sort(all(vx));vx.erase(unique(all(vx)), vx.end());int n = vx.size();ll ans = (ll)s * (s + 1) / 2;rep(i, vx.size())ans -= vx[i];rep(i, m) {b[i] = lower_bound(all(vx), b[i]) - vx.begin();c[i] = lower_bound(all(vx), c[i])-vx.begin();}graph g(n);rep(i, m) {g.add_edge(b[i], c[i]);}g.scc();vector<int> col = g.query();rep(i, n) {ans += vx[col[i]];}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);init_f();//expr();//int t; cin >> t; rep(i, t)//while (cin >> n >> m>>s1>>s2>>t, n)solve();return 0;}