結果

問題 No.208 王将
ユーザー EmKjpEmKjp
提出日時 2015-05-15 22:30:49
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 26 ms / 1,000 ms
コード長 3,239 bytes
コンパイル時間 2,244 ms
コンパイル使用メモリ 111,612 KB
実行使用メモリ 26,308 KB
最終ジャッジ日時 2024-10-09 16:16:39
合計ジャッジ時間 3,522 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
22,452 KB
testcase_01 AC 24 ms
24,284 KB
testcase_02 AC 25 ms
26,044 KB
testcase_03 AC 25 ms
24,236 KB
testcase_04 AC 26 ms
26,296 KB
testcase_05 AC 25 ms
22,196 KB
testcase_06 AC 25 ms
24,408 KB
testcase_07 AC 26 ms
24,152 KB
testcase_08 AC 26 ms
24,364 KB
testcase_09 AC 26 ms
26,164 KB
testcase_10 AC 25 ms
24,540 KB
testcase_11 AC 25 ms
24,112 KB
testcase_12 AC 26 ms
26,308 KB
testcase_13 AC 26 ms
24,236 KB
testcase_14 AC 26 ms
26,044 KB
testcase_15 AC 25 ms
24,384 KB
testcase_16 AC 25 ms
22,320 KB
testcase_17 AC 25 ms
24,028 KB
testcase_18 AC 25 ms
24,248 KB
testcase_19 AC 25 ms
26,064 KB
testcase_20 AC 25 ms
22,196 KB
testcase_21 AC 26 ms
26,304 KB
testcase_22 AC 26 ms
24,284 KB
testcase_23 AC 25 ms
24,156 KB
testcase_24 AC 25 ms
24,152 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
partial class Solver {
int sign(int x) {
if (x > 0) return 1;
if (x < 0) return -1;
return 0;
}
public void Run() {
int x = ni();
int y = ni();
int x2 = ni();
int y2 = ni();
var d = Math.Max(Math.Abs(x), Math.Abs(y));
if (Math.Abs(x) == Math.Abs(y)) {
if (Math.Abs(x2) == Math.Abs(y2)) {
if (sign(x) == sign(x2) && sign(y) == sign(y2)) {
if (Math.Abs(x) > Math.Abs(x2) && Math.Abs(y) > Math.Abs(y2)) {
d++;
}
}
}
}
cout.WriteLine(d);
}
}
// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
public static void Main(string[] args) {
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 int[] ni(int n) { return NextIntArray(n); }
public long nl() { return NextLong(); }
public long[] nl(int n) { return NextLongArray(n); }
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;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0