Submission #570196

#	Time	Username	Problem	Language	Result	Execution time	Memory
570196		ChrisM2309	Mountains (NOI20_mountains)	C++14	64 / 100	2083 ms	2644 KiB

Mountains

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<ii> vii; 
typedef vector<vii> wgraf;
typedef pair<int,ii> edge;

#define UNVISITED 0
#define VISITED 1
#define INF 1000000000
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()

void RESOLVER(){
    int n;
    cin >> n;
    vector<ll> data(n);
    ll ans = 0;
    for (auto &i : data) cin >> i;
    for (int i = 0; i < n; i++){
        //cout << data[i] << " -- ";
        ll iz = 0, der = 0;
        for (int j = 0; j < i; j++){
            //cout << data[j] << " "; 
            if (data[j]<data[i]) iz++;
        } 
        //cout << " con ";
        for (int j = i + 1; j < n; j++) {
            //cout << data[j] << " "; 
            if (data[j] < data[i]) der++;
        }
        //cout << "\n";
        ans += (iz * der);
    }
    cout << ans; 
    
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  //cin >> t;
  while(t--){
    RESOLVER();
  }
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 36 / 36
• Subtask 5: 28 / 28
• Subtask 6: 0 / 9
• Subtask 7: 0 / 12