#411710 (C++11) No.945 YKC饅頭

提出ソース

結果

問題	No.945 YKC饅頭
ユーザー	torisasami4
提出日時	2019-12-24 15:13:37
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	335 ms / 2,000 ms
コード長	6,172 bytes
コンパイル時間	960 ms
コンパイル使用メモリ	94,712 KB
実行使用メモリ	20,060 KB
最終ジャッジ日時	2024-09-22 02:01:40
合計ジャッジ時間	9,478 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	12 ms 18,688 KB
testcase_01	AC	12 ms 18,688 KB
testcase_02	AC	13 ms 18,688 KB
testcase_03	AC	13 ms 18,688 KB
testcase_04	AC	13 ms 18,688 KB
testcase_05	AC	12 ms 18,816 KB
testcase_06	AC	13 ms 18,816 KB
testcase_07	AC	13 ms 18,816 KB
testcase_08	AC	12 ms 18,816 KB
testcase_09	AC	13 ms 18,816 KB
testcase_10	AC	13 ms 18,816 KB
testcase_11	AC	13 ms 18,688 KB
testcase_12	AC	13 ms 18,688 KB
testcase_13	AC	13 ms 18,688 KB
testcase_14	AC	13 ms 18,816 KB
testcase_15	AC	12 ms 18,816 KB
testcase_16	AC	12 ms 18,688 KB
testcase_17	AC	13 ms 18,688 KB
testcase_18	AC	13 ms 18,816 KB
testcase_19	AC	12 ms 18,688 KB
testcase_20	AC	13 ms 18,816 KB
testcase_21	AC	13 ms 18,688 KB
testcase_22	AC	13 ms 18,816 KB
testcase_23	AC	13 ms 18,688 KB
testcase_24	AC	13 ms 18,816 KB
testcase_25	AC	12 ms 18,816 KB
testcase_26	AC	13 ms 18,816 KB
testcase_27	AC	13 ms 18,816 KB
testcase_28	AC	12 ms 18,816 KB
testcase_29	AC	13 ms 18,816 KB
testcase_30	AC	13 ms 18,816 KB
testcase_31	AC	18 ms 19,200 KB
testcase_32	AC	14 ms 19,328 KB
testcase_33	AC	36 ms 19,932 KB
testcase_34	AC	78 ms 19,328 KB
testcase_35	AC	118 ms 20,060 KB
testcase_36	AC	105 ms 18,944 KB
testcase_37	AC	96 ms 18,944 KB
testcase_38	AC	88 ms 19,072 KB
testcase_39	AC	29 ms 19,328 KB
testcase_40	AC	25 ms 20,060 KB
testcase_41	AC	17 ms 19,456 KB
testcase_42	AC	114 ms 19,328 KB
testcase_43	AC	91 ms 18,816 KB
testcase_44	AC	93 ms 19,936 KB
testcase_45	AC	127 ms 19,456 KB
testcase_46	AC	15 ms 19,456 KB
testcase_47	AC	77 ms 19,328 KB
testcase_48	AC	28 ms 18,944 KB
testcase_49	AC	39 ms 19,456 KB
testcase_50	AC	130 ms 19,328 KB
testcase_51	AC	144 ms 19,936 KB
testcase_52	AC	139 ms 19,932 KB
testcase_53	AC	141 ms 19,932 KB
testcase_54	AC	139 ms 20,060 KB
testcase_55	AC	140 ms 20,060 KB
testcase_56	AC	15 ms 19,936 KB
testcase_57	AC	14 ms 20,060 KB
testcase_58	AC	303 ms 19,932 KB
testcase_59	AC	335 ms 20,060 KB
testcase_60	AC	230 ms 19,932 KB
testcase_61	AC	311 ms 19,932 KB
testcase_62	AC	309 ms 19,932 KB
testcase_63	AC	31 ms 19,840 KB
testcase_64	AC	249 ms 19,928 KB
testcase_65	AC	213 ms 19,932 KB
testcase_66	AC	209 ms 19,932 KB
testcase_67	AC	272 ms 19,936 KB
testcase_68	AC	235 ms 20,060 KB
testcase_69	AC	130 ms 19,932 KB
testcase_70	AC	155 ms 20,056 KB
testcase_71	AC	156 ms 19,932 KB
testcase_72	AC	260 ms 19,932 KB
testcase_73	AC	320 ms 20,056 KB

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

ソースコード

