Submission #570192

#	Time	Username	Problem	Language	Result	Execution time	Memory
570192		kamilamartinez	Mountains (NOI20_mountains)	C++14	70 / 100	2090 ms	7164 KiB

Mountains

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <ll> unos;

int main() {
	ll n, i, cont=0, a, b, j, uc=0, cc=0;
	cin >> n;
	ll xd[n], ceros[n];
	bool lol=false, kk=false;
	for(i=0;i<n;i++) {
		cin >> xd[i];
		if(xd[i-1]>xd[i]) lol=true;
		if(xd[i]!=0 && xd[i]!=1) kk=true;
		if(xd[i]==1) uc++, unos.push_back(i);
		if(xd[i]==0) cc++;
		ceros[i]=cc;
	}
	if(lol==false) {
		cout << "0" << endl;
		return 0;
	}


	if(kk==false) {
		for(i=0;i<uc;i++) {
			if(unos[i]!=0 && unos[i]!=n-1) {
				cont+=ceros[unos[i]]*(cc-ceros[unos[i]]);
			}
			
		}
		cout << cont << endl;
		return 0;
	}
	
	for(i=1;i<n-1;i++) {
		a=0;
		b=0;
		for(j=0;j<i;j++) {
			if(xd[j]<xd[i]) a++;
		}
		for(j=i+1;j<n;j++) {
			if(xd[j]<xd[i]) b++;
		}
		cont+=a*b;
	}
	cout << cont << endl;
	return 0;
}

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