Submission #1030341

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030341		TIN	Vudu (COCI15_vudu)	C++17	112 / 140	462 ms	65536 KiB

vudu

#include <bits/stdc++.h>
 
using namespace std;
 
#define FNAME "test"
 
typedef long long ll;
 
const int N = 1e6 + 5;
 
int n;
vector<ll> a;
ll P;
vector<ll> pre;
ll mx;
ll ans;
 
struct Fenwick {
	int n;
	vector<ll> f;
 
	Fenwick(int _n) {
		n = _n;
		f.resize(n + 5, 0LL);
	}
 
	void set(int i) {
		for (; i <= n; i += i & (-i)) f[i]++;
	}
 
	ll get(int i) {
		ll r = 0;
		for (; i > 0; i -= i & (-i)) r += f[i];
		return r;
	}
};
 
void Task() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cout << fixed << setprecision(9);
	if (fopen(FNAME".inp","r")) {
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}
 
void compress(vector<ll>& v) {
	set<ll> s(v.begin(), v.end());
	vector<ll> b(s.begin(), s.end());
	mx = (int) b.size() + 1;
	for (ll &x : v) x = lower_bound(b.begin(), b.end(), x) - b.begin() + 1;
	return;
}
 
void Solve() {
	//Your Code
	cin >> n;
  	a.resize(n + 1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	cin >> P;
	pre.resize(n + 1);
	pre[0] = 0;
	for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + (a[i] - P);
	compress(pre);
	Fenwick BIT(n + 5);
	ans = 0;
	for (int i = 1; i <= n; i++) {
		BIT.set(pre[i - 1]);
		ans += BIT.get(pre[i]);
	}
	cout << ans << '\n';
	return;
}
 
int main() {
	Task();
	Solve();
	cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
	return 37^37;
}

Compilation message (stderr)

vudu.cpp: In function 'void Task()':
vudu.cpp:43:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   freopen(FNAME".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
vudu.cpp:44:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |   freopen(FNAME".out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 112 / 140