Submission #1181776

#TimeUsernameProblemLanguageResultExecution timeMemory
1181776ihsanizinliMountains (NOI20_mountains)C++20
0 / 100
2095 ms2788 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; vector<int> v(n); for(int i=0;i<n;i++){ cin>>v[i]; } int res=0; int y=1; while(y<n-1){ vector<int> left(v.begin(), v.begin() + y); sort(left.begin(),left.end()); auto l = lower_bound(left.begin(), left.end(), v[y]); int countl = distance(left.begin(), l); vector<int> right(v.begin()+y+1, v.end()); sort(right.begin(),right.end()); auto r = lower_bound(right.begin(), right.end(), v[y]); int countr = distance(right.begin(), r); res+=countl*countr; y++; } cout<<res<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...