poj 1009 java_（需要大神，请求解决，遇见runtime error 错误）poj 1009 java

最新推荐文章于 2021-02-16 07:50:10 发布

weixin_39819152

最新推荐文章于 2021-02-16 07:50:10 发布

阅读量112

点赞数

文章标签： poj 1009 java

本文链接：https://blog.csdn.net/weixin_39819152/article/details/114204107

版权

本地测试，没有错误，提交后 runtime error

Description

IONU Satellite Imaging, Inc. records and stores very large images using run length encoding. You are to write a program that reads a compressed image, finds the edges in the image, as described below, and outputs another compressed image of the detected edges.

A simple edge detection algorithm sets an output pixel's value to be the maximum absolute value of the differences between it and all its surrounding pixels in the input image. Consider the input image below:

The upper left pixel in the output image is the maximum of the values |15-15|,|15-100|, and |15-100|, which is 85. The pixel in the 4th row, 2nd column is computed as the maximum of |175-100|, |175-100|, |175-100|, |175-175|, |175-25|, |175-175|,|175-175|, and |175-25|, which is 150.

Images contain 2 to 1,000,000,000 (109) pixels. All images are encoded using run length encoding (RLE). This is a sequence of pairs, containing pixel value (0-255) and run length (1-109). Input images have at most 1,000 of these pairs. Successive pairs have different pixel values. All lines in an image contain the same number of pixels.

Input

Input consists of information for one or more images. Each image starts with the width, in pixels, of each image line. This is followed by the RLE pairs, one pair per line. A line with 0 0 indicates the end of the data for that image. An image width of 0 indicates there are no more images to process. The first image in the example input encodes the 5x7 input image above.

Output

Output is a series of edge-detected images, in the same format as the input images, except that there may be more than 1,000 RLE pairs.

Sample Input

15 4

100 15

25 2

175 2

25 5

175 2

25 5

0 0

35 500000000

200 500000000

0 0

255 1

10 1

255 2

10 1

255 2

10 1

255 1

0 0

Sample Output

85 5

0 2

85 5

75 10

150 2

75 3

0 2

150 2

0 4

0 0

0 499999990

165 20

0 499999990

0 0

245 9

0 0

Hint

A brute force solution that attempts to compute an output value for every individual pixel will likely fail due to space or time constraints.

import java.math.BigDecimal;

import java.nio.Buffer;

import java.util.ArrayList;

import java.util.List;

import java.util.Scanner;

import java.util.Set;

import java.util.TreeSet;

import org.omg.CORBA.DATA_CONVERSION;

