Submission #524006

#TimeUsernameProblemLanguageResultExecution timeMemory
524006NursikMoney (IZhO17_money)C++14
0 / 100
0 ms332 KiB
#include <bits/stdc++.h> #define pb push_back #define ll long long #define ld long double #define f first #define s second #define mp make_pair const ll maxn = 1e6 + 1, maxm = 3e5 + 1, maxk = 61; const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353; const ll pa = 31, block = 400; using namespace std; int n; int a[maxn], f[maxn]; void upd(int pos, int val){ for (int i = pos; i <= 1e6; i |= (i + 1)){ f[i] += val; } } int get(int pos){ int res = 0; for (int i = pos; i >= 1; i = (i & (i + 1)) - 1){ res += f[i]; } return res; } int main(){ cin >> n; for (int i = 1; i <= n; ++i){ cin >> a[i]; } int pos = 1, ans = 0; vector<int> v; v.pb(0), v.pb(inf); while (pos <= n){ int mx = 0, mn = inf, answ = pos;; for (int j = pos; j <= n; ++j){ if ((j == pos) || (j - 1 >= pos && a[j] >= a[j - 1])){ mx = max(mx, a[j]); mn = min(mn, a[j]); int range = get(mx - 1) - get(mn + 1); range = max(range, 0); if (range == 0){ answ = j; } else{ break; } } else{ // cout << a[j] << " " << a[j - 1] << '\n'; break; } } ans++; mn = inf, mx = 0; for (int j = pos; j <= answ; ++j){ mn = min(mn, a[j]); mx = max(mx, a[j]); upd(a[j], 1); } for (int k = 0; k < v.size() - 1; ++k){ if (v[k] <= mn && mx <= v[k + 1]){ vector<int> nw; for (int i = 0; i <= k; ++i){ nw.pb(v[i]); } for (int j = pos; j <= answ; ++j){ nw.pb(a[j]); } for (int i = k + 1; i < v.size(); ++i){ nw.pb(v[i]); } v = nw; break; } } pos = answ + 1; } cout << ans; }

Compilation message (stderr)

money.cpp: In function 'int main()':
money.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int k = 0; k < v.size() - 1; ++k){
      |                         ~~^~~~~~~~~~~~~~
money.cpp:74:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                 for (int i = k + 1; i < v.size(); ++i){
      |                                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...