#579706 (C++14) No.1288 yuki collection

提出ソース

結果

問題	No.1288 yuki collection
ユーザー	kaikey
提出日時	2020-11-13 22:43:07
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,412 bytes
コンパイル時間	2,103 ms
コンパイル使用メモリ	192,284 KB
実行使用メモリ	59,168 KB
最終ジャッジ日時	2024-07-22 21:44:33
合計ジャッジ時間	54,109 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	3 ms 6,944 KB
testcase_03	AC	3 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	3 ms 6,940 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	3 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	3 ms 6,944 KB
testcase_13	AC	2,872 ms 34,708 KB
testcase_14	AC	2,809 ms 34,680 KB
testcase_15	AC	1,972 ms 29,128 KB
testcase_16	AC	2,023 ms 29,384 KB
testcase_17	AC	2,831 ms 34,156 KB
testcase_18	AC	2,848 ms 34,632 KB
testcase_19	AC	2,816 ms 34,364 KB
testcase_20	AC	2,947 ms 35,004 KB
testcase_21	AC	3,892 ms 47,152 KB
testcase_22	AC	3,872 ms 47,292 KB
testcase_23	AC	3,661 ms 46,404 KB
testcase_24	AC	2,976 ms 34,784 KB
testcase_25	AC	2,781 ms 35,268 KB
testcase_26	AC	2,765 ms 34,856 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	1,278 ms 31,136 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	TLE	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
const lint MOD = 1e9 + 7, INF = 1e9;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
void YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; }
typedef pair<lint, string> Pa;
typedef pair<lint, plint> tlint;


template<typename flow_t, typename cost_t>
struct Flow {
	struct edge {
		lint to;
		flow_t cap;
		cost_t cost;
		lint rev;
	};
	vector<vector<edge> > Graph;
	vector<cost_t> potential, min_cost;
	vector<lint> prevv, preve;
	vector<lint> level;
	vector<lint> iter;

	Flow(lint V) :Graph(V) {}

	void add_edge(lint from, lint to, flow_t cap, cost_t cost = 0) {
		Graph[from].push_back({ to, cap, cost, SZ(Graph[to]) });
		Graph[to].push_back({ from, 0, -cost, SZ(Graph[from]) - 1 });
	}

	void bfs(lint s) {
		lint V = SZ(Graph);
		level.assign(V, -1);
		queue<lint> que;
		que.push(s);
		level[s] = 0;
		while (!que.empty()) {
			lint v = que.front(); que.pop();
			REP(i, SZ(Graph[v])) {
				edge& e = Graph[v][i];
				if (e.cap > 0 && level[e.to] < 0) {
					level[e.to] = level[v] + 1;
					que.push(e.to);
				}
			}
		}
	}

	flow_t dfs(lint v, lint t, flow_t f) {
		if (v == t) return f;
		for (lint& i = iter[v]; i < SZ(Graph[v]); i++) {
			edge& e = Graph[v][i];
			if (e.cap > 0 && level[v] < level[e.to]) {
				flow_t d = dfs(e.to, t, min(f, e.cap));
				if (d > 0) {
					e.cap -= d;
					Graph[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}

	flow_t max_flow(lint s, lint t) {
		flow_t flow = 0;
		lint V = SZ(Graph);
		for (;;) {
			bfs(s);
			if (level[t] < 0) return flow;
			iter.assign(V, 0);
			flow_t f;
			while ((f = dfs(s, t, INF)) > 0) {
				flow += f;
			}
		}
	}

	lint min_cost_flow(lint s, lint t, lint f) {
		cost_t res = 0;
		lint V = SZ(Graph);

		potential.assign(V, 0);
		prevv.assign(V, -1);
		preve.assign(V, -1);

		while (f > 0) {
			priority_queue<pair<cost_t, lint>, vector<pair<cost_t, lint> >, greater<pair<cost_t, lint> > > que;
			min_cost.assign(V, INF);
			min_cost[s] = 0;
			que.push({ 0, s });
			while (!que.empty()) {
				pair<cost_t, lint> p = que.top(); que.pop();
				lint v = p.second;
				if (min_cost[v] < p.first) continue;
				REP(i, SZ(Graph[v])) {
					edge& e = Graph[v][i];
					cost_t nextCost = min_cost[v] + e.cost + potential[v] - potential[e.to];
					if (e.cap > 0 && min_cost[e.to] > nextCost) {
						min_cost[e.to] = nextCost;
						prevv[e.to] = v;
						preve[e.to] = i;
						que.push({ min_cost[e.to], e.to });
					}
				}
			}
			if (min_cost[t] == INF) {
				return -1;
			}
			REP(v, V) potential[v] += min_cost[v];

			flow_t addflow = f;
			for (lint v = t; v != s; v = prevv[v]) {
				addflow = min(addflow, Graph[prevv[v]][preve[v]].cap);
			}
			f -= addflow;
			res += addflow * potential[t];
			for (lint v = t; v != s; v = prevv[v]) {
				edge& e = Graph[prevv[v]][preve[v]];
				e.cap -= addflow;
				Graph[v][e.rev].cap += addflow;
			}
		}
		return res;
	}
};


lint N;
map<char, lint> mp;
int main() {
	mp['y'] = 0;
	mp['u'] = 1;
	mp['k'] = 2;
	mp['i'] = 3;
	lint N;
	cin >> N;
	string str;
	cin >> str;
	vector<lint> arr(N);
	REP(i, N) {
		cin >> arr[i];
	}
	lint s = 2 * N, t = s + 1;
	Flow<lint, lint> g(2 * N + 2);
	REP(i, N) {
		if (str[i] == 'y') {
			g.add_edge(s, i, 1, 0);
		}
		if (str[i] == 'i') {
			g.add_edge(N + i, t, 1, 0);
		}
		FOR(j, i + 1, N) {
			if (mp[str[i]] + 1 == mp[str[j]]) {
				g.add_edge(N + i, j, 1, 0);
			}
		}
	}
	REP(i, N) {
		g.add_edge(i, i + N, 1, - arr[i]);
	}
	g.add_edge(s, t, N / 4, 0);
	cout << -g.min_cost_flow(s, t, N / 4) << endk;
}

yukicoder

結果

テストケース

ソースコード