結果
| 問題 |
No.1341 真ん中を入れ替えて門松列
|
| コンテスト | |
| ユーザー |
 りあん
|
| 提出日時 | 2021-01-15 22:13:13 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 11,447 bytes |
| コンパイル時間 | 2,151 ms |
| コンパイル使用メモリ | 116,864 KB |
| 実行使用メモリ | 63,068 KB |
| 最終ジャッジ日時 | 2024-11-26 15:42:03 |
| 合計ジャッジ時間 | 36,499 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 3 TLE * 11 |
コンパイルメッセージ
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.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
class Program {
static void Main(string[] args) {
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var solver = new Solver(sw);
// var t = new Thread(solver.solve, 1 << 28); // 256 MB
// t.Start();
// t.Join();
solver.solve();
sw.Flush();
}
}
class Solver {
StreamWriter sw;
Scan sc;
void Prt(string a) => sw.WriteLine(a);
void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
void Prt(params object[] a) => Prt(string.Join(" ", a));
public Solver(StreamWriter sw) {
this.sw = sw;
this.sc = new Scan();
}
public void solve() {
int n;
long m;
sc.Multi(out n, out m);
var a = new long[n];
var b = new long[n];
var c = new long[n];
for (int i = 0; i < n; i++)
{
sc.Multi(out a[i], out b[i], out c[i]);
if (a[i] > c[i]) {
long t = a[i];
a[i] = c[i];
c[i] = t;
}
}
int N = n * 4 + 2;
var mcf = new MinCostFlow(N);
int S = N - 2, T = N - 1;
var ainc = new int[n];
var cinc = new int[n];
for (int i = 0; i < n; i++)
{
ainc[i] = i;
cinc[i] = i;
}
Array.Sort(ainc, (x, y) => a[x].CompareTo(a[y]));
Array.Sort(cinc, (x, y) => c[x].CompareTo(c[y]));
for (int i = 0; i < n; i++)
{
mcf.addEdge(S, i, 1, 0);
mcf.addEdge(n + i, n * 3 + i, 1, -c[i]);
mcf.addEdge(n * 2 + i, n * 3 + i, 1, 0);
mcf.addEdge(n * 3 + i, T, 1, 0);
if (i > 0) {
mcf.addEdge(n + ainc[i - 1], n + ainc[i], n, 0);
mcf.addEdge(n * 2 + cinc[i], n * 2 + cinc[i - 1], n, 0);
}
for (int j = 0; j < n; j++)
{
if (a[ainc[j]] > b[i]) {
mcf.addEdge(i, n + ainc[j], 1, 0);
break;
}
}
for (int j = n - 1; j >= 0 ; j--)
{
if (c[cinc[j]] < b[i]) {
mcf.addEdge(i, n * 2 + cinc[j], 1, -b[i]);
break;
}
}
}
long f = mcf.run(S, T, n);
// DBG(f);
if (f == util.LM) {
Prt("NO");
}
else if (-f >= m) {
Prt("YES");
Prt("KADOMATSU!");
}
else {
Prt("YES");
Prt("NO");
}
}
}
class pair<T, U> : IComparable<pair<T, U>> {
public T v1;
public U v2;
public pair() : this(default(T), default(U)) {}
public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
public static readonly int M = 1000000007;
// public static readonly int M = 998244353;
public static readonly long LM = 1L << 60;
public static readonly double eps = 1e-11;
public static void DBG(string a) => Console.Error.WriteLine(a);
public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
public static void DBG(params object[] a) => DBG(string.Join(" ", a));
public static void Assert(params bool[] conds) {
if (conds.Any(x => !x)) throw new Exception();
}
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
for (int i = 0; i < a.Count && i < b.Count; i++)
if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
return a.Count.CompareTo(b.Count);
}
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
public static readonly int[] dd = { 0, 1, 0, -1 };
// static readonly string dstring = "RDLU";
public static IEnumerable<P> adjacents(int i, int j) {
for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
}
public static IEnumerable<P> adjacents(int i, int j, int h, int w)
=> adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
public static IEnumerable<int> all_subset(this int p) {
for (int i = 0; ; i = i - p & p) {
yield return i;
if (i == p) break;
}
}
public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
public static T[] inv<T>(this Dictionary<T, int> dic) {
var res = new T[dic.Count];
foreach (var item in dic) res[item.Value] = item.Key;
return res;
}
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
class Scan {
StreamReader sr;
public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
public Scan(string path) { sr = new StreamReader(path); }
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => ReadLine.Trim();
public string ReadLine => sr.ReadLine();
public pair<T, U> Pair<T, U>() {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P => Pair<int, int>();
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
}
public void Multi<T, U, V>(out T a, out U b, out V c) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
}
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
}
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
}
public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]);
}
}
class MinCostFlow {
class edge {
public int to, cap, rev;
public long cost;
public edge(int to, int cap, long cost, int rev) {
this.to = to;
this.cap = cap;
this.cost = cost;
this.rev = rev;
}
}
int n;
List<edge>[] g;
public MinCostFlow(int n) {
this.n = n;
g = new List<edge>[n];
for (int i = 0; i < n; i++)
g[i] = new List<edge>();
}
public void addEdge(int from, int to, int cap, long cost) {
g[from].Add(new edge(to, cap, cost, g[to].Count));
g[to].Add(new edge(from, 0, -cost, g[from].Count - 1));
}
public long run(int s, int t, int f) {
long res = 0;
var h = new long[n];
while (f > 0) {
var q = new PriorityQueue<pair<long, int>>(){ rev = true };
var dist = new long[n];
var prevv = new int[n];
var preve = new int[n];
for (int i = 0; i < n; i++) dist[i] = util.LM;
dist[s] = 0;
q.Push(new pair<long, int>(0, s));
while (q.Count > 0) {
var p = q.Pop();
int v = p.v2;
if (dist[v] < p.v1) continue;
for (int i = 0; i < g[v].Count; ++i) {
var e = g[v][i];
if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
prevv[e.to] = v;
preve[e.to] = i;
q.Push(new pair<long, int>(dist[e.to], e.to));
}
}
}
if (dist[t] == util.LM) return util.LM;
for (int v = 0; v < n; ++v) h[v] += dist[v];
int d = f;
for (int v = t; v != s; v = prevv[v]) d = Math.Min(d, g[prevv[v]][preve[v]].cap);
f -= d;
res += d * h[t];
for (int v = t; v != s; v = prevv[v]) {
var e = g[prevv[v]][preve[v]];
e.cap -= d;
g[v][e.rev].cap += d;
}
}
return res;
}
}
// the greatest element pops
class PriorityQueue<T> {
List<T> buf;
public bool rev = false;
Func<int, int, int> cmp;
public PriorityQueue() {
buf = new List<T>();
cmp = (i, j) => Comparer<T>.Default.Compare(buf[i], buf[j]) * (rev ? -1 : 1);
}
public PriorityQueue(Func<T, T, int> cmp) {
buf = new List<T>();
this.cmp = (i, j) => cmp(buf[i], buf[j]);
}
void swap(int i, int j) { var t = buf[i]; buf[i] = buf[j]; buf[j] = t; }
public void Push(T elem) {
int n = buf.Count;
buf.Add(elem);
while (n > 0) {
int i = (n - 1) >> 1;
if (cmp(n, i) <= 0) break;
swap(i, n);
n = i;
}
}
public T Pop() {
T ret = buf[0];
int n = buf.Count - 1;
buf[0] = buf[n];
buf.RemoveAt(n);
for (int i = 0, j; (j = (i << 1) | 1) < n; i = j) {
if (j != n - 1 && cmp(j, j + 1) < 0) ++j;
if (cmp(i, j) < 0) swap(i, j);
else break;
}
return ret;
}
public T Top => buf[0];
public int Count => buf.Count;
}