結果
問題 | No.2451 Redistribute Integers |
ユーザー | Asahi |
提出日時 | 2023-09-01 21:54:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 4,971 bytes |
コンパイル時間 | 3,760 ms |
コンパイル使用メモリ | 85,368 KB |
実行使用メモリ | 59,428 KB |
最終ジャッジ日時 | 2023-09-01 21:54:45 |
合計ジャッジ時間 | 5,954 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge16 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
51,420 KB |
testcase_01 | AC | 42 ms
49,452 KB |
testcase_02 | AC | 42 ms
51,340 KB |
testcase_03 | AC | 43 ms
51,732 KB |
testcase_04 | AC | 147 ms
59,428 KB |
testcase_05 | AC | 43 ms
51,416 KB |
testcase_06 | AC | 43 ms
51,932 KB |
testcase_07 | AC | 41 ms
51,260 KB |
testcase_08 | AC | 160 ms
59,380 KB |
testcase_09 | AC | 44 ms
51,392 KB |
testcase_10 | AC | 44 ms
51,396 KB |
testcase_11 | AC | 46 ms
52,536 KB |
testcase_12 | AC | 107 ms
54,204 KB |
testcase_13 | AC | 117 ms
58,820 KB |
testcase_14 | AC | 141 ms
59,136 KB |
testcase_15 | AC | 122 ms
57,700 KB |
testcase_16 | AC | 119 ms
56,072 KB |
testcase_17 | AC | 121 ms
57,076 KB |
testcase_18 | AC | 116 ms
59,016 KB |
testcase_19 | AC | 80 ms
54,460 KB |
testcase_20 | AC | 121 ms
55,356 KB |
testcase_21 | AC | 133 ms
56,820 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; import java.util.stream.*; class Main implements Runnable{ // introduced in Java 16 record pair(int first , int second) { } void solve() { int n = in.nextInt(); long [] A = in.LongArray(n); long sum = 0 ; boolean ok = true ; for(int i = 0 ; i < n ; i ++ ) { sum += A[i]; } for(int i = 0 ; i < n - 1 ; i ++ ) { ok &= (A[i] - A[i + 1]) % n == 0 ; } out.println(sum % n == 0 && ok ? "Yes":"No"); } public static void main(String[] args) { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); } public void run() { solve(); out.flush(); } PrintWriter out = new PrintWriter(System.out); In in = new In(); } class In{ private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) { ptr++; } return hasNextByte(); } String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } double nextDouble() { return Double.parseDouble(next()); } char nextChar() { return next().charAt(0); } int [] IntArray(int n) { final int [] Array = new int [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = nextInt(); } return Array; } int [][] IntArray(int n , int m) { final int [][] Array = new int [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = IntArray(m); } return Array; } long [] LongArray(int n) { final long [] Array = new long [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = nextLong(); } return Array; } long [][] LongArray(int n , int m) { final long [][] Array = new long [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = LongArray(m); } return Array; } String [] StringArray(int n) { final String [] Array = new String [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next(); } return Array; } char [] CharArray(int n) { final char [] Array = new char[n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next().charAt(0); } return Array; } char [][] CharArray(int n , int m) { final char [][] Array = new char [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next().toCharArray(); } return Array; } char [][] CharArray2(int n , int m) { final char [][] Array = new char [n][m]; for(int i = 0 ; i < n ; i ++ ) { for(int j = 0 ; j < n ; j ++ ) { Array[i][j] = next().charAt(0); } } return Array; } List<Integer> [] Graph(int n) { @SuppressWarnings("unchecked") List<Integer> [] G = new ArrayList[n]; for(int i = 0 ; i < n ; i ++ ) { G[i] = new ArrayList<>(); } return G ; } }