【杂题】 HDOJ 4995 Revenge of kNN

哎。。。比赛的时候一而再再而三地把题目读错。。。其实这题不是很难。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

struct node
{
    int x, id;
    double v;
}p[maxn], tmp;
int n, m, k;
int xx[maxn];

int cmp(node a, node b)
{
    return a.x < b.x;
}
void read(void)
{
    scanf("%d%d%d", &n, &m, &k);
    for(int i = 1; i <= n; i++) {
        scanf("%d%lf", &p[i].x, &p[i].v);
        p[i].id = i;
    }
    sort(p+1, p+n+1, cmp);
	for(int i = 1; i <= n; i++) xx[p[i].id] = i;
}
void work(void)
{
    int a, b, tt, x, t, aa, bb;
    double ans = 0, sum;
    while(m--) {
        scanf("%d", &x);
        t = xx[x];
        sum = 0;
        tt = k, a = t-1, b = t+1;
        while(tt--) {
            if(a == 0) sum += p[b++].v;
            else if(b == n+1) sum += p[a--].v;
            else {
                aa = abs(p[a].x - p[t].x);
                bb = abs(p[b].x - p[t].x);
                if(aa == bb) {
                    if(p[a].id < p[b].id) sum += p[a--].v;
                    else sum += p[b++].v;
                }
                else if(aa > bb) sum += p[b++].v;
                else sum += p[a--].v;
            }
        }
        sum /= k;
        ans += sum;
        p[t].v = sum;
    }
    printf("%.6f\n", ans);
}
int main(void)
{
    int _;
    while(scanf("%d", &_)!=EOF) {
		while(_--) {
			read();
			work();
		}
    }
    return 0;
}