結果
問題 | No.78 クジ付きアイスバー |
ユーザー |
![]() |
提出日時 | 2016-03-05 20:49:08 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,889 bytes |
コンパイル時間 | 1,588 ms |
コンパイル使用メモリ | 162,960 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-08 01:37:32 |
合計ジャッジ時間 | 2,513 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define all(c) ((c).begin()), ((c).end())#define dump(c) cerr << "> " << #c << " = " << (c) << endl;#define iter(c) __typeof((c).begin())#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)#define REP(i, a, b) for (int i = a; i < (int)(b); i++)#define rep(i, n) REP(i, 0, n)#define mp make_pair#define fst first#define snd second#define pb push_back#define debug(fmt, ...) \fprintf( stderr, \fmt "\n", \##__VA_ARGS__ \)typedef unsigned int uint;typedef long long ll;typedef unsigned long long ull;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<vll> vvll;typedef vector<vi> vvi;typedef vector<double> vd;typedef vector<vd> vvd;typedef vector<string> vs;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1 << 29;const double EPS = 1e-10;double zero(double d) {return d < EPS ? 0.0 : d;}template<class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template<class T>bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2> &p) {return os << '(' << p.first << ',' << p.second << ')';}template<typename T>ostream &operator<<(ostream &os, const vector<T> &a) {os << '[';rep(i, a.size()) os << (i ? " " : "") << a[i];return os << ']';}string toString(int i) {stringstream ss;ss << i;return ss.str();}const int MOD = 1000000007;// a^kll fpow(ll a, ll k, int M) {ll res = 1ll;ll x = a;while (k != 0) {if ((k & 1) == 1)res = (res * x) % M;x = (x * x) % M;k >>= 1;}return res;}struct prepare {prepare() {cout.setf(ios::fixed, ios::floatfield);cout.precision(8);ios_base::sync_with_stdio(false);}} _prepare;int main() {int N, K;cin >> N >> K;string str;cin >> str;vi ice(N * 2, 0);rep(i, N) ice[i] = str[i] - '0';rep(i, N) ice[i + N] = str[i] - '0';rep(i, ice.size()) {if (ice[i] >= 2) {int add = ice[i] - 1;rep(j, add)ice[min(i + j + 1, N*2-1)]++;ice[i] = 1;}}int ans = 1;// firstREP(i, 1, min(N, K))if (ice[i - 1] == 0)ans++;// middleint buySecond = count(begin(ice) + N, end(ice), 0);ans += buySecond * max(0, ((K / N) - 1));// lastif (K > N) {rep(i, (K % N)) {if (ice[N + i - 1] == 0)ans++;}}cout << ans << endl;return 0;}