結果
| 問題 | No.2197 Same Dish |
| ユーザー |
 KumaTachiRen
|
| 提出日時 | 2023-01-20 21:36:29 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 174 ms / 2,000 ms |
| コード長 | 11,744 bytes |
| コンパイル時間 | 11,528 ms |
| コンパイル使用メモリ | 167,640 KB |
| 実行使用メモリ | 30,592 KB |
| 最終ジャッジ日時 | 2024-06-23 09:30:04 |
| 合計ジャッジ時間 | 13,908 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 20 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (98 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System.Diagnostics;using System;using System.Linq;using System.Numerics;using System.Collections;using System.Collections.Generic;using System.IO;using System.Text;using static Functions;static class Program{static public void Main(string[] args){Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });new Solver();Console.Out.Flush();}}public class Solver{public Solver(){Solve();}void Solve(){int n = ri, k = ri;var lr = new List<(int l, int r)>();for (int i = 0; i < n; i++) lr.Add((ri - 1, ri - 1));lr.Sort((x1, x2) => x1.l - x2.l);ModInt ans = 1;int m = 200000;var seg = new SegTree<int, int>(m, (x, y) => x + y, 0, (f, x) => f + x);foreach ((int l, int r) in lr){int c = seg.Prod(l, m);ans *= Math.Max(k - c, 0);seg.Apply(r - 1, 1);}ans = new ModInt(k).Pow(n) - ans;Write(ans);}struct ModInt{private static long MOD = 998244353;long Val;public ModInt(long v) { Val = SafeMod(v, MOD); }public override string ToString() { return Val.ToString(); }public override bool Equals(object obj) => obj is ModInt other && this.Equals(other);public bool Equals(ModInt x) => Val == x.Val;public override int GetHashCode() => Val.GetHashCode();public static bool operator ==(ModInt a, ModInt b) { return a.Val == b.Val; }public static bool operator !=(ModInt a, ModInt b) { return a.Val != b.Val; }public static implicit operator ModInt(long n){long r = n % MOD;return new ModInt(r < 0 ? r + MOD : r);}public static ModInt operator +(ModInt a, ModInt b){long r = a.Val + b.Val;return new ModInt(r < MOD ? r : r - MOD);}public static ModInt operator -(ModInt a, ModInt b){long r = a.Val - b.Val;return new ModInt(r < 0 ? r + MOD : r);}public static ModInt operator -(ModInt a) => new ModInt(a.Val == 0 ? 0 : MOD - a.Val);public static ModInt operator *(ModInt a, ModInt b) => new ModInt(a.Val * b.Val % MOD);public static ModInt operator /(ModInt a, ModInt b) => a * b.Inv();public ModInt Pow(long n){long t = Val, r = 1;while (n > 0){if ((n & 1) == 1) r = r * t % MOD;t = t * t % MOD;n >>= 1;}return new ModInt(r);}public ModInt Inv(){var r = Gcd(Val, MOD);Debug.Assert(r.g == 1);return r.x;}private static (long x, long y, long g) Gcd(long a, long b){// 0 <= x < bif (b == 0) return a >= 0 ? (1, 0, a) : (-1, 0, -a);long c = a % b;if (c < 0) c += b;var r = Gcd(b, c);long x = SafeMod(r.y, b);long g = r.g;long y = (g - a * x) / b;return (x, y, g);}private static long SafeMod(long x, long m){long r = x % m;return r < 0 ? r + m : r;}}public class SegTree<S, F>{int _n, log, size;S _e;Func<S, S, S> _op;Func<F, S, S> _mapping;S[] d;public SegTree(int sz, Func<S, S, S> op, S e, Func<F, S, S> mapping) : this(Enumerable.Repeat(e, sz).ToArray(), op, e, mapping) { }public SegTree(S[] v, Func<S, S, S> op, S e, Func<F, S, S> mapping){_op = op;_e = e;_mapping = mapping;_n = v.Length;log = 0;while (1 << log < _n) { log++; }size = 1 << log;d = Enumerable.Repeat(_e, 2 * size).ToArray();for (int i = 0; i < _n; i++) { d[size + i] = v[i]; }for (int i = size - 1; i > 0; i--) { Update(i); }}public void Update(int p) { d[p] = _op(d[2 * p], d[2 * p + 1]); }public void Set(int p, S x){p += size;d[p] = x;for (int i = 1; i <= log; i++) Update(p >> i);}public void Apply(int p, F x) { Set(p, _mapping(x, d[p + size])); }public S Get(int p) { return d[p + size]; }public S Prod(int l, int r) { return Prod(l, r, 0, size, 1); }public S Prod(int l, int r, int x, int y, int k){if (l >= y || r <= x) return _e;if (l <= x && r >= y) return d[k];return _op(Prod(l, r, x, (x + y) / 2, 2 * k), Prod(l, r, (x + y) / 2, y, 2 * k + 1));}}int[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 };//int[] dx = { 1, 1, 0, -1, -1, -1, 0, 1 }, dy = { 0, 1, 1, 1, 0, -1, -1, -1 };bool Safe(int x, int y, int h, int w) => 0 <= x && x < h && 0 <= y && y < w;const long INF = 1L << 60;int ri { get { return (int)sc.Integer(); } }long rl { get { return sc.Integer(); } }ulong rul { get { return sc.UInteger(); } }double rd { get { return sc.Double(); } }string rs { get { return sc.Scan(); } }string rline { get { return sc.Line(); } }public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();void WriteJoin<T>(string s, IEnumerable<T> t) { Console.WriteLine(string.Join(s, t)); }void WriteMat<T>(T[,] a){int sz1 = a.GetLength(0);int sz2 = a.GetLength(1);for (int i = 0; i < sz1; i++){var s = new List<string>();for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString());WriteJoin(" ", s);}}void WriteMax(params long[] x) => Console.WriteLine(x.Max());void WriteMin(params long[] x) => Console.WriteLine(x.Min());void Write(object t) => Console.WriteLine(t.ToString());void Write(string str, object arg1) => Console.WriteLine(str, arg1);void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);void Write(string str, params object[] arg) => Console.WriteLine(str, arg);void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }void WriteError(object t) { Console.Error.WriteLine(t.ToString()); }void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }}public static class Functions{public static int Popcount(ulong x){x = x - ((x >> 1) & 0x5555555555555555UL);x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fUL;x = x + (x >> 8);x = x + (x >> 16);x = x + (x >> 32);return (int)(x & 0x0000007fUL);}public static int Ctz(long x){if (x == 0) return -1;return Popcount((ulong)((x & -x) - 1));}public static int SafeMod(int x, int m){int r = x % m;return r < 0 ? r + m : r;}public static long SafeMod(long x, long m){long r = x % m;return r < 0 ? r + m : r;}public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }public static int LowerBound<T>(in T[] arr, Func<T, int> comp, int l = -1, int r = -1){if (arr.Length == 0) return -1;if (l == -1) l = 0;if (r == -1) r = arr.Length;while (l < r){int x = (l + r) / 2;if (comp(arr[x]) < 0) l = x + 1;else r = x;}return l;}public static int LowerBound<T>(in List<T> list, Func<T, int> comp, int l = -1, int r = -1){if (list.Count == 0) return -1;if (l == -1) l = 0;if (r == -1) r = list.Count;while (l < r){int x = (l + r) / 2;if (comp(list[x]) < 0) l = x + 1;else r = x;}return l;}public static int UpperBound<T>(in List<T> list, Func<T, int> comp, int l = -1, int r = -1){if (list.Count == 0) return 0;if (comp(list.Last()) < 0) return list.Count;if (l == -1) l = 0;if (r == -1) r = list.Count;while (l < r){int x = (l + r) / 2;if (comp(list[x]) <= 0) l = x + 1;else r = x;}return l;}}public class StreamScanner{public StreamScanner(Stream stream) { str = stream; }private readonly Stream str;private readonly byte[] buf = new byte[1024];private int len, ptr;public bool isEof = false;public bool IsEndOfStream { get { return isEof; } }private byte read(){if (isEof) throw new EndOfStreamException();if (ptr >= len){ptr = 0;if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; }}return buf[ptr++];}public char Char(){byte b = 0;do b = read();while (b < 33 || 126 < b);return (char)b;}public string Line(){var sb = new StringBuilder();for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);return sb.ToString();}public string Scan(){var sb = new StringBuilder();for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);return sb.ToString();}public long Integer(){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 * 10 + b - '0';}}public ulong UInteger(){ulong ret = 0; byte b = 0;do b = read();while (b < '0' || '9' < b);for (; true; b = read()){if (b < '0' || '9' < b) return ret;else ret = ret * 10 + b - '0';}}public double Double() { return double.Parse(Scan()); }}