結果

問題 No.274 The Wall
ユーザー aketijyuuzou
提出日時 2024-10-12 23:59:03
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 4,563 bytes
コンパイル時間 1,089 ms
コンパイル使用メモリ 116,308 KB
実行使用メモリ 20,096 KB
最終ジャッジ日時 2024-10-12 23:59:08
合計ジャッジ時間 3,136 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
class Program
{
static string InputPattern = "InputX";
static List<string> GetInputList()
{
var WillReturn = new List<string>();
if (InputPattern == "Input1") {
WillReturn.Add("4 6");
WillReturn.Add("5 5");
WillReturn.Add("2 3");
WillReturn.Add("4 4");
WillReturn.Add("1 1");
//YES
//
//180
//0180
}
else if (InputPattern == "Input2") {
WillReturn.Add("4 6");
WillReturn.Add("3 5");
WillReturn.Add("3 4");
WillReturn.Add("4 4");
WillReturn.Add("1 2");
//NO
//
//180使
}
else if (InputPattern == "Input3") {
WillReturn.Add("2 4");
WillReturn.Add("0 1");
WillReturn.Add("0 1");
//YES
//180
}
else if (InputPattern == "Input4") {
WillReturn.Add("5 10");
WillReturn.Add("8 8");
WillReturn.Add("0 0");
WillReturn.Add("2 4");
WillReturn.Add("2 3");
WillReturn.Add("8 8");
//YES
//
}
else {
string wkStr;
while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
}
return WillReturn;
}
struct BlookDef
{
internal int L;
internal int R;
internal int KaitenL;
internal int KaitenR;
}
static int M;
static void Main()
{
List<string> InputList = GetInputList();
int[] wkArr = { };
Action<string> SplitAct = (pStr) =>
wkArr = pStr.Split(' ').Select(X => int.Parse(X)).ToArray();
SplitAct(InputList[0]);
M = wkArr[1];
var BlookList = new List<BlookDef>();
for (int I = 1; I <= InputList.Count - 1; I++) {
SplitAct(InputList[I]);
BlookList.Add(CreateBlockInfo(wkArr[0], wkArr[1]));
}
BlookList.Sort((A, B) => A.L.CompareTo(B.L));
Console.WriteLine(CanCreateGoodWall(BlookList) ? "YES" : "NO");
}
//
static BlookDef CreateBlockInfo(int pL, int pR)
{
BlookDef WillReturn;
int NewL = M - 1 - pR;
int NewR = M - 1 - pL;
//L < KaitenL
if (pL < NewL) {
WillReturn.L = pL; WillReturn.R = pR;
WillReturn.KaitenL = NewL; WillReturn.KaitenR = NewR;
}
else {
WillReturn.L = NewL; WillReturn.R = NewR;
WillReturn.KaitenL = pL; WillReturn.KaitenR = pR;
}
return WillReturn;
}
//
static bool CanCreateGoodWall(List<BlookDef> pBlookList)
{
//var IsPinkArr = new System.Collections.BitArray(M);
var IsPinkArr = new bool[M];
foreach (BlookDef EachBlock in pBlookList) {
//
bool CanSetLeft = true;
for (int I = EachBlock.L; I <= EachBlock.R; I++) {
if (IsPinkArr[I]) {
CanSetLeft = false; break;
}
}
if (CanSetLeft) {
for (int I = EachBlock.L; I <= EachBlock.R; I++) {
IsPinkArr[I] = true;
}
continue;
}
//180
bool CanSetRight = true;
for (int I = EachBlock.KaitenL; I <= EachBlock.KaitenR; I++) {
if (IsPinkArr[I]) {
CanSetRight = false; break;
}
}
if (CanSetRight) {
for (int I = EachBlock.KaitenL; I <= EachBlock.KaitenR; I++) {
IsPinkArr[I] = true;
}
continue;
}
//NG
return false;
}
return true;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0