oj.uz

답안 #249011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249011 2020-07-14T04:51:31 Z kshitij_sodani Vudu (COCI15_vudu) C++14
112 / 140
 707 ms 65540 KB 
/*
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
#define ord tree<llo,null_type,less_equal<llo>,rb_tree_tag,tree_order_statistics_node_update>



llo n;
llo it[1000001];
llo p;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n;i++){
		cin>>it[i];
	}
	cin>>p;
	for(llo i=0;i<n;i++){
		it[i]-=p;
	}
	ord ss;
	llo ans=0;
	llo su=0;
	ss.insert(0);
	for(llo i=0;i<n;i++){
		su+=it[i];
		ans+=ss.order_of_key(su+1);
		ss.insert(su);
		//cout<<ans<<endl;
	}
	cout<<ans<<endl;







	return 0;
}

/*
g++  -o aa -O2 box.cpp grader.cpp -std=c++14
*/

Subtask #1
112.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Runtime error 707 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Correct 368 ms 44136 KB Output is correct
6 Correct 621 ms 65536 KB Output is correct
7 Correct 629 ms 65536 KB Output is correct
8 Correct 543 ms 62328 KB Output is correct
9 Runtime error 582 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Correct 593 ms 65536 KB Output is correct