Submission #1517863
Source Code Expand
import std.stdio;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.ascii;
import std.concurrency;
void main() {
int N = readln.chomp.to!int;
int[] as = readln.split.to!(int[]).sort!"a<b".array;
if (!N.iota.map!(a => a+N%2).map!"a/2*2".map!(a => a+(N+1)%2).equal(as)) {
0.writeln;
return;
}
writeln(ModNum!(long, 10L^^9+7)(2) ^^ (N/2));
}
struct ModNum(T, T mod) if (__traits(isIntegral, T)) {
T value;
typeof(this) opBinary(string op)(typeof(this) that) if (op=="+" || op=="-" || op=="*") {
mixin("return typeof(this)((this.value"~op~"that.value+mod)%mod);");
}
typeof(this) opBinary(string op)(typeof(this) that) if (op == "/") {
return this*getReciprocal(that);
}
typeof(this) opBinary(string op)(typeof(this) that) if (op == "^^") {
return typeof(this)(modPow(this.value, that.value));
}
typeof(this) opBinary(string op, S)(S that) if (op == "^^" && __traits(isIntegral, S)) {
return typeof(this)(modPow(this.value, that));
}
void opOpAssign(string op)(typeof(this) that) if (op=="+" || op=="-" || op=="*" || op=="/") {
mixin("this = this" ~op~ "that;");
}
typeof(this) getReciprocal(typeof(this) x) in {
debug {
assert(isPrime(mod));
}
} body {
return typeof(this)(modPow(x.value, mod-2));
}
T modPow(T base, T power) {
T result = 1;
for (; power > 0; power >>= 1) {
if (power & 1) {
result = (result * base) % mod;
}
base = base^^2 % mod;
}
return result;
}
string toString() {
import std.conv;
return this.value.to!string;
}
invariant() {
assert(this.value>=0);
assert(this.value<mod);
}
bool isPrime(T n) {
if (n<2) {
return false;
} else if (n==2) {
return true;
} else if (n%2==0) {
return false;
} else {
for(T i=3; i*i<=n; i+=2) {
if (n%i==0) return false;
}
return true;
}
}
}
// ----------------------------------------------
void times(alias fun)(int n) {
// n.iota.each!(i => fun());
foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(int n) {
// return n.iota.map!(i => fun()).array;
T[] res = new T[n];
foreach(ref e; res) e = fun();
return res;
}
// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
template fold(fun...) if (fun.length >= 1) {
auto fold(R, S...)(R r, S seed) {
static if (S.length < 2) {
return reduce!fun(seed, r);
} else {
return reduce!fun(tuple(seed), r);
}
}
}
}
// cumulativeFold was added in D 2.072.0
static if (__VERSION__ < 2072) {
template cumulativeFold(fun...)
if (fun.length >= 1)
{
import std.meta : staticMap;
private alias binfuns = staticMap!(binaryFun, fun);
auto cumulativeFold(R)(R range)
if (isInputRange!(Unqual!R))
{
return cumulativeFoldImpl(range);
}
auto cumulativeFold(R, S)(R range, S seed)
if (isInputRange!(Unqual!R))
{
static if (fun.length == 1)
return cumulativeFoldImpl(range, seed);
else
return cumulativeFoldImpl(range, seed.expand);
}
private auto cumulativeFoldImpl(R, Args...)(R range, ref Args args)
{
import std.algorithm.internal : algoFormat;
static assert(Args.length == 0 || Args.length == fun.length,
algoFormat("Seed %s does not have the correct amount of fields (should be %s)",
Args.stringof, fun.length));
static if (args.length)
alias State = staticMap!(Unqual, Args);
else
alias State = staticMap!(ReduceSeedType!(ElementType!R), binfuns);
foreach (i, f; binfuns)
{
static assert(!__traits(compiles, f(args[i], e)) || __traits(compiles,
{ args[i] = f(args[i], e); }()),
algoFormat("Incompatible function/seed/element: %s/%s/%s",
fullyQualifiedName!f, Args[i].stringof, E.stringof));
}
static struct Result
{
private:
R source;
State state;
this(R range, ref Args args)
{
source = range;
if (source.empty)
return;
foreach (i, f; binfuns)
{
static if (args.length)
state[i] = f(args[i], source.front);
else
state[i] = source.front;
}
}
public:
@property bool empty()
{
return source.empty;
}
@property auto front()
{
assert(!empty, "Attempting to fetch the front of an empty cumulativeFold.");
static if (fun.length > 1)
{
import std.typecons : tuple;
return tuple(state);
}
else
{
return state[0];
}
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty cumulativeFold.");
source.popFront;
if (source.empty)
return;
foreach (i, f; binfuns)
state[i] = f(state[i], source.front);
}
static if (isForwardRange!R)
{
@property auto save()
{
auto result = this;
result.source = source.save;
return result;
}
}
static if (hasLength!R)
{
@property size_t length()
{
return source.length;
}
}
}
return Result(range, args);
}
}
}
// minElement/maxElement was added in D 2.072.0
static if (__VERSION__ < 2072) {
auto minElement(alias map, Range)(Range r)
if (isInputRange!Range && !isInfinite!Range)
{
alias mapFun = unaryFun!map;
auto element = r.front;
auto minimum = mapFun(element);
r.popFront;
foreach(a; r) {
auto b = mapFun(a);
if (b < minimum) {
element = a;
minimum = b;
}
}
return element;
}
auto maxElement(alias map, Range)(Range r)
if (isInputRange!Range && !isInfinite!Range)
{
alias mapFun = unaryFun!map;
auto element = r.front;
auto maximum = mapFun(element);
r.popFront;
foreach(a; r) {
auto b = mapFun(a);
if (b > maximum) {
element = a;
maximum = b;
}
}
return element;
}
}
Submission Info
Submission Time |
|
Task |
C - Lining Up |
User |
arkark |
Language |
D (DMD64 v2.070.1) |
Score |
300 |
Code Size |
7943 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
4284 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_invalid_01.txt, subtask_1_invalid_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_valid_01.txt, subtask_1_max_valid_02.txt, subtask_1_min_valid_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_valid_01.txt, subtask_1_valid_02.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_invalid_01.txt |
AC |
23 ms |
3220 KB |
subtask_1_invalid_02.txt |
AC |
5 ms |
892 KB |
subtask_1_max_01.txt |
AC |
27 ms |
4284 KB |
subtask_1_max_02.txt |
AC |
27 ms |
4156 KB |
subtask_1_max_valid_01.txt |
AC |
28 ms |
3580 KB |
subtask_1_max_valid_02.txt |
AC |
28 ms |
3388 KB |
subtask_1_min_valid_01.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_01.txt |
AC |
17 ms |
3876 KB |
subtask_1_rand_02.txt |
AC |
25 ms |
3688 KB |
subtask_1_valid_01.txt |
AC |
15 ms |
3140 KB |
subtask_1_valid_02.txt |
AC |
6 ms |
1020 KB |