結果

問題 No.1681 +-*
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-12-06 04:31:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 127 ms / 2,000 ms
コード長 4,105 bytes
コンパイル時間 2,125 ms
コンパイル使用メモリ 89,412 KB
実行使用メモリ 42,616 KB
最終ジャッジ日時 2024-07-07 08:50:43
合計ジャッジ時間 5,159 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
37,136 KB
testcase_01 AC 45 ms
37,012 KB
testcase_02 AC 45 ms
36,940 KB
testcase_03 AC 45 ms
37,136 KB
testcase_04 AC 44 ms
37,008 KB
testcase_05 AC 117 ms
42,432 KB
testcase_06 AC 127 ms
42,256 KB
testcase_07 AC 121 ms
41,968 KB
testcase_08 AC 120 ms
42,384 KB
testcase_09 AC 120 ms
42,504 KB
testcase_10 AC 122 ms
42,392 KB
testcase_11 AC 126 ms
42,264 KB
testcase_12 AC 118 ms
42,264 KB
testcase_13 AC 96 ms
40,304 KB
testcase_14 AC 123 ms
42,424 KB
testcase_15 AC 49 ms
36,892 KB
testcase_16 AC 46 ms
37,348 KB
testcase_17 AC 120 ms
42,516 KB
testcase_18 AC 119 ms
42,616 KB
testcase_19 AC 123 ms
42,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;
import java.util.concurrent.locks.ReentrantReadWriteLock.WriteLock;
import java.io.File;
import java.io.FileDescriptor;
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.UncheckedIOException;
import java.lang.Thread.State;
import java.lang.reflect.Field;
import java.nio.CharBuffer;
import java.nio.charset.CharacterCodingException;
import java.nio.charset.CharsetEncoder;
import java.nio.charset.StandardCharsets;

public class Main {
	static final long MOD1=1000000007;
	static final long MOD=998244353;
	static long ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N = sc.nextInt();
		long[] A = sc.nextLongArray(N);
		long ans = 0;
		long x = 1l;
		long[] three = any_mod_pow(3l, N+1, MOD1);
		for (int i = 0; i < N-1; i++) {
			x = (x*A[i])%MOD1;
			long c = (2l*three[N-2-i]);
			ans = (ans + (x*c)%MOD1)%MOD1;
		}
		x = (x * A[N-1])%MOD1;
		ans = (ans + x)%MOD1;
		System.out.println(ans);
   	}
	static long[] any_mod_pow(long a,int size,long MOD){
    	long[] pow = new long[size+1];
    	pow[0] = 1l;
    	for (int i = 1; i < pow.length; i++) {
			pow[i] = (pow[i-1]*a)%MOD;
		}
    	return pow;
    }//aのn乗の配列
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			return a;
		}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0