結果
問題 | No.1014 competitive fighting |
ユーザー | りあん |
提出日時 | 2020-03-20 22:12:07 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 11,327 bytes |
コンパイル時間 | 4,566 ms |
コンパイル使用メモリ | 114,544 KB |
実行使用メモリ | 48,840 KB |
最終ジャッジ日時 | 2023-08-21 16:54:00 |
合計ジャッジ時間 | 23,869 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
23,984 KB |
testcase_01 | AC | 72 ms
21,904 KB |
testcase_02 | AC | 76 ms
21,888 KB |
testcase_03 | AC | 75 ms
23,852 KB |
testcase_04 | AC | 74 ms
21,864 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 239 ms
24,028 KB |
testcase_11 | AC | 284 ms
23,924 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 96 ms
20,428 KB |
testcase_34 | AC | 332 ms
37,232 KB |
testcase_35 | AC | 419 ms
35,452 KB |
testcase_36 | AC | 310 ms
44,592 KB |
testcase_37 | AC | 83 ms
17,656 KB |
testcase_38 | AC | 286 ms
32,248 KB |
testcase_39 | AC | 179 ms
26,248 KB |
testcase_40 | AC | 280 ms
32,152 KB |
testcase_41 | AC | 220 ms
30,168 KB |
testcase_42 | AC | 407 ms
35,892 KB |
testcase_43 | AC | 93 ms
20,036 KB |
testcase_44 | AC | 375 ms
34,944 KB |
testcase_45 | AC | 250 ms
31,228 KB |
testcase_46 | AC | 106 ms
22,476 KB |
testcase_47 | AC | 171 ms
26,048 KB |
testcase_48 | AC | 321 ms
36,972 KB |
testcase_49 | AC | 86 ms
18,088 KB |
testcase_50 | AC | 395 ms
35,328 KB |
testcase_51 | AC | 254 ms
31,252 KB |
testcase_52 | AC | 88 ms
18,112 KB |
testcase_53 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Threading; using System.Text; using System.Text.RegularExpressions; using System.Diagnostics; using static util; using P = pair<int, int>; class Program { static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var solver = new Solver(sw); // var t = new Thread(solver.solve, 1 << 26); // 64 MB // t.Start(); // t.Join(); solver.solve(); sw.Flush(); } } class Solver { StreamWriter sw; Scan sc; void Prt(string a) => sw.WriteLine(a); void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a)); void Prt(params object[] a) => Prt(string.Join(" ", a)); public Solver(StreamWriter sw) { this.sw = sw; this.sc = new Scan(); } public void solve() { int n = sc.Int; var a = new long[n]; var b = new long[n]; var c = new long[n]; for (int i = 0; i < n; i++) { sc.Multi(out a[i], out b[i], out c[i]); } var cmp = a.compress(); var li = cmp.inv(); int m = cmp.Count; var frm = new int[n]; var to = new int[n]; for (int i = 0; i < n; i++) { int j = li.UpperBound(b[i] - c[i]) - 1; frm[i] = cmp[a[i]]; to[i] = j; } var isban = new bool[n]; { var sg = new Segtree<int>(m, Math.Max, -M); for (int i = 0; i < n; i++) { if (sg.run(0, to[i] + 1) >= frm[i]) { isban[i] = true; } sg.update(frm[i], Math.Max(sg.at(frm[i]), to[i])); } sg = new Segtree<int>(m, Math.Max, -M); for (int i = n - 1; i >= 0 ; i--) { if (sg.run(0, to[i] + 1) >= frm[i]) { isban[i] = true; } sg.update(frm[i], Math.Max(sg.at(frm[i]), to[i])); } } var idx = new int[n]; for (int i = 0; i < n; i++) { idx[i] = i; } Array.Sort(idx, (x, y) => Math.Min(frm[x], to[x]) != Math.Min(frm[y], to[y]) ? Math.Min(frm[x], to[x]).CompareTo(Math.Min(frm[y], to[y])) : Math.Max(frm[x], to[x]).CompareTo(Math.Max(frm[y], to[y]))); var ans = new long[n]; { var sg = new Segtree<long>(m, Math.Max, 0); foreach (var item in idx) { ans[item] = sg.run(0, to[item] + 1) + b[item]; sg.update(frm[item], Math.Max(sg.at(frm[item]), ans[item])); } } for (int i = 0; i < n; i++) { if (isban[i]) { Prt("BAN"); } else { Prt(ans[i]); } } } } class pair<T, U> : IComparable<pair<T, U>> { public T v1; public U v2; public pair() : this(default(T), default(U)) {} public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(pair<T, U> a) { int c = Comparer<T>.Default.Compare(v1, a.v1); return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2); } public override string ToString() => v1 + " " + v2; public void Deconstruct(out T a, out U b) { a = v1; b = v2; } } static class util { public static readonly int M = 1000000007; // public static readonly int M = 998244353; public static readonly long LM = 1L << 60; public static readonly double eps = 1e-11; public static void DBG(string a) => Console.Error.WriteLine(a); public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a)); public static void DBG(params object[] a) => DBG(string.Join(" ", a)); public static void Assert(params bool[] conds) { foreach (var cond in conds) if (!cond) throw new Exception(); } public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2); public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> { for (int i = 0; i < a.Count && i < b.Count; i++) if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]); return a.Count.CompareTo(b.Count); } public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w; static readonly int[] dd = { 0, 1, 0, -1 }; // static readonly string dstring = "RDLU"; public static P[] adjacents(int i, int j) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray(); public static P[] adjacents(int i, int j, int h, int w) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])) .Where(p => inside(p.v1, p.v2, h, w)).ToArray(); public static P[] adjacents(this P p) => adjacents(p.v1, p.v2); public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w); public static Dictionary<T, int> compress<T>(this IEnumerable<T> a) => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i); public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union)); public static T[] inv<T>(this Dictionary<T, int> dic) { var res = new T[dic.Count]; foreach (var item in dic) res[item.Value] = item.Key; return res; } public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; } public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy<T>(this IList<T> a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } public static void Deconstruct<T>(this IList<T> v, out T a) { a = v[0]; } public static void Deconstruct<T>(this IList<T> v, out T a, out T b) { a = v[0]; b = v[1]; } public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) { a = v[0]; b = v[1]; c = v[2]; } public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) { a = v[0]; b = v[1]; c = v[2]; d = v[3]; } public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) { a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4]; } } class Scan { StreamReader sr; public Scan() { sr = new StreamReader(Console.OpenStandardInput()); } public Scan(string path) { sr = new StreamReader(path); } public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => sr.ReadLine().Trim(); public pair<T, U> Pair<T, U>() { T a; U b; Multi(out a, out b); return new pair<T, U>(a, b); } public P P => Pair<int, int>(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries); bool eq<T, U>() => typeof(T).Equals(typeof(U)); T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)) : eq<T, long>() ? ct<T, long>(long.Parse(s)) : eq<T, double>() ? ct<T, double>(double.Parse(s)) : eq<T, char>() ? ct<T, char>(s[0]) : ct<T, string>(s); public void Multi<T>(out T a) => a = cv<T>(Str); public void Multi<T, U>(out T a, out U b) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); } public void Multi<T, U, V>(out T a, out U b, out V c) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); } public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); } public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); } } class Segtree<T> { int n; T[] data; Func<T, T, T> f; T identity; public Segtree(int m, Func<T, T, T> f, T identity) { this.f = f; this.identity = identity; n = 1; while (n < m) n <<= 1; data = new T[(n << 1) - 1]; for (int i = 0; i < data.Length; i++) data[i] = identity; } public Segtree(int m, IList<T> ini, Func<T, T, T> f, T identity) : this(m, f, identity) { for (int i = 0; i < m; ++i) assign(i, ini[i]); all_update(); } public void assign(int j, T x) => data[j + n - 1] = x; public void update(int j, T x) { assign(j, x); update(j); } public void update(int j) { int i = j + n - 1; while (i > 0) { i = i - 1 >> 1; data[i] = f(data[i << 1 | 1], data[i + 1 << 1]); } } public void all_update() { for (int i = n - 2; i >= 0; i--) data[i] = f(data[i << 1 | 1], data[i + 1 << 1]); } public T at(int i) => data[i + n - 1]; // [s, t) public T run(int s, int t) => run(s, t, 0, 0, n); T run(int s, int t, int k, int l, int r) => r <= s || t <= l ? identity : s <= l && r <= t ? data[k] : f(run(s, t, k << 1 | 1, l, l + r >> 1), run(s, t, k + 1 << 1, l + r >> 1, r)); } static class Search { // x より大きいの項の index のうち最小のものを返す // x 以下の項の index のうち最大のもの + 1 を返す // そこに挿入 public static int UpperBound<T>(this IList<T> a, T x) where T : IComparable<T> { int le = -1, u = a.Count; while (le < u - 1) { int m = (le + u) >> 1; if (a[m].CompareTo(x) > 0) u = m; else le = m; } return le + 1; } public static int UpperBound<T>(this IList<T> a, T x, Func<T, T, int> compare) { int le = -1, u = a.Count; while (le < u - 1) { int m = (le + u) >> 1; if (compare(a[m], x) > 0) u = m; else le = m; } return le + 1; } // n 未満の項の index のうち最大のもの + 1 を返す // n 以上の項の index のうち最小のものを返す // そこに挿入 public static int LowerBound<T>(this IList<T> a, T x) where T : IComparable<T> { int l = -1, ue = a.Count; while (l < ue - 1) { int m = (l + ue) >> 1; if (a[m].CompareTo(x) < 0) l = m; else ue = m; } return ue; } public static int LowerBound<T>(this IList<T> a, T x, Func<T, T, int> compare) { int l = -1, ue = a.Count; while (l < ue - 1) { int m = (l + ue) >> 1; if (compare(a[m], x) < 0) l = m; else ue = m; } return ue; } }