結果

問題 No.1194 Replace
ユーザー suta28407928suta28407928
提出日時 2020-08-23 02:57:24
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,148 ms / 2,000 ms
コード長 4,062 bytes
コンパイル時間 1,260 ms
コンパイル使用メモリ 116,868 KB
実行使用メモリ 89,684 KB
最終ジャッジ日時 2024-04-27 03:26:17
合計ジャッジ時間 17,789 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 658 ms
66,368 KB
testcase_01 AC 706 ms
68,860 KB
testcase_02 AC 527 ms
60,932 KB
testcase_03 AC 448 ms
55,856 KB
testcase_04 AC 714 ms
68,824 KB
testcase_05 AC 659 ms
65,924 KB
testcase_06 AC 568 ms
63,364 KB
testcase_07 AC 1,089 ms
89,672 KB
testcase_08 AC 1,125 ms
89,684 KB
testcase_09 AC 1,123 ms
89,600 KB
testcase_10 AC 1,132 ms
89,580 KB
testcase_11 AC 1,118 ms
89,628 KB
testcase_12 AC 1,148 ms
89,560 KB
testcase_13 AC 498 ms
49,756 KB
testcase_14 AC 387 ms
45,924 KB
testcase_15 AC 347 ms
47,076 KB
testcase_16 AC 451 ms
49,824 KB
testcase_17 AC 305 ms
44,904 KB
testcase_18 AC 304 ms
43,040 KB
testcase_19 AC 479 ms
50,608 KB
testcase_20 AC 11 ms
27,104 KB
testcase_21 AC 10 ms
27,252 KB
testcase_22 AC 10 ms
27,228 KB
testcase_23 AC 130 ms
36,100 KB
testcase_24 AC 47 ms
31,388 KB
testcase_25 AC 22 ms
28,068 KB
testcase_26 AC 147 ms
35,240 KB
testcase_27 AC 29 ms
28,228 KB
testcase_28 AC 65 ms
31,128 KB
testcase_29 AC 16 ms
28,012 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

ll modpow(ll x, ll n, ll mod){
	ll res = 1;
	while(n > 0){
		if(n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

vector<ll> fac(MAX), finv(MAX), inv(MAX);

void comInit(){
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(ll i=2; i<MAX; i++){
		fac[i] = fac[i-1]*i % mod;
		inv[i] = mod - inv[mod%i] * (mod/i) % mod;
		finv[i] = finv[i-1] * inv[i] % mod;
	}
}


ll com(ll n, ll k){
	if(n < k) return 0;
	if(n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}

map<ll,vl> edge;

int main(){
	ll n,m; cin >> n >> m;
	rep(i,m){
		int b,c; cin >> b >> c; b--; c--;
		edge[c].push_back(b);
	}
	ll ans = n * (n+1) / 2;
	map<ll,ll> after;
	function<void(int,int)> dfs = [&](int u, int M) {
		chmax(after[u], M);
		for(auto v : edge[u]){
			if(after.find(v) != after.end()) continue;
			else{
				dfs(v,M);
			}
		}
	};
	for(auto itr = edge.rbegin(); itr != edge.rend(); itr++){
		if(after.find((*itr).first) != after.end()) continue;
		dfs((*itr).first, (*itr).first+1); 
	}
	for(auto i : after){
		ans += max(0LL, i.second - i.first - 1);
	}
	cout << ans << "\n";
}
0