raw source code

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<string>
#include<iomanip>
#include<math.h>
#include<bitset>
#include<functional>
using namespace std;
typedef long long ll;
#define lscan(x) scanf("%I64d",&x);
#define lprint(x) printf("%I64d",x);
ll gcd(ll a, ll b) {
	int c = a % b;
	while (c != 0) {
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
	if (b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	long long d = extGCD(b, a%b, y, x);
	y -= a / b * x;
	return d;
}
struct UnionFind {
	vector<int> par;

	UnionFind(int N) : par(N) {
		for (int i = 0; i < N; i++) par[i] = i;
	}

	int root(int x) {
		if (par[x] == x) return x;
		return par[x] = root(par[x]);
	}

	void unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		if (rx == ry) return;
		par[rx] = ry;
	}

	bool same(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		return rx == ry;
	}
};

ll M = 1000000007;

vector<ll> fac(1000001); //n!(mod M)
vector<ll> ifac(1000001); //k!^{M-2} (mod M)

ll mpow(ll x, ll n) {
	ll ans = 1;
	while (n != 0) {
		if (n & 1) ans = ans * x % M;
		x = x * x % M;
		n = n >> 1;
	}
	return ans;
}
ll mpow2(ll x, ll n, ll mod) {
	ll ans = 1;
	while (n != 0) {
		if (n & 1) ans = ans * x % mod;
		x = x * x % mod;
		n = n >> 1;
	}
	return ans;
}
void setcomb() {
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 1000000; i++) {
		fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
	}
	ifac[1000000] = mpow(fac[1000000], M - 2);
	for (ll i = 1000000; i > 0; i--) {
		ifac[i - 1] = ifac[i] * i%M;
	}
}
ll comb(ll a, ll b) {
	if (a == 0 && b == 0)return 1;
	if (a < b || a < 0)return 0;
	ll tmp = ifac[a - b] * ifac[b] % M;
	return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
	if (a == 0 && b == 0)return 1;
	if (a < b || a < 0)return 0;
	return fac[a] * ifac[a - b] % M;
}
long long modinv(long long a) {
	long long b = M, u = 1, v = 0;
	while (b) {
		long long t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= M;
	if (u < 0) u += M;
	return u;
}
vector<vector<ll>> mul(vector<vector<ll>> a, vector<vector<ll>> b, int n) {
	int i, j, k, t;
	vector<vector<ll>> c(n);
	for (i = 0; i < n; i++) {
		for (j = 0; j < n; j++) {
			t = 0;
			for (k = 0; k < n; k++)
				t = (t + a[i][k] * b[k][j] % M) % M;
			c[i].push_back(t);
		}
	}
	return c;
}

template< typename Monoid >
struct SegmentTree {
	using F = function< Monoid(Monoid, Monoid) >;

	int sz;
	vector< Monoid > seg;

	const F f;
	const Monoid M1;

	SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
		sz = 1;
		while (sz < n) sz <<= 1;
		seg.assign(2 * sz, M1);
	}

	void set(int k, const Monoid &x) {
		seg[k + sz] = x;
	}

	void build() {
		for (int k = sz - 1; k > 0; k--) {
			seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
		}
	}

	void update(int k, const Monoid &x) {
		k += sz;
		seg[k] = x;
		while (k >>= 1) {
			seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
		}
	}

	Monoid query(int a, int b) {
		Monoid L = M1, R = M1;
		for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
			if (a & 1) L = f(L, seg[a++]);
			if (b & 1) R = f(seg[--b], R);
		}
		return f(L, R);
	}

	Monoid operator[](const int &k) const {
		return seg[k + sz];
	}

	template< typename C >
	int find_subtree(int a, const C &check, Monoid &M, bool type) {
		while (a < sz) {
			Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
			if (check(nxt)) a = 2 * a + type;
			else M = nxt, a = 2 * a + 1 - type;
		}
		return a - sz;
	}


	template< typename C >
	int find_first(int a, const C &check) {
		Monoid L = M1;
		if (a <= 0) {
			if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);
			return -1;
		}
		int b = sz;
		for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
			if (a & 1) {
				Monoid nxt = f(L, seg[a]);
				if (check(nxt)) return find_subtree(a, check, L, false);
				L = nxt;
				++a;
			}
		}
		return -1;
	}

	template< typename C >
	int find_last(int b, const C &check) {
		Monoid R = M1;
		if (b >= sz) {
			if (check(f(seg[1], R))) return find_subtree(1, check, R, true);
			return -1;
		}
		int a = sz;
		for (b += sz; a < b; a >>= 1, b >>= 1) {
			if (b & 1) {
				Monoid nxt = f(seg[--b], R);
				if (check(nxt)) return find_subtree(b, check, R, true);
				R = nxt;
			}
		}
		return -1;
	}
};

template< unsigned mod >
struct RollingHash {
	vector< unsigned > hashed, power;

	inline unsigned mul(unsigned a, unsigned b) const {
		unsigned long long x = (unsigned long long) a * b;
		unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
		asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
		return m;
	}

	RollingHash(const string &s, unsigned base = 10007) {
		int sz = (int)s.size();
		hashed.assign(sz + 1, 0);
		power.assign(sz + 1, 0);
		power[0] = 1;
		for (int i = 0; i < sz; i++) {
			power[i + 1] = mul(power[i], base);
			hashed[i + 1] = mul(hashed[i], base) + s[i];
			if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
		}
	}

	unsigned get(int l, int r) const {
		unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
		if (ret >= mod) ret -= mod;
		return ret;
	}

	unsigned connect(unsigned h1, int h2, int h2len) const {
		unsigned ret = mul(h1, power[h2len]) + h2;
		if (ret >= mod) ret -= mod;
		return ret;
	}

	int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {
		int len = min(r1 - l1, r2 - l2);
		int low = -1, high = len + 1;
		while (high - low > 1) {
			int mid = (low + high) / 2;
			if (get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;
			else high = mid;
		}
		return (low);
	}
};

using RH = RollingHash< 1000000007 >;

int main() {
	ll n, m, i, ans[3],l,r;
	char t;
	vector<int> v;
	cin >> n >> m;
	for (i = 1; i <= n; i++)
		v.push_back(i);
	ans[0] = 0;
	ans[1] = 0;
	ans[2] = 0;
	for (i = 0; i < m; i++) {
		cin >> l >> r >> t;
		auto itr1= lower_bound(v.begin(), v.end(), l),itr2 = upper_bound(v.begin(),v.end(),r);
		if (t == 'Y')
			ans[0]+=itr2-itr1;
		else if (t == 'K')
			ans[1]+=itr2-itr1;
		else
			ans[2]+=itr2-itr1;
		v.erase(itr1, itr2);
	}
	cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
}

yukicoder

結果

テストケース

ソースコード