计蒜客信息学入门赛 #2--C|D

C:

思路：结构体排序，依次计算当前点与下一个的距离即可，注意%mod；

#include<iostream>
#include<algorithm>
#include<cstdio> 
const int mod=1e9+7;
using namespace std;
struct node{
	long long x;
	long long y;
}a[100000+10];
int n;
bool cmp(node a,node b){
	if(a.x==b.x)	return a.y<b.y;
	return a.x<b.x;
}
long long pf(long long x){
	return x*x;
}
void solve(){
	sort(a,a+n,cmp);
	long long xx=a[0].x,yy=a[0].y;
	long long ans=pf(xx)+pf(yy);
	for(int i=1;i<n;i++){
		ans+=pf(a[i].x-xx)+pf(a[i].y-yy);
		xx=a[i].x;
		yy=a[i].y;
		ans=ans%mod;
	}
	printf("%lld\n",ans);
}
int main(){
	while(cin>>n){
		for(int i=0;i<n;i++)
			cin>>a[i].x>>a[i].y;
		solve();
	}
}

D:

思路：二分思想，打表容易超时与超内存；

注意：数据类型选用ll;

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxa=1e5+10;
#define ll long long
ll n,q;
ll a[maxa],num[maxa];
int main(){
	ll query;
	while(cin>>n>>q){
		a[0]=num[0]=0;
		for(ll i=1;i<=n;i++){ 
			scanf("%lld%lld",&a[i],&num[i]);
			a[i]+=a[i-1]; 
			} 
		for(ll i=0;i<q;i++){
			scanf("%lld",&query);
			//二分查找
			ll left,right,mid;
			left=1,right=n;
			while(left<right){
				mid=(left+right)>>1;
				if(a[mid]>=query)	right=mid;
				else	left=mid+1;
			}
			printf("%lld\n",num[left]); 
		}
	}
	return 0;
}