Submission #1215236

#TimeUsernameProblemLanguageResultExecution timeMemory
1215236M_SH_OMoney (IZhO17_money)C++20
100 / 100
754 ms51188 KiB
#include <bits/stdc++.h> //#include "grader.h" #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define ll int #define ll1 long long #define ull unsigned long long #define dou long double #define str string #define vll vector<ll> #define vi vector<int> #define pll pair<ll, ll> #define vpll vector<pll> #define vbool vector<bool> #define vstr vector<str> #define vvll vector<vll> #define pb push_back #define pf push_front #define endl "\n" #define fr first #define se second // #define sortcmp(a) sort(a.begin(), a.end(), cmp) #define sort(a) sort(a.begin(), a.end()) #define all(a) a.begin(), a.end() #define reverse(a) reverse(a.begin(), a.end()) #define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define INF 5000000000000000000 #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> using namespace std; using namespace __gnu_pbds; mt19937 rng(1488); ll randll(ll l, ll r){ return uniform_int_distribution<ll>(l, r)(rng); } /*vector<map<ll, vll>> s; vll p; ll find(ll v) { if (p[v] == v) return v; return p[v] = find(p[v]); } void unite(ll a, ll b) { a = find(a); b = find(b); if (a == b) return; if (s[a].size() < s[b].size()) { p[a] = b; for (auto i : s[a]) { for (int j : i.se) { s[b][i.fr].pb(j); } } s[a].clear(); } else { p[b] = a; for (auto i : s[b]) { for (int j : i.se) { s[a][i.fr].pb(j); } } s[b].clear(); } } vll tree1; void bt(ll v, ll tl, ll tr, vll& a) { if (tl == tr) { tree1[v] = a[tl]; return; } ll tm = (tl+tr)/2; bt(v*2, tl, tm, a); bt(v*2, tm+1, tr, a); tree1[v] = tree1[v*2]+tree1[v*2+1]; } ll get(ll l, ll r, ll v, ll tl, ll tr) { if (l <= tl && tr <= r) return tree1[v]; if (tl > r || tr < l) return 0; ll tm = (tl+tr)/2; return get(l, r, v*2, tl, tm)+get(l, r, v*2+1, tm+1, tr); } void update(ll idx, ll val, ll v, ll tl, ll tr) { if (tl == tr) { tree1[v] = val; return; } ll tm = (tl+tr)/2; if (idx <= tm) update(idx, val, v*2, tl, tm); else update(idx, val, v*2+1, tm+1, tr); tree1[v] = tree1[v*2]+tree1[v*2+1]; }*/ int main() { ll n; cin >> n; vll a(n); for (int i =0 ; i < n; i ++) { cin >> a[i]; } set<ll> s; ll res = 0; for (int i = 0; i < n; i ++) { res ++; ll x = INF; if (s.upper_bound(a[i]) != s.end()) { x = *s.upper_bound(a[i]); } ll l = i+1; for (int j = i; j < n; j ++) { if (a[j] <= x && (j == i || a[j] >= a[j-1])) s.insert(a[j]); else break; l = j+1; } i = l-1; } cout << res << endl; }

Compilation message (stderr)

money.cpp: In function 'int main()':
money.cpp:28:13: warning: overflow in conversion from 'long int' to 'int' changes value from '5000000000000000000' to '1156841472' [-Woverflow]
   28 | #define INF 5000000000000000000
      |             ^~~~~~~~~~~~~~~~~~~
money.cpp:123:16: note: in expansion of macro 'INF'
  123 |         ll x = INF;
      |                ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...