Submission #3429997
Source Code Expand
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { static int N; static int[] A; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); N = sc.nextInt(); A = sc.nextIntArray(N); System.out.println(solve()); } static int INF = 1_000_000_007; static long solve() { int[] b2 = {INF, 2, 4, 8, 16, 32, 64}; int[] b3 = {INF, 3, 9, 27, 81}; int[] b5 = {INF, 5, 25}; int[] b7 = {INF, 7, 49}; int[] p = {11, 13, 17, 19, 21, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}; boolean[] isp = new boolean[101]; for (int pp : p) { isp[pp] = true; } long sump = calcSumP(p); long ans = 0; for (int i2 : b2) { for (int j3 : b3) { for (int k5 : b5) { for (int l7 : b7) { long sum = 0; for (int m = 1; m <= N; m++) { if( isp[m] ) continue; if (m % i2 != 0 && m % j3 != 0 && m % k5 != 0 && m % l7 != 0 ) { sum += A[m-1]; } } ans = Math.max(sump + sum, ans); } } } } return ans; } static long calcSumP(int[] P) { long sum = 0; for (int p : P) { if( p <= N ) { int a = A[p-1]; if( a > 0 ) { sum += a; } } } return sum; } @SuppressWarnings("unused") static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } }
Submission Info
Submission Time | |
---|---|
Task | E - MUL |
User | kusomushi |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 3452 Byte |
Status | WA |
Exec Time | 77 ms |
Memory | 23252 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0, example_1, example_2, example_3 |
All | example_0, example_1, example_2, example_3, kimeuti_0, kimeuti_1, kimeuti_10, kimeuti_11, kimeuti_12, kimeuti_13, kimeuti_14, kimeuti_15, kimeuti_16, kimeuti_17, kimeuti_18, kimeuti_19, kimeuti_2, kimeuti_3, kimeuti_4, kimeuti_5, kimeuti_6, kimeuti_7, kimeuti_8, kimeuti_9, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_16, rand_17, rand_18, rand_19, rand_2, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9, small_0, small_1, small_2, small_3, small_4 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0 | AC | 69 ms | 18644 KB |
example_1 | AC | 69 ms | 19540 KB |
example_2 | AC | 68 ms | 19668 KB |
example_3 | AC | 69 ms | 18260 KB |
kimeuti_0 | WA | 70 ms | 17748 KB |
kimeuti_1 | WA | 72 ms | 20564 KB |
kimeuti_10 | WA | 73 ms | 20052 KB |
kimeuti_11 | WA | 72 ms | 21200 KB |
kimeuti_12 | WA | 73 ms | 20820 KB |
kimeuti_13 | WA | 70 ms | 17876 KB |
kimeuti_14 | WA | 74 ms | 22612 KB |
kimeuti_15 | WA | 72 ms | 23124 KB |
kimeuti_16 | WA | 74 ms | 21200 KB |
kimeuti_17 | WA | 71 ms | 20692 KB |
kimeuti_18 | WA | 72 ms | 22228 KB |
kimeuti_19 | WA | 72 ms | 19284 KB |
kimeuti_2 | WA | 74 ms | 20692 KB |
kimeuti_3 | WA | 70 ms | 19668 KB |
kimeuti_4 | WA | 71 ms | 18772 KB |
kimeuti_5 | WA | 73 ms | 19924 KB |
kimeuti_6 | WA | 74 ms | 22740 KB |
kimeuti_7 | WA | 71 ms | 20308 KB |
kimeuti_8 | WA | 74 ms | 23252 KB |
kimeuti_9 | WA | 70 ms | 20308 KB |
rand_0 | WA | 74 ms | 21328 KB |
rand_1 | WA | 71 ms | 18260 KB |
rand_10 | WA | 73 ms | 22228 KB |
rand_11 | WA | 70 ms | 21076 KB |
rand_12 | WA | 72 ms | 20180 KB |
rand_13 | WA | 71 ms | 19668 KB |
rand_14 | WA | 73 ms | 20564 KB |
rand_15 | WA | 71 ms | 19536 KB |
rand_16 | WA | 73 ms | 21460 KB |
rand_17 | WA | 72 ms | 22228 KB |
rand_18 | WA | 72 ms | 18004 KB |
rand_19 | WA | 77 ms | 17360 KB |
rand_2 | WA | 75 ms | 20820 KB |
rand_3 | WA | 72 ms | 20692 KB |
rand_4 | WA | 72 ms | 20692 KB |
rand_5 | WA | 73 ms | 16596 KB |
rand_6 | WA | 73 ms | 19412 KB |
rand_7 | AC | 69 ms | 19924 KB |
rand_8 | WA | 74 ms | 23124 KB |
rand_9 | WA | 72 ms | 20564 KB |
small_0 | AC | 69 ms | 20564 KB |
small_1 | AC | 71 ms | 21204 KB |
small_2 | AC | 70 ms | 20308 KB |
small_3 | WA | 71 ms | 20692 KB |
small_4 | AC | 72 ms | 20692 KB |