oj.uz

Submission #570167

# Submission time Handle Problem Language Result Execution time Memory
570167 2022-05-28T19:55:29 Z juliocesar97 Mountains (NOI20_mountains) C++14
0 / 100
 2000 ms 1364 KB 
/*
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;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 1364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 1364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 1364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -