結果
| 問題 |
No.2306 [Cherry 5th Tune C] ウソツキタマシイ
|
| コンテスト | |
| ユーザー |
 Asahi
|
| 提出日時 | 2023-05-19 21:46:54 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 272 ms / 2,000 ms |
| コード長 | 7,823 bytes |
| コンパイル時間 | 5,345 ms |
| コンパイル使用メモリ | 86,284 KB |
| 実行使用メモリ | 47,012 KB |
| 最終ジャッジ日時 | 2024-12-18 02:31:24 |
| 合計ジャッジ時間 | 12,410 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 30 |
ソースコード
import java.util.*;
import java.io.*;
class Main{
void solve(PrintWriter out, In in) {
long n = in.nextLong();
int m = in.nextInt();
long [] A = in.LongArray(m);
long [] pow = new long[m];
long total = 0 ;
for(int i = 0 ; i < m ; i ++ ) {
pow[i] = A[i]*A[i];
total += pow[i];
}
int Q = in.nextInt();
long SUM = total;
while(Q-->0) {
int C = in.nextInt() , K = in.nextInt() , D = in.nextInt();
SUM -= pow[C-1];
SUM -= pow[D-1];
SUM += (A[C-1]-K) * (A[C-1]-K);
SUM += (A[D-1]+K) * (A[D-1]+K);
A[C-1] = A[C-1] - K;
A[D-1] = A[D-1] + K;
pow[C-1] = A[C-1]*A[C-1];
pow[D-1] = A[D-1]*A[D-1];
out.println(SUM);
}
}
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
In in = new In();
new Main().solve(out,in);
out.flush();
}/*
* upper_bound O(logN)
* keyより大きいインデックスを返します。
*/
int upper_bound(int [] A , int key) {
int left = 0;
int right = A.length;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] <= key) left = mid + 1;
else right = mid;
}
return right;
}
int upper_bound(long [] A , long key) {
int left = 0;
int right = A.length;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] <= key) left = mid + 1;
else right = mid;
}
return right;
}
int upper_bound(ArrayList<Integer> A , int key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(A.get(mid) <= key) left = mid + 1;
else right = mid;
}
return right;
}
int upper_bound(ArrayList<Long> A , long key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(A.get(mid) <= key) left = mid + 1;
else right = mid;
}
return right;
}
/*
* lower_bound O(logN)
* key以下のインデックスを返します。
*/
int lower_bound(int [] A , int key) {
int left = 0;
int right = A.length;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] < key) left = mid + 1;
else right = mid;
}
return right;
}
int lower_bound(long [] A , long key) {
int left = 0;
int right = A.length;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] < key) left = mid + 1;
else right = mid;
}
return right;
}
int lower_bound(ArrayList<Integer> A, int key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(A.get(mid) < key) left = mid + 1;
else right = mid;
}
return right;
}
int lower_bound(ArrayList<Long> A, long key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(A.get(mid) < key) left = mid + 1;
else right = mid;
}
return right;
}
}
class Pair{
private int first ;
private int second;
Pair(int first,int second) {
this.first = first;
this.second = second;
}
int first() { return this.first ; }
int second() { return this.second; }
@Override
public String toString(){ return first()+" = "+second(); }
}
class PairII {
private int first ;
private int second ;
private int third;
PairII(int first, int second, int third) {
this.first = first;
this.second = second;
this.third = third;
}
int first() { return this.first ; }
int second() { return this.second; }
int third() { return this.third ; }
@Override
public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
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());
}
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;
}
}