oj.uz

Submission #1112472

# Submission time Handle Problem Language Result Execution time Memory
1112472 2024-11-14T08:36:54 Z vjudge1 Baloni (COCI15_baloni) C++17
100 / 100
 277 ms 14152 KB 
#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<int> grouplast(n); grouplast[0] = h[0];
    int k = 0;
    for (int i = 0; i < n; i++) {
        auto it = find(grouplast.begin(), grouplast.begin() + k, h[i] + 1);
        *it = h[i]; if (it == grouplast.begin() + k) k++;
    }
    cout << k;
}

Compilation message

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
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 159 ms 12784 KB Output is correct
6 Correct 277 ms 14152 KB Output is correct
7 Correct 243 ms 11856 KB Output is correct
8 Correct 234 ms 11592 KB Output is correct
9 Correct 196 ms 12360 KB Output is correct
10 Correct 245 ms 12616 KB Output is correct