結果
| 問題 |
No.1612 I hate Construct a Palindrome
|
| コンテスト | |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2021-07-21 22:37:41 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 439 ms / 2,000 ms |
| コード長 | 13,152 bytes |
| コンパイル時間 | 8,581 ms |
| コンパイル使用メモリ | 166,588 KB |
| 実行使用メモリ | 190,152 KB |
| 最終ジャッジ日時 | 2024-07-17 19:39:35 |
| 合計ジャッジ時間 | 16,561 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (85 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;
namespace Program
{
public static class ProblemC
{
static bool SAIKI = false;
static public int numberOfRandomCases = 0;
static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
{
}
static public void Solve()
{
var N = NN;
var M = NN;
var ABC = Repeat(0, M).Select(_ => new { A = NN - 1, B = NN - 1, C = NS[0] }).ToArray();
if (ABC.Select(e => e.C).Distinct().Count() == 1) Console.WriteLine(-1);
else
{
var path = Repeat(0, N).Select(_ => new List<(long idx, long node, char c)>()).ToArray();
var ccnt = Repeat(0, N).Select(_ => new HashSet<char>()).ToArray();
for (var j = 0; j < M; ++j)
{
var item = ABC[j];
path[item.A].Add((j, item.B, item.C));
path[item.B].Add((j, item.A, item.C));
ccnt[item.A].Add(item.C);
ccnt[item.B].Add(item.C);
}
var left = 0L;
var li = 0L;
var right = 0L;
var ri = 0L;
for (var i = 0; i < N; ++i)
{
if (ccnt[i].Count > 1)
{
var done = new bool[26];
var f = path[i].First();
done[f.c - 'a'] = true;
left = f.node;
li = f.idx;
foreach (var item in path[i])
{
if (done[item.c - 'a']) continue;
done[item.c - 'a'] = true;
right = item.node;
ri = item.idx;
break;
}
break;
}
}
Func<long, long, long, long, long[]> calc = (st, sti, go, goi) =>
{
Action<long, long> dfs = null;
var stack = new Stack<long>();
var done = new bool[N];
var endend1 = false;
dfs = (node, parent) =>
{
if (endend1 || node == 0)
{
endend1 = true;
return;
}
if (done[node]) return;
done[node] = true;
foreach (var item in path[node])
{
if (item.node == parent) continue;
stack.Push(item.idx);
if (endend1 || item.node == 0)
{
endend1 = true;
return;
}
dfs(item.node, node);
if (endend1 || item.node == 0)
{
endend1 = true;
return;
}
stack.Pop();
}
};
dfs(st, -1);
Action<long, long> dfs2 = null;
var stack2 = new Stack<long>();
var done2 = new bool[N];
var endend = false;
dfs2 = (node, parent) =>
{
if (endend || node == N - 1)
{
endend = true;
return;
}
if (done2[node]) return;
done2[node] = true;
foreach (var item in path[node])
{
if (item.node == parent) continue;
stack2.Push(item.idx);
if (endend || item.node == N - 1)
{
endend = true;
return;
}
dfs2(item.node, node);
if (endend || item.node == N - 1)
{
endend = true;
return;
}
stack2.Pop();
}
};
dfs2(go, -1);
var ans1 = new List<long>();
foreach (var item in stack)
{
ans1.Add(item);
}
var ans2 = new List<long>();
foreach (var item in stack2)
{
ans2.Add(item);
}
ans2.Reverse();
var ans = new List<long>();
ans.AddRange(ans1);
ans.Add(sti);
ans.Add(goi);
ans.AddRange(ans2);
var ok = false;
for (var i = 0; i < ans.Count; ++i)
{
if (ABC[ans[i]].C != ABC[ans[ans.Count - 1 - i]].C)
{
ok = true;
break;
}
}
if (!ok)
{
var last = path[N - 1].First().idx;
ans.Add(last);
ans.Add(last);
}
return ans.ToArray();
};
var ret = calc(left, li, right, ri);
if (ret.Length > 2 * N) ret = calc(right, ri, left, li);
Console.WriteLine(ret.Length);
foreach (var item in ret)
{
Console.WriteLine(item + 1);
}
}
}
class Printer : StreamWriter
{
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
}
static LIB_FastIO fastio = new LIB_FastIODebug();
static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
static long NN => fastio.Long();
static double ND => fastio.Double();
static string NS => fastio.Scan();
static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
static IEnumerator<uint> _xsi = _xsc();
static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
}
}
namespace Library {
class LIB_FastIO
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIO() { str = Console.OpenStandardInput(); }
readonly Stream str;
readonly byte[] buf = new byte[2048];
int len, ptr;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
byte read()
{
if (ptr >= len)
{
ptr = 0;
if ((len = str.Read(buf, 0, 2048)) <= 0)
{
return 0;
}
}
return buf[ptr++];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public long Long()
{
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = (ret << 3) + (ret << 1) + b - '0';
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
class LIB_FastIODebug : LIB_FastIO
{
Queue<string> param = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIODebug() { }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override string Scan() => NextString();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override long Long() => long.Parse(NextString());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override double Double() => double.Parse(NextString());
}
}