제출 #97460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97460		KLPP	NLO (COCI18_nlo)	C++14	33 / 110	71 ms	66560 KiB

nlo

#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<int,int> pii;
set<int> s;
set<int>::iterator it;
lld A;
lld point;
lld calculate(vector<pair<int,pii > >v){
	sort(v.begin(),v.end());
	s.clear();
	point=0;
	A=0;
	for(int i=0;i<v.size();i++){
		if(s.size()>0){
			it=s.end();
			it--;
			lld s=*it;
			A+=s*(v[i].first-point);
			//cout<<s<<" "<<v[i].first-point<<endl;
		}
		point=v[i].first;
		//cout<<ans<<endl;
		if(v[i].second.second){
			s.erase(v[i].second.first);
		}else s.insert(v[i].second.first);
	}return A;
}
lld absol(lld a){
	if(a>0)return a;
	return -a;
}
lld lo,hi;
lld f(lld a, lld b){
	if(a<b)return -1;
	lo=0;
	hi=1000000000;
	while(hi-lo>1){
		lld mid=(hi+lo)/2;
		if(mid*mid+b*b<=a*a){
			lo=mid;
		}else hi=mid;
	}return lo;
}
int main(){
	int n,m;
	cin>>n>>m;
	int arr[n][m];
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)arr[i][j]=0;
	}int k;
	cin>>k;
	vector<pair<int,pii > > SETS[m];
	for(int i=1;i<=k;i++){
		int x,y,r;
		cin>>x>>y>>r;
		x--;y--;
		//cout<<x<<" "<<y<<endl;
		for(int j=0;j<m;j++){
			lld diff=absol(j-y);
			lld diff2=f(r,diff);
			if(diff2!=-1){
				//cout<<r<<" "<<diff<<" "<<f(r,diff)<<endl;
				//cout<<j<<" "<<x-diff2<<" "<<x+diff2<<endl;
				SETS[j].push_back(pair<int,pii>(x-diff2,pii(i,0)));
				SETS[j].push_back(pair<int,pii>(x+1+diff2,pii(i,1)));
			}
		}
	}
	
	lld ans=0;
	for(int i=0;i<m;i++){
		ans+=k*n-calculate(SETS[i]);
		//SETS[i]->print();
	}cout<<ans<<endl;
	return 0;
}

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

nlo.cpp: In function 'lld calculate(std::vector<std::pair<int, std::pair<int, int> > >)':
nlo.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++){
              ~^~~~~~~~~
nlo.cpp: In function 'int main()':
nlo.cpp:49:6: warning: variable 'arr' set but not used [-Wunused-but-set-variable]
  int arr[n][m];
      ^~~

• Subtask 1: 33 / 110