結果
| 問題 | No.59 鉄道の旅 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-02 17:37:30 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 119 ms / 5,000 ms |
| コード長 | 5,879 bytes |
| コンパイル時間 | 2,765 ms |
| コンパイル使用メモリ | 113,600 KB |
| 実行使用メモリ | 28,108 KB |
| 最終ジャッジ日時 | 2023-08-26 05:39:03 |
| 合計ジャッジ時間 | 4,596 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge11 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 50 ms
19,708 KB |
| testcase_01 | AC | 51 ms
21,756 KB |
| testcase_02 | AC | 50 ms
21,528 KB |
| testcase_03 | AC | 52 ms
23,684 KB |
| testcase_04 | AC | 119 ms
28,108 KB |
| testcase_05 | AC | 52 ms
23,760 KB |
| testcase_06 | AC | 53 ms
21,764 KB |
| testcase_07 | AC | 53 ms
23,580 KB |
| testcase_08 | AC | 59 ms
23,728 KB |
| testcase_09 | AC | 57 ms
21,688 KB |
| testcase_10 | AC | 56 ms
21,624 KB |
| testcase_11 | AC | 52 ms
21,496 KB |
| testcase_12 | AC | 61 ms
23,544 KB |
| testcase_13 | AC | 104 ms
28,000 KB |
| testcase_14 | AC | 107 ms
26,492 KB |
| testcase_15 | AC | 51 ms
23,668 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var k = sc.Integer();
var w = sc.Integer(n);
var zip = w.Select(x => Math.Abs(x)).Distinct().ToArray();
Array.Sort(zip);
var sz = zip.Length + 1;
var cnt = new FenwickTree(sz);
for (int i = 0; i < n; i++)
{
var p = Array.BinarySearch(zip, Math.Abs(w[i])) + 1;
if (w[i] < 0)
{
var m = cnt[p, p];
if (m > 0)
cnt.Add(p, -1);
}
else
{
var m = cnt[p, sz];
if (m < k)
cnt.Add(p, 1);
}
}
IO.Printer.Out.WriteLine(cnt[sz]);
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public 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) return 0;
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 Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
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 int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region FenwickTree
[System.Diagnostics.DebuggerDisplay("Data={ToString()}")]
public class FenwickTree
{
int n;
long[] bit;
int max = 1;
public FenwickTree(int size)
{
n = size; bit = new long[n + 1];
while ((max << 1) <= n) max <<= 1;
}
/// <summary>sum[a,b]</summary>
public long this[int i, int j] { get { return this[j] - this[i - 1]; } }
/// <summary>sum[0,i]</summary>
public long this[int i] { get { long s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
public int LowerBound(long w)
{
if (w <= 0) return 0;
int x = 0;
for (int k = max; k > 0; k >>= 1)
if (x + k <= n && bit[x + k] < w)
{
w -= bit[x + k];
x += k;
}
return x + 1;
}
/// <summary>add v to bit[i]</summary>
public void Add(int i, long v)
{
if (i == 0) System.Diagnostics.Debug.Fail("BIT is 1 indexed");
for (; i <= n; i += i & -i) bit[i] += v;
}
public override string ToString() { return string.Join(",", Enumerable.Range(0, n + 1).Select(i => this[i, i])); }
}
#endregion