#52855 (Java) No.286 Modulo Discount Store

• 問題: No.286 Modulo Discount Store
• ユーザー: holeguma
• 提出日時: 2015-10-10 01:30:32
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 3,836 bytes
• コンパイル時間: 2,340 ms
• コンパイル使用メモリ: 86,344 KB
• 実行使用メモリ: 60,132 KB
• 最終ジャッジ日時: 2024-07-20 04:54:48
• 合計ジャッジ時間: 6,224 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	-- * 3
other	WA * 2 TLE * 1 -- * 37

ソースコード

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Comparator;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.TreeMap;
import java.util.TreeSet;
import java.math.BigDecimal;
import java.math.BigInteger;
    
public class Main{
 
static PrintWriter out;
static InputReader ir;
static final int INF=Integer.MAX_VALUE;
static final long LINF=Long.MAX_VALUE;
 
static void solve(){
 int n=ir.nextInt();
 int[] a=ir.nextIntArray(n);
 int[] ord=new int[n];
 for(int i=0;i<n;i++){
  ord[i]=i;
 }
 int ans=INF;
 do{
  ans=Math.min(ans,calc(a,ord));
 }while(next_permutation(ord));
 out.println(ans);
}
 
public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

public static int calc(int[] a,int[] ord){
 int res=0;
 int cnt=0;
 for(int i=0;i<ord.length;i++){
  res+=Math.min(a[ord[i]]-cnt%1000,0);
  cnt+=a[ord[i]];
 }
 return res;
}

public static boolean next_permutation(int[] a){
 for(int i=a.length-2;i>=0;i--){
  if(a[i]<a[i+1]){
   for(int j=a.length-1;;j--){
    if(a[i]<a[j]){
     int temp=a[i]; a[i]=a[j]; a[j]=temp;
     for(i++,j=a.length-1;i<j;i++,j--){
      temp=a[i]; a[i]=a[j]; a[j]=temp;
     }
     return true;
    }
   }
  }
 }
 return false;
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;
 
 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
  
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }
 
 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public double nextDouble(){return Double.parseDouble(next());}
 
 public BigInteger nextBigInteger(){return new BigInteger(next());}
 
 public BigDecimal nextBigDecimal(){return new BigDecimal(next());}
 
 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }
 
 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}