結果

問題 No.1341 真ん中を入れ替えて門松列
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-01-15 21:56:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,653 bytes
コンパイル時間 1,065 ms
コンパイル使用メモリ 113,652 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-05-04 23:38:12
合計ジャッジ時間 8,530 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,624 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 23 ms
5,376 KB
testcase_07 AC 1,808 ms
5,376 KB
testcase_08 AC 5 ms
5,376 KB
testcase_09 AC 1,890 ms
5,376 KB
testcase_10 TLE -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


namespace MCF {
	#define MAXN 100010
	#define MAXM 100010
	#define wint int
	#define cint Int
	const wint wEPS = 0;
	const wint wINF = 1001001001;
	const cint cEPS = 0;
	const cint cINF = 1001001001001001001LL;
	int n, m, ptr[MAXN], next[MAXM], zu[MAXM];
	wint capa[MAXM], tof;
	cint cost[MAXM], toc, d[MAXN], pot[MAXN];
	int vis[MAXN], pree[MAXN];
	void init(int _n) {
		n = _n; m = 0; memset(ptr, ~0, n << 2);
	}
	void ae(int u, int v, wint w, cint c) {
		next[m] = ptr[u]; ptr[u] = m; zu[m] = v; capa[m] = w; cost[m] = +c; ++m;
		next[m] = ptr[v]; ptr[v] = m; zu[m] = u; capa[m] = 0; cost[m] = -c; ++m;
	}
	bool solve(int src, int ink, wint flo = wINF) {
		wint f;
		cint c, cc;
		int i, u, v;
		memset(pot, 0, n * sizeof(cint));
	//*
		for (bool cont = 1; cont; ) {
			cont = 0;
			for (u = 0; u < n; ++u) for (i = ptr[u]; ~i; i = next[i]) if (capa[i] > wEPS) {
				if (pot[zu[i]] > pot[u] + cost[i] + cEPS) {
					pot[zu[i]] = pot[u] + cost[i]; cont = 1;
				}
			}
		}
	//*/
		for (toc = 0, tof = 0; tof + wEPS < flo; ) {
			typedef pair<cint,int> node;
			priority_queue< node,vector<node>,greater<node> > q;
			for (u = 0; u < n; ++u) { d[u] = cINF; vis[u] = 0; }
			for (q.push(make_pair(d[src] = 0, src)); !q.empty(); ) {
				c = q.top().first; u = q.top().second; q.pop();
				if (vis[u]++) continue;
				for (i = ptr[u]; ~i; i = next[i]) if (capa[i] > wEPS) {
					cc = c + cost[i] + pot[u] - pot[v = zu[i]];
					if (d[v] > cc) { q.push(make_pair(d[v] = cc, v)); pree[v] = i; }
				}
			}
			if (!vis[ink]) return 0;
			f = flo - tof;
			for (v = ink; v != src; v = zu[i ^ 1]) { i = pree[v]; chmin(f, capa[i]); }
			for (v = ink; v != src; v = zu[i ^ 1]) { i = pree[v]; capa[i] -= f; capa[i ^ 1] += f; }
			tof += f;
			toc += f * (d[ink] - pot[src] + pot[ink]);
			for (u = 0; u < n; ++u) pot[u] += d[u];
		}
		return 1;
	}
}


int N;
Int M;
vector<Int> A, B, C;

int main() {
  for (; ~scanf("%d%lld", &N, &M); ) {
    A.resize(N);
    B.resize(N);
    C.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld%lld%lld", &A[i], &B[i], &C[i]);
    }
    
    for (int i = 0; i < N; ++i) {
      if (A[i] > C[i]) {
        swap(A[i], C[i]);
      }
    }
    
    vector<Int> bs = B;
    sort(bs.begin(), bs.end());
    bs.erase(unique(bs.begin(), bs.end()), bs.end());
    const int bsLen = bs.size();
// cerr<<"bs = ";pv(bs.begin(),bs.end());
    
    MCF::init(2 + N + N + bsLen + bsLen);
    for (int i = 0; i < N; ++i) {
      MCF::ae(0, 2 + i, 1, 0);
    }
    for (int i = 0; i < N; ++i) {
      // b < A[i]
      {
        const int j = lower_bound(bs.begin(), bs.end(), A[i]) - bs.begin() - 1;
// cerr<<i<<": <= "<<j<<endl;
        if (j >= 0) {
          MCF::ae(2 + i, 2 + N + N + j, 1, -C[i]);
        }
      }
      // C[i] < b
      {
        const int j = upper_bound(bs.begin(), bs.end(), C[i]) - bs.begin();
// cerr<<i<<": >= "<<j<<endl;
        if (j < bsLen) {
          MCF::ae(2 + i, 2 + N + N + bsLen + j, 1, 0);
        }
      }
    }
    for (int j = 1; j < bsLen; ++j) {
      MCF::ae(2 + N + N + j, 2 + N + N + (j - 1), N, 0);
    }
    for (int j = 0; j < bsLen - 1;++j) {
      MCF::ae(2 + N + N + bsLen + j, 2 + N + N + bsLen + (j + 1), N, 0);
    }
    for (int i = 0; i < N; ++i) {
      const int j = lower_bound(bs.begin(), bs.end(), B[i]) - bs.begin();
      MCF::ae(2 + N + N + j, 2 + N + i, 1, 0);
      MCF::ae(2 + N + N + bsLen + j, 2 + N + i, 1, -B[i]);
    }
    for (int i = 0; i < N; ++i) {
      MCF::ae(2 + N + i, 1, 1, 0);
    }
    const bool res = MCF::solve(0, 1, N);
// cerr<<"tof = "<<MCF::tof<<", toc = "<<MCF::toc<<endl;
    if (res) {
      puts("YES");
      puts((-MCF::toc >= M) ? "KADOMATSU!" : "NO");
    } else {
      puts("NO");
    }
  }
  return 0;
}
0