Submission #710346

#TimeUsernameProblemLanguageResultExecution timeMemory
710346shoryu386Money (IZhO17_money)C++17
0 / 100
1 ms256 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T> using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template <typename K, typename V> using pbds_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> using pbds_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; template <typename K, typename V> using pbds_multimap = tree<K, V, less_equal<K>, rb_tree_tag, tree_order_statistics_node_update>; //FOR PBDS MULTISET/MAP, LOWER BOUND SWAPS WITH UPPER BOUND IN FUNCTION #define int long long main(){ int n; cin >> n; int arr[n]; for (int x= 0; x < n;x ++) cin >> arr[x]; vector<vector<int>> subsegs; pbds_multiset<int> used; vector<int> curSubseg; for (int x = 0; x < n; x++){ //no ele in between curval + 1 and arr[x]-1 inclusive //curval+1 <= x <= arr[x]-1 //curval < x < arr[x] if (curSubseg.empty() || (curSubseg.back() <= arr[x] && used.order_of_key(curSubseg[0]+1) == used.order_of_key(arr[x]))) curSubseg.push_back(arr[x]); else{ for (auto i : curSubseg) used.insert(i); subsegs.push_back(curSubseg), curSubseg.clear(); curSubseg.push_back(arr[x]); } } if (!curSubseg.empty()) subsegs.push_back(curSubseg); cout << subsegs.size(); }

Compilation message (stderr)

money.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | 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...