0_0_34182468_15247\Main.java:1: 错误: 非法字符: '#'
#include <stdio.h>
^
0_0_34182468_15247\Main.java:1: 错误: 需要class, interface或enum
#include <stdio.h>
^
0_0_34182468_15247\Main.java:2: 错误: 非法字符: '#'
#include <vector>
^
0_0_34182468_15247\Main.java:3: 错误: 非法字符: '#'
#include <algorithm>
^
0_0_34182468_15247\Main.java:4: 错误: 非法字符: '#'
#include <string.h>
^
0_0_34182468_15247\Main.java:5: 错误: 非法字符: '#'
#include <limits.h>
^
0_0_34182468_15247\Main.java:6: 错误: 非法字符: '#'
#include <string>
^
0_0_34182468_15247\Main.java:7: 错误: 非法字符: '#'
#include <iostream>
^
0_0_34182468_15247\Main.java:8: 错误: 非法字符: '#'
#include <queue>
^
0_0_34182468_15247\Main.java:9: 错误: 非法字符: '#'
#include <math.h>
^
0_0_34182468_15247\Main.java:10: 错误: 非法字符: '#'
#include <map>
^
0_0_34182468_15247\Main.java:11: 错误: 非法字符: '#'
#include <stack>
^
0_0_34182468_15247\Main.java:12: 错误: 非法字符: '#'
#include <set>
^
0_0_34182468_15247\Main.java:13: 错误: 非法字符: '#'
#define left (now<<1)
^
0_0_34182468_15247\Main.java:14: 错误: 非法字符: '#'
#define right ((now<<1)+1)
^
0_0_34182468_15247\Main.java:15: 错误: 非法字符: '#'
#define mid ((l+r)>>1)
^
0_0_34182468_15247\Main.java:17: 错误: 需要class, interface或enum
typedef long long int lint;
^
0_0_34182468_15247\Main.java:19: 错误: 需要class, interface或enum
const int MAXN = 1e5 + 10;
^
0_0_34182468_15247\Main.java:21: 错误: 需要class, interface或enum
struct kdTree{
^
0_0_34182468_15247\Main.java:23: 错误: 需要class, interface或enum
int id;
^
0_0_34182468_15247\Main.java:24: 错误: 需要class, interface或enum
double dis;
^
0_0_34182468_15247\Main.java:25: 错误: 需要class, interface或enum
};
^
0_0_34182468_15247\Main.java:27: 错误: 需要class, interface或enum
kdTree tree[MAXN],a[MAXN],kdans,qu;
^
0_0_34182468_15247\Main.java:28: 错误: 需要class, interface或enum
int dv[MAXN],nowdv,n;
^
0_0_34182468_15247\Main.java:30: 错误: 需要class, interface或enum
bool kdCmp(kdTree a,kdTree b){
^
0_0_34182468_15247\Main.java:32: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:36: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:36: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:36: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:38: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:41: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:45: 错误: 需要class, interface或enum
double now = -1;
^
0_0_34182468_15247\Main.java:46: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:46: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:46: 错误: 需要class, interface或enum
for(int i = 0; i < 2; ++i){
^
0_0_34182468_15247\Main.java:48: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ ave += tree[j].p[i];}
^
0_0_34182468_15247\Main.java:48: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ ave += tree[j].p[i];}
^
0_0_34182468_15247\Main.java:48: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ ave += tree[j].p[i];}
^
0_0_34182468_15247\Main.java:48: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ ave += tree[j].p[i];}
^
0_0_34182468_15247\Main.java:50: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ sum += (tree[j].p[i] - ave) * (tree[j].p[i] - ave);}
^
0_0_34182468_15247\Main.java:50: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ sum += (tree[j].p[i] - ave) * (tree[j].p[i] - ave);}
^
0_0_34182468_15247\Main.java:50: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ sum += (tree[j].p[i] - ave) * (tree[j].p[i] - ave);}
^
0_0_34182468_15247\Main.java:50: 错误: 需要class, interface或enum
for(int j = l; j <= r; ++j){ sum += (tree[j].p[i] - ave) * (tree[j].p[i] - ave);}
^
0_0_34182468_15247\Main.java:52: 错误: 需要class, interface或enum
if(sum > now){ now = sum; d = i;}
^
0_0_34182468_15247\Main.java:52: 错误: 需要class, interface或enum
if(sum > now){ now = sum; d = i;}
^
0_0_34182468_15247\Main.java:52: 错误: 需要class, interface或enum
if(sum > now){ now = sum; d = i;}
^
0_0_34182468_15247\Main.java:55: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:58: 错误: 需要class, interface或enum
if(l > r){ return;}
^
0_0_34182468_15247\Main.java:60: 错误: 需要class, interface或enum
nowdv = d; dv[mid] = d;
^
0_0_34182468_15247\Main.java:60: 错误: 需要class, interface或enum
nowdv = d; dv[mid] = d;
^
0_0_34182468_15247\Main.java:61: 错误: 需要class, interface或enum
nth_element(tree + l, tree + mid, tree + r + 1, kdCmp);
^
0_0_34182468_15247\Main.java:62: 错误: 需要class, interface或enum
builtTree(l,mid - 1,d ^ 1);
^
0_0_34182468_15247\Main.java:63: 错误: 需要class, interface或enum
builtTree(mid + 1,r,d ^ 1);
^
0_0_34182468_15247\Main.java:64: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:67: 错误: 需要class, interface或enum
if(l > r){ return;}
^
0_0_34182468_15247\Main.java:68: 错误: 需要class, interface或enum
double nowd = getDis(tree[mid],q); tree[mid].dis = nowd;
^
0_0_34182468_15247\Main.java:69: 错误: 需要class, interface或enum
if(nowd < kdans.dis && tree[mid].id != q.id){
^
0_0_34182468_15247\Main.java:70: 错误: 需要class, interface或enum
kdans.dis = nowd; kdans.id = tree[mid].id;
^
0_0_34182468_15247\Main.java:71: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:73: 错误: 需要class, interface或enum
if(t < 0){
^
0_0_34182468_15247\Main.java:75: 错误: 需要class, interface或enum
if(kdans.dis > t * t && l != r){
^
0_0_34182468_15247\Main.java:77: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:80: 错误: 需要class, interface或enum
if(kdans.dis > t * t && l != r){
^
0_0_34182468_15247\Main.java:82: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:88: 错误: 需要class, interface或enum
while(n != 0){
^
0_0_34182468_15247\Main.java:89: 错误: 需要class, interface或enum
for(int i = 1; i <= n; ++i){
^
0_0_34182468_15247\Main.java:89: 错误: 需要class, interface或enum
for(int i = 1; i <= n; ++i){
^
0_0_34182468_15247\Main.java:90: 错误: 需要class, interface或enum
scanf("%lf%lf",&tree[i].p[0],&tree[i].p[1]); tree[i].id = i;
^
0_0_34182468_15247\Main.java:91: 错误: 需要class, interface或enum
a[i] = tree[i];
^
0_0_34182468_15247\Main.java:92: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:93: 错误: 需要class, interface或enum
builtTree(1,n,0); kdans.dis = 99999999;
^
0_0_34182468_15247\Main.java:94: 错误: 需要class, interface或enum
for(int i = 1; i <= n; ++i){
^
0_0_34182468_15247\Main.java:94: 错误: 需要class, interface或enum
for(int i = 1; i <= n; ++i){
^
0_0_34182468_15247\Main.java:94: 错误: 需要class, interface或enum
for(int i = 1; i <= n; ++i){
^
0_0_34182468_15247\Main.java:95: 错误: 需要class, interface或enum
qu = a[i]; qu.id = i;
^
0_0_34182468_15247\Main.java:96: 错误: 需要class, interface或enum
searchTree(1,n,qu);
^
0_0_34182468_15247\Main.java:97: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:99: 错误: 需要class, interface或enum
kdans.dis /= 2.0;
^
0_0_34182468_15247\Main.java:100: 错误: 需要class, interface或enum
printf("%.2lfn",kdans.dis);
^
0_0_34182468_15247\Main.java:101: 错误: 需要class, interface或enum
scanf("%d",&n);
^
0_0_34182468_15247\Main.java:102: 错误: 需要class, interface或enum
}
^
0_0_34182468_15247\Main.java:104: 错误: 需要class, interface或enum
}
^
82 个错误
|
