oj.uz

답안 #89456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89456 2018-12-14T21:34:47 Z jasony123123 Vudu (COCI15_vudu) C++11
0 / 140
 347 ms 27968 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("vudu.in.4", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**********************COCI 16-17 R2 P5*****************************/

const int MAXN = 1e6 + 10;
ll N, A[MAXN], P;
v<pll> ordered;
ll ans = 0;

int bit[MAXN];
void update(int k, int val) { 
	for (k++; k <= N + 1; k += (k&-k))
		bit[k] += val;
}
int query(int k) {
	int temp = 0;
	for (k++; k > 0; k -= (k&-k))
		temp += bit[k];
	return temp;
}
int query(int l, int r) {
	if (l > r) return 0;
	return query(r) - query(l - 1);
}

int main() {
	io();
	cin >> N;
	cout << N << "\n";
	FORE(i, 1, N) cin >> A[i];
	cin >> P;
	FORE(i, 1, N) A[i] -= P;
	FORE(i, 1, N) A[i] += A[i - 1];
	FORE(i, 0, N) ordered.push_back({ A[i], i });
	sort(all(ordered));
	reverse(all(ordered));
	for (auto &op : ordered) {
		ans += query(op.second + 1, N);
		update(op.second, 1);
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 632 KB Output isn't correct
2 Incorrect 3 ms 756 KB Output isn't correct
3 Incorrect 3 ms 808 KB Output isn't correct
4 Incorrect 322 ms 27008 KB Output isn't correct
5 Incorrect 180 ms 27008 KB Output isn't correct
6 Incorrect 297 ms 27008 KB Output isn't correct
7 Incorrect 285 ms 27008 KB Output isn't correct
8 Incorrect 247 ms 27008 KB Output isn't correct
9 Incorrect 347 ms 27968 KB Output isn't correct
10 Incorrect 262 ms 27968 KB Output isn't correct