Submission #338546

#TimeUsernameProblemLanguageResultExecution timeMemory
338546IZhO_2021_I_want_SilverMoney (IZhO17_money)C++14
0 / 100
1 ms364 KiB
#include <iostream> #include <algorithm> #include <vector> #include <cmath> #include <set> #include <map> #include <iomanip> #include <cassert> #include <stack> #include <queue> #include <deque> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; // template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // order_of_key (k) : Number of items strictly smaller than k . // find_by_order(k) : K-th element in a set (counting from zero). #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define pb push_back #define ppb pop_back #define mkp make_pair #define F first #define S second #define lb lower_bound #define ub upper_bound #define show(a) cerr << #a <<" -> "<< a <<" " #define nl cerr <<"\n" //#define int ll const int N = (1 << 20) - 1; const int oo = 1e9 + 5; int n, a[N], ans, t[N*2]; void upd(int pos, int x) { pos += N; t[pos] += x; while ((pos /= 2) >= 1) { t[pos] = t[pos*2] + t[pos*2+1]; } } int get(int l, int r) { int res = 0; for (l += N, r += N; l <= r; l /= 2, r /= 2) { if (l % 2 == 1) { res += t[l++]; } if (r % 2 == 0) { res += t[r--]; } if (l > r) { break; } } return res; } void solve() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= n; ++i) { //show(i); int cur = a[i]; while (i + 1 <= n && a[i] <= a[i + 1] && get(cur+1, a[i+1]-1) == 0) { ++i; upd(a[i], 1); } upd(cur, 1); //show(i); nl; ++ans; } cout << ans; } main () { ios_base::sync_with_stdio(false); cin.tie(NULL); int tests = 1; //cin >> tests; while (tests --) { solve(); } return 0; } /* Just Chalish! */

Compilation message (stderr)

money.cpp:80:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 |  main () {
      |        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...