結果
| 問題 | No.2543 Many Meetings |
| ユーザー |
 KumaTachiRen
|
| 提出日時 | 2023-11-24 22:32:39 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 17,976 bytes |
| コンパイル時間 | 7,383 ms |
| コンパイル使用メモリ | 168,556 KB |
| 実行使用メモリ | 185,708 KB |
| 最終ジャッジ日時 | 2024-09-26 09:35:52 |
| 合計ジャッジ時間 | 48,160 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 23 TLE * 17 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (84 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;using System.ComponentModel;using System.Collections;using System.Collections.Generic;using System.Diagnostics;using System.Diagnostics.Contracts;using System.IO;using System.Linq;using System.Numerics;using System.Runtime.Intrinsics.X86;using System.Runtime.CompilerServices;using System.Runtime.InteropServices;using System.Text;using static Functions;using static OutputLib;using ModInt = StaticModInt<Mod998244353>;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, ri));lr.Sort((p1, p2) => p1.r != p2.r ? p1.r - p2.r : p1.l - p2.l);var xset = new HashSet<int>();foreach (var (l, r) in lr) { xset.Add(l); xset.Add(r); }var xs = xset.ToArray();Array.Sort(xs);int m = xs.Length;var dic = new Dictionary<int, int>();for (int i = 0; i < m; i++) dic.Add(xs[i], i);const int log = 20;var seg = new SegTree<int, IntMinMonoid>[log];for (int i = 0; i < log; i++) seg[i] = new SegTree<int, IntMinMonoid>(m);foreach (var (l, r) in lr) seg[0].Set(dic[l], Math.Min(seg[0].Get(dic[l]), dic[r]));for (int l = 1; l < log; l++){for (int i = 0; i < m; i++){int idx = seg[l - 1].Prod(i, m);if (idx == int.MaxValue) continue;int val = seg[l - 1].Prod(idx, m);seg[l].Set(i, Math.Min(seg[l].Get(i), val));}}int ans = int.MaxValue;for (int l = 0; l < m; l++){int x = l, y = k;for (int i = 0; i < log; i++){if ((y & 1) == 1){x = seg[i].Prod(x, m);if (x == int.MaxValue) break;}y >>= 1;}if (x == int.MaxValue) continue;Chmin(ref ans, xs[x] - xs[l]);}if (ans == int.MaxValue) ans = -1;Write(ans);}const long INF = 1L << 60;int ri { [MethodImpl(256)] get => (int)sc.Integer(); }(int, int) ri2 { [MethodImpl(256)] get => (ri, ri); }(int, int, int) ri3 { [MethodImpl(256)] get => (ri, ri, ri); }(int, int, int, int) ri4 { [MethodImpl(256)] get => (ri, ri, ri, ri); }(int, int, int, int, int) ri5 { [MethodImpl(256)] get => (ri, ri, ri, ri, ri); }long rl { [MethodImpl(256)] get => sc.Integer(); }(long, long) rl2 { [MethodImpl(256)] get => (rl, rl); }(long, long, long) rl3 { [MethodImpl(256)] get => (rl, rl, rl); }(long, long, long, long) rl4 { [MethodImpl(256)] get => (rl, rl, rl, rl); }(long, long, long, long, long) rl5 { [MethodImpl(256)] get => (rl, rl, rl, rl, rl); }uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }ulong rul { [MethodImpl(256)] get => sc.UInteger(); }double rd { [MethodImpl(256)] get => sc.Double(); }string rs { [MethodImpl(256)] get => sc.Scan(); }string rline { [MethodImpl(256)] get => sc.Line(); }public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());}public static class Functions { [MethodImpl(256)] public static int Popcount(ulong x) { x = (x & 0x5555555555555555UL) + ((x >> 1) &0x5555555555555555UL); x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL); x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) &0x0f0f0f0f0f0f0f0fUL); x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL); x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) &0x0000ffff0000ffffUL); x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL); return (int)x; } [MethodImpl(256)] public static intPopcount(int x) { x = (x & 0x55555555) + ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f); x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff); x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff); return x; } [MethodImpl(256)]public static int Ctz(long x) { if (x == 0) return -1; return Popcount((ulong)((x & -x) - 1)); } [MethodImpl(256)] public static int CeilPow2(intn) { int x = 0; while ((1 << x) < n) x++; return x; } [MethodImpl(256)] public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r+ Math.Abs(m) : r; } [MethodImpl(256)] public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + Math.Abs(m) : r; }[MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int Sign(double x) => x == 0 ?0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return(int)s; } [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; [MethodImpl(256)] public static longCeil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);[MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static (long x, long y, long g)ExtGcd(long a, long b) { if (b == 0) return (Sign(a), 0, Math.Abs(a)); long c = SafeMod(a, b); var (x2, y2, g) = ExtGcd(b, c); long x = SafeMod(y2, b); long y = (g - a * x) / b; return (x, y, g); } [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y;} [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap<T>(refT x, ref T y) { T t = y; y = x; x = t; } [MethodImpl(256)] 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); [MethodImpl(256)] 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); [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y;} [MethodImpl(256)] public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => Sign(t - val), l,r); [MethodImpl(256)] public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => t - val, l, r);[MethodImpl(256)] public static int LowerBound<T>(T[] arr, T val, int l = -1, int r = -1) where T : IComparable<T> => LowerBound(arr.AsSpan(), t=> t.CompareTo(val), l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), comp, l, r); [MethodImpl(256)] public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1) { if (data.Length == 0) return -1; if (l == -1) l = 0; if (r == -1) r = data.Length; while (l < r) { int x = (l + r) / 2; if (comp(data[x]) < 0) l = x + 1;else r = x; } return l; } [MethodImpl(256)] public static string ToBase2(long v, int digit = -1) { if (digit == -1) { digit = 0; while ((v >>digit) > 0) digit++; } var c = new string[digit]; for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1"; returnstring.Join("", c); } [MethodImpl(256)] public static string ToBaseN(long v, int n, int digit = -1) { if (digit == -1) { digit = 0; long pow = 1;while (v >= pow) { digit++; pow *= n; } } var c = new int[digit]; for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n); returnstring.Join("", c); } }public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private readonly Stream str; private readonly byte[] buf = newbyte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } [MethodImpl(256)] private byteread() { if (isEof) throw new EndOfStreamException(); if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return0; } } return buf[ptr++]; } [MethodImpl(256)] public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; }[MethodImpl(256)] public string Line() { var sb = new StringBuilder(); for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);return sb.ToString(); } [MethodImpl(256)] 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(256)] 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'; } } [MethodImpl(256)] 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'; } } [MethodImpl(256)]public double Double() => double.Parse(Scan()); }public static class OutputLib { [MethodImpl(256)] public static void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t)); [MethodImpl(256)] public static void WriteMat<T>(T[,] a) { int sz1 = a.GetLength(0); int sz2 = a.GetLength(1); for (int i = 0; i < sz1; i++){ var b = new T[sz2]; for (int j = 0; j < sz2; j++) b[j] = a[i, j]; WriteJoin(" ", b); } } [MethodImpl(256)] public static void WriteMat<T>(T[][]a) { for (int i = 0; i < a.Length; i++) WriteJoin(" ", a[i]); } [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString()); [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str); [MethodImpl(256)] public static void Write(stringstr, object arg1) => Console.WriteLine(str, arg1); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3); [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg); [MethodImpl(256)] public static void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); } [MethodImpl(256)] public static voidWriteError(object t) => Console.Error.WriteLine(t.ToString()); [MethodImpl(256)] public static void Flush() => Console.Out.Flush(); [MethodImpl(256)] public static void YN(bool t) => Console.WriteLine(t ? "YES" : "NO"); [MethodImpl(256)] public static void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No"); [MethodImpl(256)] public static void yn(bool t) => Console.WriteLine(t ? "yes" : "no"); }public interface IStaticMod { uint Mod { get; } bool IsPrime { get; } } public readonly struct Mod1000000007 : IStaticMod { public uint Mod =>1000000007; public bool IsPrime => true; } public readonly struct Mod998244353 : IStaticMod { public uint Mod => 998244353; public bool IsPrime=> true; } public readonly struct StaticModInt<T> : IEquatable<StaticModInt<T>> where T : struct, IStaticMod { internal readonly uint _v; privatestatic readonly T op = default; public int Value => (int)_v; public static int Mod => (int)op.Mod; public static StaticModInt<T> Zero => default;public static StaticModInt<T> One => new StaticModInt<T>(1u); [MethodImpl(256)] public static StaticModInt<T> Raw(int v) { var u = unchecked((uint)v); return new StaticModInt<T>(u); } [MethodImpl(256)] public StaticModInt(long v) : this(Round(v)) { } [MethodImpl(256)] publicStaticModInt(ulong v) : this((uint)(v % op.Mod)) { } [MethodImpl(256)] private StaticModInt(uint v) => _v = v; [MethodImpl(256)] private staticuint Round(long v) { var x = v % op.Mod; if (x < 0) x += op.Mod; return (uint)x; } [MethodImpl(256)] public static StaticModInt<T> operator++(StaticModInt<T> v) { var x = v._v + 1; if (x == op.Mod) x = 0; return new StaticModInt<T>(x); } [MethodImpl(256)] public static StaticModInt<T> operator --(StaticModInt<T> v) { var x = v._v; if (x == 0) x = op.Mod; return new StaticModInt<T>(x - 1); } [MethodImpl(256)] public staticStaticModInt<T> operator +(StaticModInt<T> lhs, StaticModInt<T> rhs) { var v = lhs._v + rhs._v; if (v >= op.Mod) v -= op.Mod; return newStaticModInt<T>(v); } [MethodImpl(256)] public static StaticModInt<T> operator -(StaticModInt<T> lhs, StaticModInt<T> rhs) { unchecked { var v =lhs._v - rhs._v; if (v >= op.Mod) v += op.Mod; return new StaticModInt<T>(v); } } [MethodImpl(256)] public static StaticModInt<T> operator*(StaticModInt<T> lhs, StaticModInt<T> rhs) => new StaticModInt<T>((uint)((ulong)lhs._v * rhs._v % op.Mod)); [MethodImpl(256)] public staticStaticModInt<T> operator /(StaticModInt<T> lhs, StaticModInt<T> rhs) => new StaticModInt<T>((uint)((ulong)lhs._v * Inv(rhs._v) % op.Mod));[MethodImpl(256)] public static StaticModInt<T> operator +(StaticModInt<T> v) => v; [MethodImpl(256)] public static StaticModInt<T> operator-(StaticModInt<T> v) => new StaticModInt<T>(v._v == 0 ? 0 : op.Mod - v._v); [MethodImpl(256)] public static bool operator ==(StaticModInt<T> lhs,StaticModInt<T> rhs) => lhs._v == rhs._v; [MethodImpl(256)] public static bool operator !=(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs._v !=rhs._v; [MethodImpl(256)] public static implicit operator StaticModInt<T>(int v) => new StaticModInt<T>(v); [MethodImpl(256)] public staticimplicit operator StaticModInt<T>(uint v) => new StaticModInt<T>((long)v); [MethodImpl(256)] public static implicit operator StaticModInt<T>(longv) => new StaticModInt<T>(v); [MethodImpl(256)] public static implicit operator StaticModInt<T>(ulong v) => new StaticModInt<T>(v); [MethodImpl(256)] public static implicit operator long(StaticModInt<T> v) => v._v; [MethodImpl(256)] public static implicit operator ulong(StaticModInt<T> v) => v._v; [MethodImpl(256)] public StaticModInt<T> Pow(long n) { var x = this; var r = new StaticModInt<T>(1U); while (n > 0) { if ((n & 1) > 0)r *= x; x *= x; n >>= 1; } return r; } [MethodImpl(256)] public StaticModInt<T> Inv() => new StaticModInt<T>(Inv(_v)); [MethodImpl(256)] staticulong Inv(ulong x) { long u = op.Mod, xu = 1, yu = 0, v = (long)x, xv = 0, yv = 1; while (v != 0) { long w = SafeMod(u, v); long q = (u - w) / v;long xw = xu - xv * q; long yw = yu - yv * q; u = v; xu = xv; yu = yv; v = w; xv = xw; yv = yw; } return (ulong)(yu < 0 ? yu + op.Mod : yu); }[MethodImpl(256)] static long SafeMod(long x, long m) { long r = x % m; if (r < 0) r += m; return r; } [MethodImpl(256)] public override stringToString() => _v.ToString(); [MethodImpl(256)] public string ToString(string format, IFormatProvider formatProvider) => _v.ToString(format,formatProvider); [MethodImpl(256)] public override bool Equals(object obj) => obj is StaticModInt<T> m && Equals(m); [MethodImpl(256)] publicbool Equals(StaticModInt<T> other) => _v == other._v; [MethodImpl(256)] public override int GetHashCode() => _v.GetHashCode(); }public interface IMonoid<T> : IOperation<T>, IIdentity<T> { } public struct IntMinMonoid : IMonoid<int> { public int Identity => int.MaxValue; publicint Operate(int x, int y) => Math.Min(x, y); } public struct IntMaxMonoid : IMonoid<int> { public int Identity => int.MinValue; public intOperate(int x, int y) => Math.Max(x, y); } public struct LongMinMonoid : IMonoid<long> { public long Identity => long.MaxValue; public longOperate(long x, long y) => Math.Min(x, y); } public struct LongMaxMonoid : IMonoid<long> { public long Identity => long.MinValue; public longOperate(long x, long y) => Math.Max(x, y); }public class SegTree<T, Op> where Op : struct, IMonoid<T> { private static readonly Op op = default; public int Length { get; } readonly int log,size; public readonly T[] d; public SegTree(int sz) { Length = sz; log = 0; while ((1 << log) < Length) log++; size = 1 << log; d = new T[2 *size]; Array.Fill(d, op.Identity); } public SegTree(T[] v) : this(v.Length) { for (int i = 0; i < Length; i++) d[size + i] = v[i]; for (int i =size - 1; i > 0; i--) Update(i); } [MethodImpl(256)] private void Update(int p) => d[p] = op.Operate(d[2 * p], d[2 * p + 1]); [MethodImpl(256)]public T Get(int p) => d[p + size]; [MethodImpl(256)] public void Set(int p, T v) { p += size; d[p] = v; for (int i = 1; i <= log; i++) Update(p>> i); } public T AllProd() => d[1]; [MethodImpl(256)] public T Prod(int l, int r) { T sl = op.Identity, sr = op.Identity; l += size; r += size;while (l < r) { if ((l & 1) != 0) sl = op.Operate(sl, d[l++]); if ((r & 1) != 0) sr = op.Operate(d[--r], sr); l >>= 1; r >>= 1; } return op.Operate(sl, sr); } [MethodImpl(256)] public int MaxRight(int l, Predicate<T> f) { Debug.Assert(0 <= l && l <= Length); Debug.Assert(f(op.Identity)); if (l == Length) return Length; l += size; var s = op.Identity; do { while (l % 2 == 0) l >>= 1; if (!f(op.Operate(s, d[l]))) {while (l < size) { l <<= 1; if (f(op.Operate(s, d[l]))) { s = op.Operate(s, d[l]); l++; } } return l - size; } s = op.Operate(s, d[l]); l++; }while ((l & -l) != l); return Length; } [MethodImpl(256)] public int MinLeft(int r, Predicate<T> f) { if (r == 0) return 0; r += size; var s = op.Identity; do { r--; while (r > 1 && (r % 2) != 0) r >>= 1; if (!f(op.Operate(d[r], s))) { while (r < size) { r = (2 * r + 1); if (f(op.Operate(d[r], s))) { s = op.Operate(d[r], s); r--; } } return r + 1 - size; } s = op.Operate(d[r], s); } while ((r & -r) != r); return 0; } }public interface IOperation<T> { T Operate(T x, T y); }public interface IIdentity<T> { T Identity { get; } }