Submission #249012

#TimeUsernameProblemLanguageResultExecution timeMemory
249012kshitij_sodaniVudu (COCI15_vudu)C++14
126 / 140
743 ms65540 KiB
/* */ #include <bits/stdc++.h> using namespace std; typedef long long llo; #define mp make_pair #define pb push_back #define a first #define b second #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define ord tree<llo,null_type,less_equal<llo>,rb_tree_tag,tree_order_statistics_node_update> int n; int it[1000001]; int p; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n; for(llo i=0;i<n;i++){ cin>>it[i]; } cin>>p; for(llo i=0;i<n;i++){ it[i]-=p; } ord ss; llo ans=0; llo su=0; ss.insert(0); for(llo i=0;i<n;i++){ su+=it[i]; ans+=ss.order_of_key(su+1); ss.insert(su); //cout<<ans<<endl; } cout<<ans<<endl; return 0; } /* g++ -o aa -O2 box.cpp grader.cpp -std=c++14 */
#Verdict Execution timeMemoryGrader output
Fetching results...