제출 #620065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
620065		sword060	Vudu (COCI15_vudu)	C++17	56 / 140	721 ms	65536 KiB

vudu

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
long long seg[4*N];
vector<long long>comp;
map<long long,int>mp;
long long query(int i,int l,int r,int s,int e){
	if(l>e||r<s)return 0;
	if(l>=s&&r<=e)return seg[i];
	int mid=(l+r)/2;
	return (query((i<<1),l,mid,s,e)+query((i<<1|1),mid+1,r,s,e));
}
void update(int i,int l,int r,int s){
	if(l>s||r<s)return;
	if(l==s&&r==s){
		seg[i]++;
		return;
	}
	int mid = (l+r)/2;
	update((i<<1),l,mid,s);
	update((i<<1|1),mid+1,r,s);
	seg[i]=(seg[i<<1]+seg[i<<1|1]);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int x,k;cin>>x;
	long long a[x],ans=0;
	for(int i=0;i<x;i++)cin>>a[i];
	cin>>k;
	for(int i=0;i<x;i++)a[i]-=k;
	long long xd=0;
	comp.push_back(0);
	for(int i=0;i<x;i++){
	  xd+=a[i];
	  comp.push_back(xd);
	}
	sort(comp.begin(),comp.end());
	unique(comp.begin(),comp.end());
	for(int i=0;i<comp.size();i++)if(mp.find(comp[i])==mp.end())mp[comp[i]]=i;
	xd=0;
	update(1,0,N,mp[0]);
	for(int i=0;i<x;i++){
	  xd+=a[i];
	  ans+=query(1,0,N,0,mp[xd]);
	  update(1,0,N,mp[xd]);
	}
	cout<<ans;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

vudu.cpp: In function 'int main()':
vudu.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=0;i<comp.size();i++)if(mp.find(comp[i])==mp.end())mp[comp[i]]=i;
      |              ~^~~~~~~~~~~~

• Subtask 1: 56 / 140