0_0_15234542_24861\Main.java:1: 错误: 非法字符: '#'
#include <cstdio>
^
0_0_15234542_24861\Main.java:1: 错误: 需要class, interface或enum
#include <cstdio>
^
0_0_15234542_24861\Main.java:2: 错误: 非法字符: '#'
#include <algorithm>
^
0_0_15234542_24861\Main.java:3: 错误: 非法字符: '#'
#include <map>
^
0_0_15234542_24861\Main.java:5: 错误: 需要class, interface或enum
const int M = 2000;
^
0_0_15234542_24861\Main.java:6: 错误: 需要class, interface或enum
struct Tree{
^
0_0_15234542_24861\Main.java:8: 错误: 需要class, interface或enum
int lazy, l, r;
^
0_0_15234542_24861\Main.java:9: 错误: 需要class, interface或enum
}tree[M];
^
0_0_15234542_24861\Main.java:10: 错误: 需要class, interface或enum
void pullup(int rt){
^
0_0_15234542_24861\Main.java:12: 错误: 需要class, interface或enum
if(tree[rt].lazy)
^
0_0_15234542_24861\Main.java:14: 错误: 需要class, interface或enum
else {
^
0_0_15234542_24861\Main.java:16: 错误: 需要class, interface或enum
else tree[rt].val = tree[rt * 2].val + tree[rt * 2 + 1].val;
^
0_0_15234542_24861\Main.java:17: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:21: 错误: 需要class, interface或enum
int idx;
^
0_0_15234542_24861\Main.java:22: 错误: 需要class, interface或enum
void buildtree(int rt, int l, int r){
^
0_0_15234542_24861\Main.java:24: 错误: 需要class, interface或enum
if(l == r){
^
0_0_15234542_24861\Main.java:26: 错误: 需要class, interface或enum
tree[rt].val = 0;
^
0_0_15234542_24861\Main.java:27: 错误: 需要class, interface或enum
tree[rt].lazy = 0;
^
0_0_15234542_24861\Main.java:28: 错误: 需要class, interface或enum
tree[rt].sum = mapy[idx + 1] - mapy[idx];
^
0_0_15234542_24861\Main.java:29: 错误: 需要class, interface或enum
return ;
^
0_0_15234542_24861\Main.java:30: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:32: 错误: 需要class, interface或enum
buildtree(rt * 2, l, mid);
^
0_0_15234542_24861\Main.java:33: 错误: 需要class, interface或enum
buildtree(rt * 2 + 1, mid + 1, r);
^
0_0_15234542_24861\Main.java:34: 错误: 需要class, interface或enum
pullup(rt);
^
0_0_15234542_24861\Main.java:35: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:39: 错误: 需要class, interface或enum
pullup(rt);
^
0_0_15234542_24861\Main.java:40: 错误: 需要class, interface或enum
return ;
^
0_0_15234542_24861\Main.java:41: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:43: 错误: 需要class, interface或enum
if(l > mid) modify(rt * 2 + 1, l, r, a);
^
0_0_15234542_24861\Main.java:44: 错误: 需要class, interface或enum
else if(r <= mid) modify(rt * 2, l, r, a);
^
0_0_15234542_24861\Main.java:45: 错误: 需要class, interface或enum
else {
^
0_0_15234542_24861\Main.java:47: 错误: 需要class, interface或enum
modify(rt * 2 + 1, mid + 1, r, a);
^
0_0_15234542_24861\Main.java:48: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:50: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:53: 错误: 需要class, interface或enum
int a;
^
0_0_15234542_24861\Main.java:54: 错误: 需要class, interface或enum
bool operator < (const Node &i) const {
^
0_0_15234542_24861\Main.java:56: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:59: 错误: 需要class, interface或enum
main() {
^
0_0_15234542_24861\Main.java:61: 错误: 需要class, interface或enum
while(~scanf("%d", &n) && n){
^
0_0_15234542_24861\Main.java:62: 错误: 需要class, interface或enum
for(int i = 0; i < n; i++){
^
0_0_15234542_24861\Main.java:62: 错误: 需要class, interface或enum
for(int i = 0; i < n; i++){
^
0_0_15234542_24861\Main.java:64: 错误: 需要class, interface或enum
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
^
0_0_15234542_24861\Main.java:65: 错误: 需要class, interface或enum
node[i * 2].x = x1, node[i * 2].y1 = y1, node[i * 2].y2 = y2, node[i * 2].a = 1;
^
0_0_15234542_24861\Main.java:66: 错误: 需要class, interface或enum
node[i * 2 + 1].x = x2, node[i * 2 + 1].y1 = y1, node[i * 2 + 1].y2 = y2, node[i * 2 + 1].a = -1;
^
0_0_15234542_24861\Main.java:67: 错误: 需要class, interface或enum
mapy[i * 2 + 1] = y1, mapy[i * 2 + 2] = y2;
^
0_0_15234542_24861\Main.java:68: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:70: 错误: 需要class, interface或enum
sort(mapy + 1, mapy + n * 2 + 1);
^
0_0_15234542_24861\Main.java:71: 错误: 需要class, interface或enum
int cnt = 1;
^
0_0_15234542_24861\Main.java:72: 错误: 需要class, interface或enum
for(int i = 2; i <= 2 * n; i++){
^
0_0_15234542_24861\Main.java:72: 错误: 需要class, interface或enum
for(int i = 2; i <= 2 * n; i++){
^
0_0_15234542_24861\Main.java:72: 错误: 需要class, interface或enum
for(int i = 2; i <= 2 * n; i++){
^
0_0_15234542_24861\Main.java:74: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:76: 错误: 需要class, interface或enum
buildtree(1, 1, cnt - 1);
^
0_0_15234542_24861\Main.java:77: 错误: 需要class, interface或enum
double ans = 0, pre;
^
0_0_15234542_24861\Main.java:78: 错误: 需要class, interface或enum
for(int i = 0; i < n * 2; i++){
^
0_0_15234542_24861\Main.java:78: 错误: 需要class, interface或enum
for(int i = 0; i < n * 2; i++){
^
0_0_15234542_24861\Main.java:78: 错误: 需要class, interface或enum
for(int i = 0; i < n * 2; i++){
^
0_0_15234542_24861\Main.java:80: 错误: 需要class, interface或enum
int r = lower_bound(mapy + 1, mapy + cnt + 1, node[i].y2) - mapy - 1;
^
0_0_15234542_24861\Main.java:82: 错误: 需要class, interface或enum
if(i){
^
0_0_15234542_24861\Main.java:85: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:88: 错误: 需要class, interface或enum
pre = node[i].x;
^
0_0_15234542_24861\Main.java:89: 错误: 需要class, interface或enum
}
^
0_0_15234542_24861\Main.java:91: 错误: 需要class, interface或enum
printf("Total explored area: %.2f\n", ans);
^
0_0_15234542_24861\Main.java:92: 错误: 需要class, interface或enum
}
^
64 个错误
|
