# POJ 刷题系列：2586. Y2K Accounting Bug

## POJ 刷题系列：2586. Y2K Accounting Bug

```import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Map;
import java.util.StringTokenizer;

public class Main{

String INPUT = "./data/judge/201712/P2586.txt";

public static void main(String[] args) throws IOException {
new Main().run();
}

int[] stateToWindow(int state) {
int[] window = new int[12];
for (int i = 0; i < 12; ++i) {
window[i] = (state >> i) & 1;
}
return window;
}

boolean valid(double s, double d, int[] window) {
double sum = 0;
for (int i = 0; i < 5; ++i) {
if (window[i] == 1) {
sum += s;
}
else {
sum += d;
}
}

if (sum >= 0) return false;

for (int i = 1; i + 4 < 12; ++i) {
if (window[i - 1] == 1) sum -= s;
else sum -= d;
if (window[i + 4] == 1) sum += s;
else sum += d;
if (sum >= 0) return false;
}

return true;
}

double total(double s, double d, int[] window) {
double sum = 0;
for (int i = 0; i < 12; ++i) {
if (window[i] == 1) sum += s;
else sum += d;
}
return sum;
}

while(more()) {
double s = nd();
double d = nd();
d = -d;

double max = 0;
for (int i = 0; i < 1 << 12; ++i) {
int[] window = stateToWindow(i);
if (valid(s, d, window)) {
max = Math.max(max, total(s, d, window));
}
}

if (max > 0) out.printf("%.0f\n", max);
else {
out.println("Deficit");
}
}

}

FastScanner in;
PrintWriter out;

void run() throws IOException {
boolean oj;
try {
oj = ! System.getProperty("user.dir").equals("F:\\oxygen_workspace\\Algorithm");
} catch (Exception e) {
oj = System.getProperty("ONLINE_JUDGE") != null;
}

InputStream is = oj ? System.in : new FileInputStream(new File(INPUT));
in = new FastScanner(is);
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
out.flush();
if (!oj){
System.out.println("[" + (System.currentTimeMillis() - s) + "ms]");
}
}

public boolean more(){
return in.hasNext();
}

public int ni(){
return in.nextInt();
}

public long nl(){
return in.nextLong();
}

public double nd(){
return in.nextDouble();
}

public String ns(){
return in.nextString();
}

public char nc(){
return in.nextChar();
}

class FastScanner {
StringTokenizer st;
boolean hasNext;

public FastScanner(InputStream is) throws IOException {
hasNext = true;
}

public String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
} catch (Exception e) {
hasNext = false;
return "##";
}
}
return st.nextToken();
}

String next = null;
public boolean hasNext(){
next = nextToken();
return hasNext;
}

public int nextInt() {
if (next == null){
hasNext();
}
String more = next;
next = null;
return Integer.parseInt(more);
}

public long nextLong() {
if (next == null){
hasNext();
}
String more = next;
next = null;
return Long.parseLong(more);
}

public double nextDouble() {
if (next == null){
hasNext();
}
String more = next;
next = null;
return Double.parseDouble(more);
}

public String nextString(){
if (next == null){
hasNext();
}
String more = next;
next = null;
return more;
}

public char nextChar(){
if (next == null){
hasNext();
}
String more = next;
next = null;
return more.charAt(0);
}
}

static class D{

public static void pp(int[][] board, int row, int col) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < row; ++i) {
for (int j = 0; j < col; ++j) {
sb.append(board[i][j] + (j + 1 == col ? "\n" : " "));
}
}
System.out.println(sb.toString());
}

public static void pp(char[][] board, int row, int col) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < row; ++i) {
for (int j = 0; j < col; ++j) {
sb.append(board[i][j] + (j + 1 == col ? "\n" : " "));
}
}
System.out.println(sb.toString());
}
}

static class ArrayUtils {

public static void fill(int[][] f, int value) {
for (int i = 0; i < f.length; ++i) {
Arrays.fill(f[i], value);
}
}

public static void fill(int[][][] f, int value) {
for (int i = 0; i < f.length; ++i) {
fill(f[i], value);
}
}

public static void fill(int[][][][] f, int value) {
for (int i = 0; i < f.length; ++i) {
fill(f[i], value);
}
}
}

static class Num{
public static <K> void inc(Map<K, Integer> mem, K k) {
if (!mem.containsKey(k)) mem.put(k, 0);
mem.put(k, mem.get(k) + 1);
}
}
}```

0 条评论

## 相关文章

3286

### 【Java提高四】接口与抽象类

【Java提高四】接口与抽象类 接口和内部类为我们提供了一种将接口与实现分离的更加结构化的方法。 抽象类与接口是java语言中对抽象概念进行定义的...

3416

482

832

501

### 厉害了，关于String的10道经典面试题。

1、String是基本数据类型吗？ 2、String是可变的话？ 3、怎么比较两个字符串的值一样，怎么比较两个字符串是否同一对象？ 4、switch中可以使用S...

33010

### 厕读：每日一题，面试无忧

2. 下面关于java.lang.Exception类的说法正确的是（） A 继承自Throwable B Serialable CD 不记...

3425

1013

682

906