結果
問題 | No.190 Dry Wet Moist |
ユーザー | EmKjp |
提出日時 | 2015-04-28 20:26:05 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 234 ms / 2,000 ms |
コード長 | 3,601 bytes |
コンパイル時間 | 2,438 ms |
コンパイル使用メモリ | 109,380 KB |
実行使用メモリ | 49,704 KB |
最終ジャッジ日時 | 2023-09-18 14:07:09 |
合計ジャッジ時間 | 7,554 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
23,164 KB |
testcase_01 | AC | 70 ms
23,028 KB |
testcase_02 | AC | 70 ms
23,088 KB |
testcase_03 | AC | 69 ms
25,020 KB |
testcase_04 | AC | 69 ms
22,980 KB |
testcase_05 | AC | 69 ms
25,028 KB |
testcase_06 | AC | 69 ms
20,940 KB |
testcase_07 | AC | 79 ms
25,320 KB |
testcase_08 | AC | 78 ms
25,300 KB |
testcase_09 | AC | 78 ms
25,152 KB |
testcase_10 | AC | 78 ms
23,120 KB |
testcase_11 | AC | 78 ms
25,208 KB |
testcase_12 | AC | 146 ms
30,116 KB |
testcase_13 | AC | 177 ms
43,492 KB |
testcase_14 | AC | 142 ms
31,948 KB |
testcase_15 | AC | 187 ms
44,424 KB |
testcase_16 | AC | 217 ms
44,968 KB |
testcase_17 | AC | 91 ms
24,860 KB |
testcase_18 | AC | 133 ms
29,028 KB |
testcase_19 | AC | 214 ms
47,352 KB |
testcase_20 | AC | 170 ms
39,104 KB |
testcase_21 | AC | 87 ms
24,196 KB |
testcase_22 | AC | 231 ms
47,440 KB |
testcase_23 | AC | 230 ms
46,692 KB |
testcase_24 | AC | 234 ms
49,704 KB |
testcase_25 | AC | 69 ms
24,980 KB |
testcase_26 | AC | 69 ms
24,988 KB |
testcase_27 | AC | 172 ms
41,832 KB |
testcase_28 | AC | 113 ms
27,156 KB |
testcase_29 | AC | 125 ms
30,872 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.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { long CountDry(int[] A) { Array.Sort(A); Array.Reverse(A); int right = A.Length - 1; int ans = 0; int skipMin = 0; for (int i = 0; i < A.Length; i++) { if (i >= right) break; if (A[i] + A[right] < 0) { right--; ans++; } else { if (A[i] < 0) skipMin++; } } return ans + skipMin / 2; } public void Run() { int n = ni(); var A = NextIntArray(2 * n); long dry = CountDry(A); long wet = CountDry(A.Select(x => -x).ToArray()); long moist = 0; int offset = 100010; var hist = new int[offset * 2]; foreach (var x in A) { hist[x + offset]++; } moist += hist[offset] / 2; for (int i = 1; i < offset; i++) { moist += Math.Min(hist[i + offset], hist[-i + offset]); } cout.WriteLine("{0} {1} {2}", dry, wet, moist); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(@"4 -4 -3 -2 -1 1 2 3 4", Console.Error).Run(); new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public long nl() { return NextLong(); } public string ns() { return Next(); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }