Submission #1112396

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112396		vjudge1	Baloni (COCI15_baloni)	C++17	0 / 100	2075 ms	7392 KiB

baloni

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define nmod(a, b) (((a%b)+b)%b) // stands for [n]atural [mod], as in "will always return a natural number", should be used in case of negative
#define a2b(a, b) (a << b) // a*2^b
#define bit(a, b) ((a >> b) & 1) // bth bit from the right, starts at zero
using namespace std;
template<class T> using vec = vector<T>;

const int INFTY = (1LL << 63) - 1;
const int NNFTY = 1LL << 63;

int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    vec<int> h(n); for (auto &x : h) cin >> x;
    vec<bool> ok(n, false);
    int k = 0;
    for (int i = 0; i < n; i++) {
        if (!ok[i]) {
            k++;
            int li = i;
            ok[i] = true;
            for (int j = li + 1; j < n; j++) {
                if (ok[j]) continue;
                if (j - li == h[li] - h[j]) ok[j] = true, li = j;
            }
        }
    }
    cout << k;
}

Compilation message (stderr)

baloni.cpp:10:31: warning: integer overflow in expression of type 'long long int' results in '9223372036854775807' [-Woverflow]
   10 | const int INFTY = (1LL << 63) - 1;
      |                   ~~~~~~~~~~~~^~~

• Subtask 1: 0 / 100