結果
| 問題 |
No.3262 水色コーダーさん、その問題d問題ですよ？（1<=d<=N）
|
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2025-09-06 13:10:19 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 59 ms / 2,000 ms |
| コード長 | 23,733 bytes |
| コンパイル時間 | 9,343 ms |
| コンパイル使用メモリ | 170,092 KB |
| 実行使用メモリ | 192,340 KB |
| 最終ジャッジ日時 | 2025-09-06 13:12:21 |
| 合計ジャッジ時間 | 11,898 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 24 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (155 ミリ秒)。 main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;
namespace Program
{
using static Library.LIB_Static;
public static class ProblemD
{
static bool SAIKI = false;
static public int numberOfRandomCases = 0;
static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
{
}
static public void Solve()
{
var N = NN;
var LR = Range(0, N).Select(_ => new { idx = _, L = NN, R = NN }).ToArray();
var ary = Range(0, N).ToArray();
var ans = 0L;
while (true)
{
LIB_Math.NextPermutation(ary);
var minX = -1L;
var ok = true;
foreach (var idx in ary)
{
var l = LR[idx].L;
var r = LR[idx].R;
minX = Max(minX, l);
if (minX > r) ok = false;
}
if (ok) ++ans;
var exit = true;
for (var i = 0; i < N; ++i)
{
if (i != ary[i]) exit = false;
}
if (exit) break;
}
Console.WriteLine(ans);
}
class Printer : StreamWriter
{
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
}
static LIB_FastIO fastio = new LIB_FastIODebug();
static string[] args;
static public void Main(string[] args_t) { args = args_t; if (args_t.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
static long NN => fastio.Long();
static double ND => fastio.Double();
static string NS => fastio.Scan();
static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
}
}
namespace Library {
class LIB_FastIO
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIO() { str = Console.OpenStandardInput(); }
readonly Stream str;
readonly byte[] buf = new byte[2048];
int len, ptr;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
byte read()
{
if (ptr >= len)
{
ptr = 0;
if ((len = str.Read(buf, 0, 2048)) <= 0)
{
return 0;
}
}
return buf[ptr++];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public long Long()
{
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = (ret << 3) + (ret << 1) + b - '0';
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
class LIB_FastIODebug : LIB_FastIO
{
Queue<string> param = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIODebug() { }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override string Scan() => NextString();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override long Long() => long.Parse(NextString());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override double Double() => double.Parse(NextString());
}
class LIB_BarrettReduction
{
ulong MOD;
ulong mh;
ulong ml;
const ulong ALL1_32 = (ulong)~0U;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_BarrettReduction(ulong mod)
{
MOD = mod;
var m = ~0UL / MOD;
unchecked { if (m * MOD + MOD == 0) ++m; }
mh = m >> 32;
ml = m & ALL1_32;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public ulong Reduce(ulong x)
{
var z = (x & ALL1_32) * ml;
z = (x & ALL1_32) * mh + (x >> 32) * ml + (z >> 32);
z = (x >> 32) * mh + (z >> 32);
x -= z * MOD;
return x < MOD ? x : x - MOD;
}
}
class LIB_MillerRabin
{
static readonly ulong[] a1 = new ulong[] { 2, 7, 61 };
static readonly ulong[] a21 = new ulong[] { 2, 325, 9375, 28178, 450775, 9780504 };
static readonly ulong[] a22 = new ulong[] { 2, 325, 9375, 28178, 450775, 9780504, 1795265022 };
static readonly byte[] smallPrimes = new byte[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251 };
static public bool IsPrime(ulong N)
{
if (N < 66049)
{
var n = (int)N;
if (n < 2) return false;
if ((n & 1) == 0) return n == 2;
if (n == 3) return true;
foreach (int p in smallPrimes)
{
if (p * p > n) break;
if (n % p == 0) return false;
}
return true;
}
if ((N & 1) == 0) return false;
if (1000000000 < N) return IsPrime64(N);
var br = new LIB_BarrettReduction(N);
var d = N - 1;
var cnt = 0;
while ((d & 1) == 0)
{
d >>= 1;
++cnt;
}
foreach (var item in a1)
{
var x = 1UL;
var d2 = d;
var num = item;
while (d2 > 0)
{
if ((d2 & 1) == 1) x = br.Reduce(x * num);
d2 >>= 1;
num = br.Reduce(num * num);
}
var i = 0;
for (; i < cnt; ++i)
{
if (x == 1 || x == N - 1) break;
x = br.Reduce(x * x);
}
if (i > 0 && x != N - 1) return false;
}
return true;
}
[MethodImpl(MethodImplOptions.AggressiveOptimization)]
static bool IsPrime64(ulong N)
{
unchecked
{
var T128 = (ulong)(-(UInt128)N % N);
var INV_MOD = N;
INV_MOD *= 2 - N * INV_MOD;
INV_MOD *= 2 - N * INV_MOD;
INV_MOD *= 2 - N * INV_MOD;
INV_MOD *= 2 - N * INV_MOD;
INV_MOD *= 2 - N * INV_MOD;
var NEG_INV = ~INV_MOD + 1;
var t = (UInt128)T128;
var ONE = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
t = ((UInt128)N - 1) * T128;
var MINUS_ONE = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
if (ONE >= N) ONE -= N;
if (MINUS_ONE >= N) MINUS_ONE -= N;
var d = N - 1;
var cnt = 0;
while ((d & 1) == 0)
{
d >>= 1;
++cnt;
}
var a2 = N < 1795265022 ? a21 : a22;
foreach (var item in a2)
{
var x = ONE;
var d2 = d;
t = (UInt128)item * T128;
var num = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
while (d2 > 0)
{
if ((d2 & 1) == 1)
{
t = (UInt128)x * num;
x = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
}
d2 >>= 1;
t = (UInt128)num * num;
num = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
}
var i = 0;
var v = x >= N ? x - N : x;
for (; i < cnt; ++i)
{
if (v == ONE || v == MINUS_ONE) break;
t = (UInt128)x * x;
x = (ulong)((t + (UInt128)((ulong)t * NEG_INV) * N) >> 64);
v = x >= N ? x - N : x;
}
if (i > 0 && v != MINUS_ONE) return false;
}
return true;
}
}
}
class LIB_Math
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public bool IsPrime(long x) => LIB_MillerRabin.IsPrime((ulong)x);
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public IEnumerable<long> Primes(long x)
{
if (x < 2) yield break;
yield return 2;
var halfx = x / 2;
var table = new bool[halfx + 1];
var max = (long)(Math.Sqrt(x) / 2);
for (long i = 1; i <= max; ++i)
{
if (table[i]) continue;
var add = 2 * i + 1;
yield return add;
for (long j = 2 * i * (i + 1); j <= halfx; j += add)
table[j] = true;
}
for (long i = max + 1; i <= halfx; ++i)
if (!table[i] && 2 * i + 1 <= x)
yield return 2 * i + 1;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public IEnumerable<long> Factors(long x)
{
if (x < 2) yield break;
while (x % 2 == 0)
{
x /= 2; yield return 2;
}
var max = (long)Math.Sqrt(x);
for (long i = 3; i <= max; i += 2)
{
while (x % i == 0)
{
x /= i; yield return i;
}
}
if (x != 1) yield return x;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public IEnumerable<long> Divisor(long x)
{
if (x < 1) yield break;
var max = (long)Math.Sqrt(x);
for (long i = 1; i <= max; ++i)
{
if (x % i != 0) continue;
yield return i;
if (i != x / i) yield return x / i;
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long GCD(long a, long b)
{
while (b > 0)
{
var tmp = b;
b = a % b;
a = tmp;
}
return a;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long LCM(long a, long b) => a / GCD(a, b) * b;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long Pow(long x, long y)
{
long a = 1;
while (y != 0)
{
if ((y & 1) == 1) a *= x;
if (x < long.MaxValue / x) x *= x;
y >>= 1;
}
return a;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public decimal Sqrt(decimal x)
{
decimal prev, cur = (decimal)Math.Sqrt((double)x);
do
{
prev = cur;
if (prev == 0) return 0;
cur = (prev + x / prev) / 2;
} while (cur != prev);
return cur;
}
static List<long> _fact = new List<long>() { 1 };
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static void Build(long n)
{
if (n >= _fact.Count)
for (int i = _fact.Count; i <= n; ++i) _fact.Add(_fact[i - 1] * i);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long Comb(long n, long k)
{
Build(n);
if (n == 0 && k == 0) return 1;
if (n < k || n < 0) return 0;
return _fact[(int)n] / _fact[(int)(n - k)] / _fact[(int)k];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long Perm(long n, long k)
{
Build(n);
if (n == 0 && k == 0) return 1;
if (n < k || n < 0) return 0;
return _fact[(int)n] / _fact[(int)(n - k)];
}
static public void PrevPermutation<T>(T[] ary) where T : IComparable<T>
{
var n = ary.Length;
var i = n - 1;
while (i - 1 >= 0 && ary[i - 1].CompareTo(ary[i]) <= 0) --i;
if (i > 0)
{
var j = i;
while (j + 1 < n && ary[i - 1].CompareTo(ary[j + 1]) > 0) ++j;
var tmp = ary[i - 1]; ary[i - 1] = ary[j]; ary[j] = tmp;
}
var s = i;
var t = n - 1;
while (t - s > 0)
{
var tmp = ary[t]; ary[t] = ary[s]; ary[s] = tmp;
++s; --t;
}
}
static public void NextPermutation<T>(T[] ary) where T : IComparable<T>
{
var n = ary.Length;
var i = n - 1;
while (i - 1 >= 0 && ary[i - 1].CompareTo(ary[i]) >= 0) --i;
if (i > 0)
{
var j = i;
while (j + 1 < n && ary[i - 1].CompareTo(ary[j + 1]) < 0) ++j;
var tmp = ary[i - 1]; ary[i - 1] = ary[j]; ary[j] = tmp;
}
var s = i;
var t = n - 1;
while (t - s > 0)
{
var tmp = ary[t]; ary[t] = ary[s]; ary[s] = tmp;
++s; --t;
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public (long, long) InvGCD(long a, long b)
{
a = (a + b) % b;
if (a == 0) return (b, 0);
var s = b;
var t = a;
var m0 = 0L;
var m1 = 1L;
while (t > 0)
{
var u = s / t; s -= t * u; m0 -= m1 * u;
var tmp = s; s = t; t = tmp;
tmp = m0; m0 = m1; m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return (s, m0);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public (long, long) CRT(long[] r, long[] m)
{
var r0 = 0L;
var m0 = 1L;
for (var i = 0; i < m.Length; i++)
{
var m1 = m[i];
var r1 = (r[i] + m1) % m1;
if (m0 < m1)
{
r0 ^= r1; r1 ^= r0; r0 ^= r1;
m0 ^= m1; m1 ^= m0; m0 ^= m1;
}
if (m0 % m1 == 0)
{
if (r0 % m1 != r1) return (0, 0);
continue;
}
var gim = InvGCD(m0, m1);
var u1 = m1 / gim.Item1;
if ((r1 - r0) % gim.Item1 != 0) return (0, 0);
var x = (r1 - r0) / gim.Item1 % u1 * gim.Item2 % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
}
return (r0, m0);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
static public long Phi(long n)
{
var ret = n;
for (var i = 2L; i * i <= n; ++i)
{
if (n % i == 0)
{
ret -= ret / i;
while (n % i == 0) n /= i;
}
}
if (n > 1) ret -= ret / n;
return ret;
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
/// <summary>
/// a*i + b
/// i=0...n-1
/// 格子高さm
/// </summary>
static public long FloorSum(long n, long m, long a, long b)
{
unchecked
{
var ans = 0UL;
var un = (ulong)n;
var um = (ulong)m;
var ua = (ulong)a;
var ub = (ulong)b;
if (a < 0)
{
var am = a % m;
if (am < 0) am += m;
var a2 = (ulong)am;
ans -= un * (un - 1) / 2 * ((a2 + (ulong)(-a)) / um);
ua = a2;
}
if (b < 0)
{
var bm = b % m;
if (bm < 0) bm += m;
var b2 = (ulong)bm;
ans -= un * ((b2 + (ulong)(-b)) / um);
ub = b2;
}
while (true)
{
if (ua >= um)
{
ans += (un - 1) * un / 2 * (ua / um);
ua %= um;
}
if (ub >= um)
{
ans += un * (ub / um);
ub %= um;
}
var ymax = ua * un + ub;
if (ymax < um) return (long)ans;
un = ymax / um;
ub = ymax % um;
um ^= ua; ua ^= um; um ^= ua;
}
}
}
static public long BabyStepGiantStep<T>(T init, T target, long step, Func<T, T> babyStep, Func<T, T> giantStep) where T : IEquatable<T>
{
// minimal check
var chk = init;
for (var i = 0; i < step; ++i)
{
if (chk.Equals(target)) return i;
chk = babyStep(chk);
}
var dic = new Dictionary<T, long>();
chk = target;
for (var i = 1; i <= step; ++i)
{
chk = babyStep(chk);
dic[chk] = i;
}
var now = init;
var fail = false;
for (var i = 1; i <= step; ++i)
{
var next = giantStep(now);
if (dic.ContainsKey(next))
{
chk = now;
for (var j = 0; j < step; ++j)
{
if (target.Equals(chk))
{
return (i - 1) * step + j;
}
chk = babyStep(chk);
}
if (fail) return -1;
fail = true;
}
now = next;
}
return -1;
}
}
static partial class LIB_Static
{
public static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
public static IEnumerator<uint> _xsi = _xsc();
public static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = 0; while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
public static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
public static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
public static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
public static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
public static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
public static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
public static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
public static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
public static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
public static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
public static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
public static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
public static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
public static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
public static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
public static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
public static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
public static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
}
}