Submission #803207

#	Time	Username	Problem	Language	Result	Execution time	Memory
803207		rocketsri	Knapsack (NOI18_knapsack)	Java	12 / 100	158 ms	15276 KiB

knapsack

import java.util.*;
public class knapsack {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int m=in.nextInt(), n=in.nextInt();
		long[] a = new long[n];
		long[] w = new long[n];
		long[] freq = new long[n];
		
		HashMap<Long, ArrayList<long[]>> pairs = new HashMap<>(); //(weight, {value, frequency})
		for(int i=0; i<n; i++) {
			a[i]=in.nextLong();
			w[i]=in.nextLong();
			freq[i]=in.nextLong();
		}
		
		for(int i=0; i<n; i++) {
			if(pairs.containsKey(w[i])) {
				pairs.get(w[i]).add(new long[] {a[i], freq[i]});
			}
			else {
				pairs.put(w[i], new ArrayList<>(Arrays.asList(new long[] {a[i], freq[i]})));
			}
		}
		
		long[] dp = new long[m+1];
		for(int i=0; i<m+1; i++) {
			dp[i]=-1;
		}
		dp[0]=0;
		
		for(long weight : pairs.keySet()) {
			ArrayList<long[]> curr = pairs.get(weight);
			Collections.sort(curr, new Comparator<long[]>() {
			    public int compare(long[] x, long[] y) {
			        return (int)(x[0]-y[0]);
			    }
			});
			Collections.reverse(curr);
		}
		

		
		for(long weight : pairs.keySet()) {
			long sum=0;
			for(long[] j : pairs.get(weight)) {
				sum += j[1];
			}
			for(int i=m; i>=weight; i--) {
				long f = (long)(i/weight);
				if(dp[i-(int)(Math.min(f, sum)*weight)]!=-1) {
					long c = dp[i-(int)(Math.min(f, sum)*weight)];
					for(long[] j : pairs.get(weight)) {
						long fr = j[1], val = j[0];
						if(fr>f) {
							c += f*val;
							f=0;
							break;
						}
						else {
							c += fr*val;
							f -= fr;
						}
					}
					
					dp[i] = Math.max(dp[i], c);
				}
			}

		}
		
		long max=0;
		for(int i=0; i<m+1; i++) {
			max = Math.max(max, dp[i]);
		}
		
		System.out.println(max);
	}

}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27