結果
| 問題 |
No.335 門松宝くじ
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-01-16 00:06:19 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,146 bytes |
| コンパイル時間 | 906 ms |
| コンパイル使用メモリ | 122,776 KB |
| 実行使用メモリ | 31,828 KB |
| 最終ジャッジ日時 | 2024-09-19 19:39:10 |
| 合計ジャッジ時間 | 7,853 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 2 WA * 2 TLE * 1 -- * 5 |
コンパイルメッセージ
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;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var m = sc.Integer();
var a = Enumerate(m, x => sc.Integer(n));
long val = -1;
var id = -1;
for (int _ = 0; _ < m; _++)
{
var b = a[_];
long v = 0;
var L = new FenwickTree(n);
{
var u = 0;
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
var p = Array.IndexOf(b, i);
var q = Array.IndexOf(b, j);
var ok = false;
for (int k = 0; k < n; k++)
{
if (k == p) continue;
if (k == q) continue;
var idx = new int[] { p, q, k };
Array.Sort(idx);
if (ISOTAKUDAIGAKU(b[idx[0]], b[idx[1]], b[idx[2]]))
{
ok = true;
break;
}
}
if (ok)
{
Debug.WriteLine("{0} {1}", Math.Min(p, q), Math.Max(p, q));
u++;
}
}
}
Debug.WriteLine(u);
if(val<u)
{
val = u;
id = _;
}
}
continue;
//*/
for (int i = 0; i < n; i++)
{
var M = new FenwickTree(n);
for (int j = i + 1; j < n; j++)
M.Add(b[j], 1);
var R = new FenwickTree(n);
for (int j = n - 1; j > i; j--)
{
M.Add(b[j], -1);
var min = Math.Min(b[i], b[j]);
var max = Math.Max(b[i], b[j]);
if (j == 2)
{
}
if ((min > 1 && M[1, min - 1] > 0) || (M[max + 1, n] > 0))
{
Debug.WriteLine("{0} {1}", i, j);
v++;
}
else
{
if (b[i] < b[j])
{
if (R[1, b[j] - 1] > 0)
{
Debug.WriteLine("{0} {1}", i, j);
v++;
}
else if (L[b[i] + 1, n] > 0)
{
Debug.WriteLine("{0} {1}", i, j);
v++;
}
}
else if (b[i] > b[j])
{
if (L[1, b[i] - 1] > 0)
{
Debug.WriteLine("{0} {1}", i, j);
v++;
}
else if (R[b[j] + 1, n] > 0)
{
Debug.WriteLine("{0} {1}", i, j);
v++;
}
}
}
R.Add(b[j], 1);
}
L.Add(b[i], 1);
}
Debug.WriteLine(v);
if (val < v)
{
val = v;
id = _;
}
}
IO.Printer.Out.WriteLine(id);
}
public bool ISOTAKUDAIGAKU(long l, long m, long r)
{
var a = new long[] { l, m, r };
return ISOTAKUDAIGAKU(a);
}
public bool ISOTAKUDAIGAKU(long[] a)
{
if (a.Length != 3) return false;
if (a.Distinct().Count() != 3) return false;
if (a[0] < a[1] && a[1] > a[2]) return true;
if (a[0] > a[1] && a[1] < a[2]) return true;
return false;
}
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 main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, 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) && !isEof); 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 string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') 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 != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
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() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
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); }
}
}
#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