Submission #758158

#TimeUsernameProblemLanguageResultExecution timeMemory
758158vjudge1Money (IZhO17_money)C++17
100 / 100
673 ms30692 KiB
#ifndef _GLIBCXX_NO_ASSERT #include <cassert> #endif #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #if __cplusplus >= 201103L #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #endif #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <fstream> #define endl '\n' #define int long long using namespace std; int seg[3000001],a[1000001]; int N,Left,Right; void Update(int pos){ int ind = N + pos - 1; seg[ind]++; while(ind /= 2) seg[ind] = seg[ind * 2 + 1] + seg[ind * 2]; } int Query(int l = 1, int r = N, int ind = 1){ if(l > Right or r < Left) return 0; if(l >= Left and r <= Right) return seg[ind]; int mid = (l + r ) / 2; return Query(l, mid, ind * 2) + Query(mid + 1, r, ind * 2 + 1); } signed main() { int n, ans = 0; cin >> n; N = exp2(ceil(log2(1e6))); for(int i = 0; i < n; i++) cin >> a[i]; int v = a[0]; vector<int>k; Update(v); for(int i = 1; i < n; i++){ if(a[i] >= a[i - 1]){ Left = v + 1; Right = a[i] - 1; if(Query() == 0) { k.push_back(a[i]); continue; } } ans++; v = a[i]; for(auto s : k) Update(s); k.clear(); k.push_back(a[i]); } cout << ans + 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...