Submission #570167

#TimeUsernameProblemLanguageResultExecution timeMemory
570167juliocesar97Mountains (NOI20_mountains)C++14
0 / 100
2061 ms1364 KiB
/* y = station x and y = reciving stations order = x.y.z x and z shorter than mountain y */ #include <bits/stdc++.h> using namespace std; int main(){ int n; int cont1=0; int cont2=0; int ans1=0; int ans2 = 0; cin>>n; int v[n]; for(int i=0; i<n; i++){ cin>>v[i]; } for(int i=1; i<n; i++){ for(int j=0; j<i; j++){ if(v[i] > v[j]){ cont1 += 1; } } for(int k=n; k>i; k--){ if(v[i] > v[k]){ cont2 +=1; ans1 = cont1*cont2;} } ans2 += ans1; cont1 =0; cont2=0; ans1=0; } //cout<<"program compiled, output: "<<ans2; cout<<ans2; 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...