oj.uz

Submission #667116

# Submission time Handle Problem Language Result Execution time Memory
667116 2022-11-30T11:58:40 Z zhing_zhou Autići (COCI22_autici) Java 11
10 / 50
 93 ms 10704 KB 
import java.util.*;
import java.io.*;
public class Main
{
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;
  
        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
  
        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(
                new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
  
        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') {
                    if (cnt != 0) {
                        break;
                    }
                    else {
                        continue;
                    }
                }
                buf[cnt++] = (byte)c;
            }
            return new String(buf, 0, cnt);
        }
  
        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ') {
                c = read();
            }
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
  
            if (neg)
                return -ret;
            return ret;
        }
  
        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }
  
        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
  
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
  
            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }
  
            if (neg)
                return -ret;
            return ret;
        }
  
        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0,
                                 BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }
  
        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }
  
        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
    public static void main(String args[]) throws IOException
    {
        Reader sc = new Reader();
        int n = sc.nextInt();
        int a[] = new int[n];
        long ans = 0;
        for(int i = 0; i < n; i++)
        {
            a[i] = sc.nextInt();
            ans += a[i];
            if(i != n - 1 && i != 0)
            {
                ans += a[i];
            }
        }
        if(n == 1) ans = 0;
        System.out.println(ans);
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 8316 KB Output is correct
2 Correct 87 ms 10316 KB Output is correct
3 Correct 87 ms 10704 KB Output is correct
4 Correct 90 ms 10404 KB Output is correct
5 Correct 93 ms 10588 KB Output is correct
6 Correct 88 ms 10364 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 8096 KB Output is correct
2 Correct 57 ms 8156 KB Output is correct
3 Correct 58 ms 8284 KB Output is correct
4 Correct 67 ms 8368 KB Output is correct
5 Correct 58 ms 8232 KB Output is correct
6 Incorrect 61 ms 8328 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 8316 KB Output is correct
2 Correct 87 ms 10316 KB Output is correct
3 Correct 87 ms 10704 KB Output is correct
4 Correct 90 ms 10404 KB Output is correct
5 Correct 93 ms 10588 KB Output is correct
6 Correct 88 ms 10364 KB Output is correct
7 Correct 57 ms 8096 KB Output is correct
8 Correct 57 ms 8156 KB Output is correct
9 Correct 58 ms 8284 KB Output is correct
10 Correct 67 ms 8368 KB Output is correct
11 Correct 58 ms 8232 KB Output is correct
12 Incorrect 61 ms 8328 KB Output isn't correct
13 Halted 0 ms 0 KB -