結果

問題 No.1084 積の積
ユーザー daut-dlangdaut-dlang
提出日時 2020-06-19 23:07:18
言語 D
(dmd 2.106.1)
結果
WA  
実行時間 -
コード長 4,012 bytes
コンパイル時間 798 ms
コンパイル使用メモリ 107,252 KB
実行使用メモリ 13,468 KB
最終ジャッジ日時 2023-09-04 08:15:19
合計ジャッジ時間 5,600 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 10 ms
5,308 KB
testcase_06 AC 325 ms
12,692 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 19 ms
6,472 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 6 ms
4,380 KB
testcase_12 AC 77 ms
8,928 KB
testcase_13 AC 175 ms
12,724 KB
testcase_14 AC 55 ms
6,068 KB
testcase_15 AC 50 ms
6,248 KB
testcase_16 AC 201 ms
12,560 KB
testcase_17 AC 70 ms
7,368 KB
testcase_18 AC 124 ms
9,812 KB
testcase_19 AC 176 ms
13,008 KB
testcase_20 AC 33 ms
6,108 KB
testcase_21 AC 56 ms
5,712 KB
testcase_22 AC 41 ms
5,636 KB
testcase_23 AC 99 ms
9,296 KB
testcase_24 AC 89 ms
10,332 KB
testcase_25 AC 174 ms
12,804 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

T binarySearch(alias pred, T)(T ok, T ng)
{ 
	while (abs(ok-ng) > 1)
	{
		auto mid = (ok+ng)/2;
		if (unaryFun!pred(mid)) ok = mid;
		else ng = mid;
	}
	return ok;
}

struct SegTree(T)
{
	T delegate(const(T), const(T)) f;
	T[] data;
	T init;
    this(T[] _data, T delegate(const(T), const(T)) _f, T _init)
    {
		f = _f; init = _init;
		size_t n = 1; while (n < _data.length) n *= 2; data.length = n*2-1;
		foreach (i; 0.._data.length) data[i+n-1] = _data[i];
		foreach (i; _data.length..n) data[i+n-1] = _init;
		foreach_reverse (i; 0..n-1) data[i] = f(data[i*2+1], data[i*2+2]);
	}
    T query(size_t l, size_t r) const
	{
        size_t n = (data.length+1) / 2; l += n-1; r += n-1; T res = f(init, data[l]);
        while (l < r)
		{
            if ((l & 1) == 0) res = f(res, data[l]);
            if ((r & 1) == 0) res = f(res, data[r-1]);
            l = l/2; r = (r-1)/2;
        }
        return res;
    }
	void update(size_t i, T v)
	{
		i += (data.length+1) / 2 - 1; data[i] = v;
		while (i != 0) { i = (i-1)/2; data[i] = f(data[i*2+1], data[i*2+2]); }
    }
}

void main()
{
	auto N = RD;
	auto A = RDA;

	bool ok = true;
	foreach (i; 0..N)
	{
		if (A[i] == 0)
			ok = false;
	}
	
	if (!ok)
	{
		writeln(0);
	}
	else
	{
		
		auto b = new long[2][](N);
		foreach (i; 0..N)
		{
			b[i] = [A[i], 0];
		}
		long[2] func(in long[2] x, in long[2] y)
		{
			long[2] z;
			z[0] = x[0] * y[0];
			z[1] = x[1] | y[1];
			z[1] |= z[0] >= 10^^9 ? 1 : 0;
			return z;
		}
		auto st = new SegTree!(long[2])(b, &func, [1, 0]);

		auto cnt = new long[](N+1);
		auto cnt2 = new long[](N+1);
		foreach (i; 0..N)
		{
			bool f(long j)
			{
				auto x = st.query(i, j+1);
				return x[1] == 0;
			}
			auto r = binarySearch!(f)(i, N);
			cnt[i] = r - i + 1;
			--cnt2[i];
			debug writeln("r:", min(i+cnt[i], N));
			++cnt2[min(i+cnt[i], N)];
		}
		debug writeln(cnt2);
		foreach (i; 0..N)
		{
			cnt2[i+1] += cnt2[i];
		}

		debug writeln(cnt);
		debug writeln(cnt2);
		long ans = 1;
		foreach (i; 0..N)
		{
			debug writeln("cnt[i]:", cnt[i]);
			auto x = A[i];
			x.modpow(cnt[i]);
			ans.modm(x);
			cnt[i+1] += cnt[i] + cnt2[i];
		}
		writeln(ans);
	}

	stdout.flush;
	debug readln;
}
0