oj.uz

Submission #570157

# Submission time Handle Problem Language Result Execution time Memory
570157 2022-05-28T19:46:28 Z XJP12 Mountains (NOI20_mountains) C++14
0 / 100
 2000 ms 1364 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
  int n;
  cin>>n;
  vector<int> v(n);
  for(int i=0; i<n; i++){
     cin>>v[i];
  }
  int cont=1;
  ll ans=0;
  int a,b;
  while(cont<n-1){
     a=0;
     b=0;
     for(int i=0; i<cont; i++){
        if(v[i]<v[cont]) a++;
     }
     for(int i=cont+1; i<n; i++){
        if(v[i]<v[cont]) b++;
     }
     ans+=a*b;
     cont++;
  }
  cout<<ans<<endl;
   return 0;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2095 ms 1364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2094 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 2094 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 2094 ms 1364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2095 ms 1364 KB Time limit exceeded
3 Halted 0 ms 0 KB -