Submission #1913667


Source Code Expand

import java.io.*;
import java.util.*;


class Main {
    static final long I=1L<<53;
    static void mEqN(int n,int k,long[]a){
        long[]ans=new long[k+1];
        Arrays.fill(ans,-I);
        ans[0]=0;
        for(int i=0;i<n;++i){
            for(int j=Math.min(i+1,k);j>=1;--j){
                ans[j]=Math.max(ans[j],ans[j-1]+j*a[i]);
            }
        }
        out.println(ans[k]);
    }
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        int n=sc.nextInt();
        int m=sc.nextInt();
        int k=sc.nextInt();
        long[]a=new long[n];
        for(int i=0;i<n;++i){
            a[i]=sc.nextLong();
        }
        if(m==n){
            mEqN(n,k,a);
        }
        out.close();
    }
    // http://codeforces.com/blog/entry/7018
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

Submission Info

Submission Time
Task A - Struck Out
User kirika_comp
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 2127 Byte
Status WA
Exec Time 243 ms
Memory 39052 KB

Judge Result

Set Name Sample subtask1 subtask2 subtask3 All
Score / Max Score 0 / 0 100 / 100 0 / 200 0 / 300 0 / 100
Status
AC × 1
WA × 2
AC × 10
AC × 3
WA × 9
AC × 3
WA × 18
AC × 13
WA × 33
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
subtask1 sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt
subtask3 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt
All sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt
Case Name Status Exec Time Memory
sample_1.txt WA 69 ms 21076 KB
sample_2.txt AC 71 ms 19668 KB
sample_3.txt WA 72 ms 22356 KB
subtask_1_1.txt AC 72 ms 18260 KB
subtask_1_2.txt AC 141 ms 25300 KB
subtask_1_3.txt AC 243 ms 34088 KB
subtask_1_4.txt AC 108 ms 18768 KB
subtask_1_5.txt AC 185 ms 33880 KB
subtask_1_6.txt AC 74 ms 21204 KB
subtask_1_7.txt AC 213 ms 35840 KB
subtask_1_8.txt AC 238 ms 35904 KB
subtask_1_9.txt AC 83 ms 21716 KB
subtask_2_1.txt WA 75 ms 19540 KB
subtask_2_2.txt WA 85 ms 19284 KB
subtask_2_3.txt WA 83 ms 21460 KB
subtask_2_4.txt AC 73 ms 19412 KB
subtask_2_5.txt WA 72 ms 18644 KB
subtask_2_6.txt AC 71 ms 19284 KB
subtask_2_7.txt WA 73 ms 19412 KB
subtask_2_8.txt WA 83 ms 19412 KB
subtask_2_9.txt WA 76 ms 19536 KB
subtask_3_1.txt WA 186 ms 36372 KB
subtask_3_2.txt WA 172 ms 39052 KB
subtask_3_3.txt WA 176 ms 35416 KB
subtask_3_4.txt WA 165 ms 33636 KB
subtask_3_5.txt WA 100 ms 21972 KB
subtask_3_6.txt WA 185 ms 31296 KB
subtask_3_7.txt WA 170 ms 33928 KB
subtask_3_8.txt WA 112 ms 22356 KB
subtask_3_9.txt WA 165 ms 35560 KB
subtask_4_1.txt WA 170 ms 35852 KB
subtask_4_10.txt WA 173 ms 33672 KB
subtask_4_11.txt WA 168 ms 32952 KB
subtask_4_12.txt WA 169 ms 33804 KB
subtask_4_13.txt WA 169 ms 35980 KB
subtask_4_2.txt WA 171 ms 32620 KB
subtask_4_3.txt WA 169 ms 35820 KB
subtask_4_4.txt WA 198 ms 33244 KB
subtask_4_5.txt WA 163 ms 33636 KB
subtask_4_6.txt WA 168 ms 34568 KB
subtask_4_7.txt WA 173 ms 33256 KB
subtask_4_8.txt WA 168 ms 33892 KB
subtask_4_9.txt WA 169 ms 34188 KB