結果
問題 | No.929 よくあるボールを移動するやつ |
ユーザー |
![]() |
提出日時 | 2019-11-22 23:11:39 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 9 ms / 2,000 ms |
コード長 | 3,457 bytes |
コンパイル時間 | 1,679 ms |
コンパイル使用メモリ | 171,564 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-11 04:46:52 |
合計ジャッジ時間 | 2,379 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 12 |
ソースコード
#include<bits/stdc++.h>using namespace std;using ll = long long;using VI = vector<ll>;using VV = vector<VI>;using VS = vector<string>;// tourist settemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) {return '"' + s + '"';}string to_string(const char* s) {return to_string((string) s);}string to_string(bool b) {return (b ? "true" : "false");}string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {res += ", ";}first = false;res += to_string(v[i]);}res += "}";return res;}template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) {res += static_cast<char>('0' + v[i]);}return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";}void debug_out() { cerr << '\n'; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 42#endif// tourist set endtemplate<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; }#define FOR(i,a,b) for(ll i=(a);i<(b);++i)#define rep(i,b) FOR(i, 0, b)#define ALL(v) (v).begin(), (v).end()#define p(s) cout<<(s)<<'\n'#define p2(s, t) cout << (s) << " " << (t) << '\n'#define br() p("")#define pn(s) cout << (#s) << " " << (s) << '\n'#define p_yes() p("YES")#define p_no() p("NO")#define SZ(x) ((int)(x).size())#define SORT(A) sort(ALL(A))#define RSORT(A) sort(ALL(A), greater<ll>())void no(){p_no(); exit(0);}void yes(){p_yes(); exit(0);}const ll mod = 1e9 + 7;const ll inf = 1e18;const double PI = acos(-1);int main(){cin.tie(0);ios::sync_with_stdio(false);// inputll N;cin >> N;VI A(N);rep(i, N){cin >> A.at(i);}ll sum = 0;ll pos = 0;rep(i, N){if(A[i]==0){if(pos<=i) pos = i+1;while(A[pos]==0){pos++;}// そこから1つもってくるsum += pos-i;A[pos]--;}else if(A[i]==1){//}else{// 右に動かすll surplus = A[i]-1;A[i+1]+=surplus;sum += surplus;}}p(sum);return 0;}