Submission #183272
Source Code Expand
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class Main {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
int[] x = io.nextIntArray(7);
int[] y = io.nextIntArray(7);
int ans = 0;
for(int i = 0; i < 7; i++) {
ans += Math.max(x[i], y[i]);
}
io.out.println(ans);
}
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) {
T t = x[i];
x[i] = x[j];
x[j] = t;
}
static void swap(int[] x, int i, int j) {
int t = x[i];
x[i] = x[j];
x[j] = t;
}
static void radixSort(int[] xs) {
int[] cnt = new int[(1<<16)+1];
int[] ys = new int[xs.length];
for(int j = 0; j <= 16; j += 16) {
Arrays.fill(cnt, 0);
for(int x : xs) { cnt[(x>>j&0xFFFF)+1]++; }
for(int i = 1; i < cnt.length; i++) { cnt[i] += cnt[i-1]; }
for(int x : xs) { ys[cnt[x>>j&0xFFFF]++] = x; }
{ final int[] t = xs; xs = ys; ys = t; }
}
}
static void radixSort(long[] xs) {
int[] cnt = new int[(1<<16)+1];
long[] ys = new long[xs.length];
for(int j = 0; j <= 48; j += 16) {
Arrays.fill(cnt, 0);
for(long x : xs) { cnt[(int)(x>>j&0xFFFF)+1]++; }
for(int i = 1; i < cnt.length; i++) { cnt[i] += cnt[i-1]; }
for(long x : xs) { ys[cnt[(int)(x>>j&0xFFFF)]++] = x; }
{ final long[] t = xs; xs = ys; ys = t; }
}
}
static void arrayIntSort(int[][] x, int... keys) {
Arrays.sort(x, new ArrayIntsComparator(keys));
}
static class ArrayIntsComparator implements Comparator<int[]> {
final int[] KEY;
public ArrayIntsComparator(int... key) {
KEY = key;
}
@Override
public int compare(int[] o1, int[] o2) {
for(int k : KEY) if(o1[k] != o2[k]) return o1[k] - o2[k];
return 0;
}
}
static class ArrayIntComparator implements Comparator<int[]> {
final int KEY;
public ArrayIntComparator(int key) {
KEY = key;
}
@Override
public int compare(int[] o1, int[] o2) {
return o1[KEY] - o2[KEY];
}
}
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try {
run();
}
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException {
new Main().main();
}
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private PrintWriter out = new PrintWriter(System.out);
void setFileIO(String ins, String outs) throws IOException {
out.flush();
out.close();
in.close();
in = new BufferedReader(new FileReader(ins));
out = new PrintWriter(new FileWriter(outs));
System.err.println("reading from " + ins);
}
// private static final int BUFFER_SIZE = 50 * 200000;
private static int pos, readLen;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static {
for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; }
isDigit['-'] = true;
isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
isLineSep['\r'] = isLineSep['\n'] = true;
}
public int read() throws IOException {
if(pos >= readLen) {
pos = 0;
readLen = in.read(buffer);
if(readLen <= 0) { throw new EndOfFileRuntimeException(); }
}
return buffer[pos++];
}
public int nextInt() throws IOException {
int len = 0;
str[len++] = nextChar();
len = reads(len, isSpace);
int i = 0;
int ret = 0;
if(str[0] == '-') { i = 1; }
for(; i < len; i++) ret = ret * 10 + str[i] - '0';
if(str[0] == '-') { ret = -ret; }
return ret;
// return Integer.parseInt(nextString());
}
public long nextLong() throws IOException {
int len = 0;
str[len++] = nextChar();
len = reads(len, isSpace);
int i = 0;
long ret = 0;
if(str[0] == '-') { i = 1; }
for(; i < len; i++) ret = ret * 10 + str[i] - '0';
if(str[0] == '-') { ret = -ret; }
return ret;
// return Long.parseLong(nextString());
}
public char nextChar() throws IOException {
while(true) {
final int c = read();
if(!isSpace[c]) { return (char)c; }
}
}
int reads(int len, boolean[] accept) throws IOException {
try {
while(true) {
final int c = read();
if(accept[c]) { break; }
if(str.length == len) {
char[] rep = new char[str.length * 3 / 2];
System.arraycopy(str, 0, rep, 0, str.length);
str = rep;
}
str[len++] = (char)c;
}
}
catch(EndOfFileRuntimeException e) { ; }
return len;
}
int reads(char[] cs, int len, boolean[] accept) throws IOException {
try {
while(true) {
final int c = read();
if(accept[c]) { break; }
cs[len++] = (char)c;
}
}
catch(EndOfFileRuntimeException e) { ; }
return len;
}
public char[] nextLine() throws IOException {
int len = 0;
str[len++] = nextChar();
// str[len++] = (char)read();
len = reads(len, isLineSep);
try {
if(str[len-1] == '\r') { len--; read(); }
}
catch(EndOfFileRuntimeException e) { ; }
return Arrays.copyOf(str, len);
}
public String nextString() throws IOException {
return new String(next());
}
public char[] next() throws IOException {
int len = 0;
str[len++] = nextChar();
len = reads(len, isSpace);
return Arrays.copyOf(str, len);
}
public int next(char[] cs) throws IOException {
int len = 0;
cs[len++] = nextChar();
len = reads(cs, len, isSpace);
return len;
}
public double nextDouble() throws IOException {
return Double.parseDouble(nextString());
}
public long[] nextLongArray(final int n) throws IOException {
final long[] res = new long[n];
for(int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public int[] nextIntArray(final int n) throws IOException {
final int[] res = new int[n];
for(int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[][] nextIntArray2D(final int n, final int k) throws IOException {
final int[][] res = new int[n][];
for(int i = 0; i < n; i++) {
res[i] = nextIntArray(k);
}
return res;
}
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException {
final int[][] res = new int[n][k+1];
for(int i = 0; i < n; i++) {
for(int j = 0; j < k; j++) {
res[i][j] = nextInt();
}
res[i][k] = i;
}
return res;
}
public double[] nextDoubleArray(final int n) throws IOException {
final double[] res = new double[n];
for(int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}
Submission Info
Submission Time |
|
Task |
A - ゴールドラッシュ |
User |
tanzaku |
Language |
Java (OpenJDK 1.7.0) |
Score |
100 |
Code Size |
7602 Byte |
Status |
AC |
Exec Time |
624 ms |
Memory |
20916 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt |
All |
subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample-01.txt |
AC |
618 ms |
20916 KB |
subtask0_sample-02.txt |
AC |
391 ms |
20656 KB |
subtask0_sample-03.txt |
AC |
399 ms |
20784 KB |
subtask0_sample-04.txt |
AC |
406 ms |
20788 KB |
subtask1_01.txt |
AC |
454 ms |
20788 KB |
subtask1_02.txt |
AC |
519 ms |
20776 KB |
subtask1_03.txt |
AC |
624 ms |
20644 KB |
subtask1_04.txt |
AC |
404 ms |
20788 KB |
subtask1_05.txt |
AC |
421 ms |
20784 KB |
subtask1_06.txt |
AC |
430 ms |
20660 KB |
subtask1_07.txt |
AC |
438 ms |
20784 KB |
subtask1_08.txt |
AC |
466 ms |
20784 KB |
subtask1_09.txt |
AC |
446 ms |
20664 KB |
subtask1_10.txt |
AC |
440 ms |
20784 KB |
subtask1_11.txt |
AC |
455 ms |
20784 KB |
subtask1_12.txt |
AC |
441 ms |
20736 KB |
subtask1_13.txt |
AC |
424 ms |
20660 KB |
subtask1_14.txt |
AC |
429 ms |
20784 KB |
subtask1_15.txt |
AC |
429 ms |
20664 KB |