結果
| 問題 | No.335 門松宝くじ |
| ユーザー |
 りあん
|
| 提出日時 | 2016-01-16 00:00:17 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 78 ms / 2,000 ms |
| コード長 | 7,323 bytes |
| コンパイル時間 | 991 ms |
| コンパイル使用メモリ | 116,764 KB |
| 実行使用メモリ | 46,644 KB |
| 最終ジャッジ日時 | 2024-09-19 19:37:23 |
| 合計ジャッジ時間 | 2,141 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 10 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.IO.Compression;
using System.Text;
//using System.Numerics;
namespace Solver
{
class Program
{
const int M = 1000000007;
const double eps = 1e-9;
static int[] dd = { 0, 1, 0, -1, 0 };
static void Main()
{
var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var sc = new Scan();
int n, m;
sc.Multi(out n, out m);
var e = new int[m][];
var ind = new int[m][];
var ma = new int[m][][];
var mi = new int[m][][];
for (int i = 0; i < m; i++)
{
ma[i] = new int[n][];
mi[i] = new int[n][];
e[i] = sc.IntArr;
ind[i] = new int[n + 1];
for (int j = 0; j < n; j++)
{
ind[i][e[i][j]] = j;
ma[i][j] = new int[n];
ma[i][j][j] = e[i][j];
mi[i][j] = new int[n];
mi[i][j][j] = e[i][j];
for (int k = j + 1; k < n; k++)
{
ma[i][j][k] = Math.Max(ma[i][j][k - 1], e[i][k]);
mi[i][j][k] = Math.Min(mi[i][j][k - 1], e[i][k]);
}
}
}
int max = -1, maxid = 0;
for (int i = 0; i < m; i++)
{
int sum = 0;
for (int j = 1; j <= n; j++)
{
for (int k = j + 1; k <= n; k++)
{
if (ind[i][j] < ind[i][k])
{
if (ind[i][k] > 0 && ma[i][0][ind[i][k] - 1] > k)
{
sum += ma[i][0][ind[i][k] - 1];
continue;
}
if (ind[i][j] > 0 && ma[i][0][ind[i][j] - 1] > j || ind[i][j] < n - 1 && mi[i][ind[i][j] + 1][n - 1] < j || ind[i][k] < n - 1 && mi[i][ind[i][k] + 1][n - 1] < k)
{
sum += k;
continue;
}
}
else
{
if (ind[i][k] < n - 1 && ma[i][ind[i][k] + 1][n - 1] > k)
{
sum += ma[i][ind[i][k] + 1][n - 1];
continue;
}
if (ind[i][j] < n - 1 && ma[i][ind[i][j] + 1][n - 1] > j || ind[i][j] > 0 && mi[i][0][ind[i][j] - 1] < j || ind[i][k] > 0 && mi[i][0][ind[i][k] - 1] < k)
{
sum += k;
continue;
}
}
}
}
if (max < sum)
{
max = sum;
maxid = i;
}
}
sw.WriteLine(maxid);
sw.Flush();
}
static void swap<T>(ref T a, ref T b)
{
var t = a;
a = b;
b = t;
}
static bool isprime(long n)
{
if (n == 1) return false;
for (long i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
static string strsort(string s)
{
var c = s.ToCharArray();
Array.Sort(c);
return string.Join("", c);
}
static string strswap(string s, int i, int j)
{
var c = s.ToCharArray();
c[i] = s[j];
c[j] = s[i];
return string.Join("", c);
}
static T[] copy<T>(T[] a)
{
var ret = new T[a.Length];
for (int i = 0; i < a.Length; i++) ret[i] = a[i];
return ret;
}
}
class Scan
{
public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
public string Str { get { return Console.ReadLine().Trim(); } }
public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
public bool isprime(long a)
{
if (a < 2) return false;
for (long i = 2; i * i <= a; i++)
if (a % i == 0)
return false;
return true;
}
public long powmod(long a, long b, long M)
{
if (a == 0) return 0;
if (b == 0) return 1;
if (b == 1) return a % M;
var t = powmod(a, b / 2, M);
if ((b & 1) == 0) return t * t % M;
else return t * t % M * a % M;
}
public long gcd(long a, long b)
{
while (b != 0)
{
var t = a % b;
a = b;
b = t;
}
return a;
}
public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
}
}