結果
| 問題 | No.1029 JJOOII 3 |
| ユーザー |
 heno239
|
| 提出日時 | 2020-04-17 21:56:45 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 62 ms / 2,000 ms |
| コード長 | 3,744 bytes |
| コンパイル時間 | 1,146 ms |
| コンパイル使用メモリ | 121,480 KB |
| 実行使用メモリ | 6,016 KB |
| 最終ジャッジ日時 | 2024-10-03 12:49:13 |
| 合計ジャッジ時間 | 3,121 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 38 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;const ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);ll mod_pow(ll a, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * a%m;a = a * a%m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n%mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, int n) {if (n == 0)return modint(1);modint res = (a*a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 10000;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}int dx[4] = { 0,1,0,-1 };int dy[4] = { 1,0,-1,0 };int n, k;bool isvalid(int id, char c) {if (id < k)return c == 'J';else if (id < 2 * k)return c == 'O';else if (id < 3 * k)return c == 'I';return false;}ll dp[300001];void solve() {cin >> n >> k;vector<string> s(n);vector<ll> c(n);vector<vector<int>> num(n, vector<int>(3));rep(i, n) {cin >> s[i] >> c[i];}rep(i, n) {for (char c : s[i]) {if (c == 'J')num[i][0]++;else if (c == 'O')num[i][1]++;else num[i][2]++;}}rep(i, 3 * k+1)dp[i] = INF;dp[0] = 0;rep(i, 3 * k) {rep(j, n) {int to = i;if (i < k&&k - i > num[j][0]) {to += num[j][0];}else if (i>=k&&i < 2 * k && 2 * k - i > num[j][1]) {to += num[j][1];}else if (i>=2*k&&3 * k - i > num[j][2]) {to += num[j][2];}else {for (char c : s[j]) {if (isvalid(to, c))to++;}}dp[to] = min(dp[to], dp[i] + c[j]);}}ll ans = dp[3 * k];if (ans == INF) {ans = -1;}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(7);//init_f();//init();//experi();//int t; cin >> t; rep(i, t)solve();solve();stopreturn 0;}