/**

* @author baoyou E-mail:[email protected]

* @version 创建时间：2015年10月3日下午11:43:37

* des:

public class BaoyPoj1009Test2 {

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

for (;;) {

int cols = in.nextInt();

BigDecimal num = new BigDecimal(0);

System.out.println(cols);

List target = new ArrayList();

for (;;) {

int a = in.nextInt();

BigDecimal b = in.nextBigDecimal();

num = num.add(b);

if (a != 0 && b.intValue() != 0)

target.add(new Node(a, target.size() == 0 ? b : b.add(target

.get(target.size() - 1).num)));

if (a == 0 && b.intValue() == 0) {

BigDecimal rows = num.divide(new BigDecimal(cols),

BigDecimal.ROUND_DOWN);

Set source = new TreeSet();

BigDecimal current = new BigDecimal(1);

find9(cols, rows, current, target , source);

for (int i = 0; i < target.size()-1; i++) {

Node node = target.get(i);

current = new BigDecimal(1).add(node.num);

find9(cols, rows, current, target , source);

}

boolean first =true;

int absResult=0;

BigDecimal numTemp= new BigDecimal(0);

BigDecimal numResult= new BigDecimal(0);

for ( DataNode dnode:source) {

if (first) {

absResult = dnode.abs;

numResult = dnode.start;

first = false;

}else{

if (absResult == dnode.abs) {

//numResult = dnode.start;

}else{

System.out.println(absResult + " " + dnode.start.subtract(numResult));

absResult = dnode.abs;

numResult = dnode.start;

}

System.out.println(absResult + " " + num.subtract(numResult).add(new BigDecimal(1)));

System.out.printf("%d %d\r\n", 0, 0);

break;

}

if (cols == 0) {

System.out.println(0);

break;

}

public static void find9(int cols, BigDecimal rows, BigDecimal i, List target ,Set source){

BigDecimal start = new BigDecimal(0);

int abs = 0;

//self

start = i;

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 上 (x,y-1)

if (i.compareTo(new BigDecimal(cols)) > 0) {

start = i.subtract(new BigDecimal(cols));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 下 (x,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply( new BigDecimal(cols))) <= 0) {

start = i.add(new BigDecimal(cols));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 左 (x-1,y)

if (i.remainder(new BigDecimal(cols)).compareTo(new BigDecimal(1)) != 0) {

start = i.subtract(new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows,start, target);

source.add(new DataNode(start,abs));

}

// 右(x+1,y)

if (i.remainder(new BigDecimal(cols)).compareTo(new BigDecimal(0)) != 0) {

start = i.add(new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 左上 (x-1,y-1)

if (i.compareTo(new BigDecimal(cols)) > 0 && i.remainder(new BigDecimal(cols)).compareTo( new BigDecimal(1)) != 0) {

start = i.subtract(new BigDecimal(cols)).subtract( new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 右上 (x+1,y-1)

if (i.compareTo(new BigDecimal(cols)) > 0 && i.remainder(new BigDecimal(cols)).compareTo( new BigDecimal(0)) != 0) {

start = i.subtract(new BigDecimal(cols)).add(new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 左下 (x-1,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply( new BigDecimal(cols))) <= 0 && i.remainder(new BigDecimal(cols)).compareTo( new BigDecimal(1)) != 0) {

start = i.add(new BigDecimal(cols)).subtract(new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

// 右下 (x+1,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply(

new BigDecimal(cols))) <= 0 && i.remainder(new BigDecimal(cols)).compareTo(

new BigDecimal(0)) != 0) {

start = i.add(new BigDecimal(cols)).add(new BigDecimal(1));

if (!source.contains(new DataNode(start))) {

abs = maxABS(cols, rows, start, target);

source.add(new DataNode(start,abs));

}

public static int maxABS(int cols, BigDecimal rows, BigDecimal i, List target) {

int max = 0;

int current = getValue(i, target);

BigDecimal location = new BigDecimal(0);

// 上 (x,y-1)

if (i.compareTo(new BigDecimal(cols)) <= 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.subtract(new BigDecimal(cols));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 下 (x,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply(

new BigDecimal(cols))) > 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.add(new BigDecimal(cols));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 左 (x-1,y)

if (i.remainder(new BigDecimal(cols)).compareTo(new BigDecimal(1)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.subtract(new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 右(x+1,y)

if (i.remainder(new BigDecimal(cols)).compareTo(new BigDecimal(0)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.add(new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 左上 (x-1,y-1)

if (i.compareTo(new BigDecimal(cols)) <= 0) {

int a = 0;

if (a > max)

max = a;

} else if (i.remainder(new BigDecimal(cols)).compareTo(

new BigDecimal(1)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.subtract(new BigDecimal(cols)).subtract(

new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 右上 (x+1,y-1)

if (i.compareTo(new BigDecimal(cols)) <= 0) {

int a = 0;

if (a > max)

max = a;

} else if (i.remainder(new BigDecimal(cols)).compareTo(

new BigDecimal(0)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.subtract(new BigDecimal(cols)).add(new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 左下 (x-1,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply(

new BigDecimal(cols))) > 0) {

int a = 0;

if (a > max)

max = a;

} else if (i.remainder(new BigDecimal(cols)).compareTo(

new BigDecimal(1)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.add(new BigDecimal(cols)).subtract(new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

// 右下 (x+1,y+1)

if (i.compareTo(rows.subtract(new BigDecimal(1)).multiply(

new BigDecimal(cols))) > 0) {

int a = 0;

if (a > max)

max = a;

} else if (i.remainder(new BigDecimal(cols)).compareTo(

new BigDecimal(0)) == 0) {

int a = 0;

if (a > max)

max = a;

} else {

location = i.add(new BigDecimal(cols)).add(new BigDecimal(1));

int a = Math.abs(getValue(location, target) - current);

if (a > max)

max = a;

}

return max;

}

public static int getValue(BigDecimal location, List target) {

for (Node d : target) {

if (d.num.compareTo(location) >= 0)

return d.ascii;

}

return 0;

}

static class Node {

public int ascii;

public BigDecimal num;

public Node(int ascii, BigDecimal num) {

this.ascii = ascii;

this.num = num;

}

@Override

public String toString() {

StringBuffer sb= new StringBuffer();

sb.append("{")

.append("ascii:"+ascii)

.append(",num:"+num)

.append("}");

return sb.toString();

}

static class DataNode implements Comparable{

public BigDecimal start;

public int abs;

public DataNode(BigDecimal start){

this.start = start;

}

public DataNode(BigDecimal start, int abs) {

this.start = start;

this.abs = abs;

}

@Override

public boolean equals(Object obj) {

if (obj instanceof DataNode)

if (((DataNode) obj).start == this.start)

return true;

return false;

}

public int compareTo(Object o) {

if (o instanceof DataNode){

if (((DataNode) o).start .compareTo(this.start) == 0)

return 0;

else if(((DataNode) o).start .compareTo(this.start) < 0)

return 1;

else

return -1;

}else

return -1;

}

@Override

public String toString() {

StringBuffer sb= new StringBuffer();

sb.append("{")

.append("start:"+start)

.append(",abs:"+abs)

.append("}");

return sb.toString();

}

测试没有问题，可是出现了 runtime error 百度了好多人的，似乎也有这个问题，就是没有给出跟多的提示

知道答案及错误原因请留言，谢谢

weixin_39819152

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
poj 1009 java_（需要大神，请求解决，遇见runtime error 错误）poj 1009 java

本地测试，没有错误，提交后 runtime error DescriptionIONU Satellite Imaging, Inc. records and stores very large images using run length encoding. You are to write a program that reads a compressed image, finds the...
复制链接

扫一扫