input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# ABC125D - Flipping Signs
def main():
# neg % 2 == 0 -> all negatives disappear
# 0 in A -> move all neg there
# else -> move all neg to the smallest one (abs(i))
N = int(eval(input()))
A = tuple(map(int, input().split()))
mi = min(abs(i) for i in A)
abs_sum = sum(abs(i) for i in A)
neg = sum(i < 0 for i in A)
if 0 in A or neg % 2 == 0:
print(abs_sum)
else:
print((abs_sum - mi * 2))
if __name__ == "__main__":
main() | # ABC125D - Flipping Signs
def main():
# neg % 2 == 0 -> all negatives disappear
# 0 in A -> move all neg there
# else -> move all neg to the smallest one (abs(i))
N = int(eval(input()))
A = tuple(map(int, input().split()))
mi = abs(min(A, key=abs))
abs_sum = sum(abs(i) for i in A)
neg = sum(i < 0 for i in A)
if 0 in A or neg % 2 == 0:
print(abs_sum)
else:
print((abs_sum - mi * 2))
if __name__ == "__main__":
main() | p03062 |
#!/usr/bin/env python3
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = sum(A)
for i in range(0,N-1,2):
# print(i)
tmp = ans - 2*(A[i]+A[i+1])
if tmp > ans:
ans = tmp
print(ans)
if __name__ == "__main__":
main()
| N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] < 0:
cnt += 1
A = [abs(a) for a in A]
if cnt % 2 == 0:
print((sum(A)))
else:
print((sum(A)-2*min(A))) | p03062 |
n=int(eval(input()))
a=list(map(int, input().split()))
a_s=sorted(a)
for i in range(0,n-1,2):
if a_s[i]<0 and a_s[i+1]<0:
a_s[i]=-a_s[i]
a_s[i+1]=-a_s[i+1]
elif a_s[i]<0 and -a_s[i]>a_s[i+1]:
a_s[i]=-a_s[i]
a_s[i+1]=-a_s[i+1]
else:
break
print((sum(a_s))) | n=int(eval(input()))
a=list(map(int, input().split()))
b=list(map(abs, a))
cnt = 0
for i in range(n):
if a[i]<0:
cnt+=1
if cnt%2==0:
print((sum(b)))
else:
print((sum(b)-2*min(b))) | p03062 |
n=int(eval(input()))
a=list(map(int,input().split()))
dp=[[0 for _ in range(2)] for _ in range(n+1)]
dp[0][1] = - 10**9
for i in range(n):
dp[i+1][0]=max(dp[i][0]+a[i],dp[i][1]-a[i])
dp[i+1][1]=max(dp[i][0]-a[i],dp[i][1]+a[i])
print((dp[n][0])) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt = sum([1 for i in a if i < 0])
if cnt%2:
r = 10**9
for i in range(n):
r = min(r,abs(a[i]))
print((sum([abs(x) for x in a])-2*r))
else:
print((sum([abs(x) for x in a]))) | p03062 |
import sys
sys.setrecursionlimit(1000000)
class Solution():
def dp(self, pos, sign):
if pos == self.n-1:
if sign == 0:
return +self.lst[pos]
else:
return -self.lst[pos]
elif (pos, sign) in self.vis:
return self.rcd[pos][sign]
elif sign == 0:
self.rcd[pos][sign] = max(self.dp(pos+1, 0) + self.lst[pos], self.dp(pos+1, 1) - self.lst[pos])
self.vis.add((pos, sign))
return self.rcd[pos][sign]
else:
self.rcd[pos][sign] = max(self.dp(pos+1, 0) - self.lst[pos], self.dp(pos+1, 1) + self.lst[pos])
self.vis.add((pos, sign))
return self.rcd[pos][sign]
def run(self):
self.n = int(eval(input()))
self.lst = list(map(int, input().split()))
self.rcd = [[0, 0] for _ in range(self.n)]
self.vis = set()
print((self.dp(0, 0)))
solution = Solution()
solution.run()
| # D - Flipping Signs
# https://atcoder.jp/contests/abc125/tasks/abc125_
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = list( map(int, input().split()) )
visit = dict()
def dp(pos, sign):
# terminal condition
if pos == N-1:
if sign == 0:
return A[pos]
else:
return -A[pos]
if (pos, sign) in visit:
return visit[(pos, sign)]
elif sign == 0:
# memorize
visit[(pos, sign)] = max( dp(pos+1, 0) + A[pos], dp(pos+1, 1) - A[pos])
return visit[(pos, sign)]
else: # st == 1
# memorize
visit[(pos, sign)] = max( dp(pos+1, 0) - A[pos], dp(pos + 1, 1) + A[pos])
return visit[(pos, sign)]
print('{}'.format( dp(0,0) ))
| p03062 |
N = int(eval(input()))
A=list(map(int,input().split()))
cnt = 0
B=[None]*N
C=10**9+1
for i in range(len(A)):
B[i]=abs(A[i])
C=min(C,B[i])
if A[i]<0:
cnt+=1
ret = sum(B)-C+C*(-1)**cnt
print(ret) | N = int(eval(input()))
A=list(map(int,input().split()))
cnt=sum([1 for i in A if i<0])
A=list(map(abs,A))
ret = sum(A)-min(A)*(1-(-1)**cnt)
print(ret) | p03062 |
int(eval(input()))
a=[int(i) for i in input().split()]
b=[abs(int(i)) for i in a]
c=[int(i) for i in a if i<0]
b.sort()
print((sum(b)-[0,b[0]*2][len(c)%2])) | int(eval(input()))
a=[int(i) for i in input().split()]
b=[abs(int(i)) for i in a]
c=[int(i) for i in a if i<0]
print((sum(b)-[0,min(b)*2][len(c)%2])) | p03062 |
int(eval(input()))
a=[int(i) for i in input().split()]
b=[abs(int(i)) for i in a]
c=[int(i) for i in a if i<0]
print((sum(b)-[0,min(b)*2][len(c)%2])) | n=int(eval(input()))
a=[int(i) for i in input().split()]
x=0
b=[]
for i in a:
if i<0: x=x+1
b.append(abs(i))
b.sort()
print((sum(b)-b[0]*2 if x%2 else sum(b))) | p03062 |
def main():
n, *a = list(map(int, open(0).read().split()))
b = [i for i in a if i <= 0]
*ab, = [abs(x) for x in a]
c, d = sum(a), sum(b)
if len(b) % 2 == 0:
print((c - 2 * d))
else:
print((c - 2 * d - 2 * min(ab)))
if __name__ == '__main__':
main()
| def main():
n, *a = list(map(int, open(0).read().split()))
b = [i for i in a if i <= 0]
*ab, = list(map(abs, a))
c = sum(ab)
if len(b) % 2 == 0:
print(c)
else:
print((c - 2 * min(ab)))
if __name__ == '__main__':
main()
| p03062 |
n = int(eval(input()))
l = list(map(int,input().split()))
m = sorted(list(map(abs,l)))
print((sum(m) - sum(i<0 for i in l)%2*m[0]*2)) | n=int(eval(input()))
l=list(map(int,input().split()))
m=list(map(abs,l))
print((sum(m)-sum(i<0 for i in l)%2*min(m)*2)) | p03062 |
n=int(eval(input()))
a=[*list(map(int,input().split()))]
b=c=0
l=[]
for i in a:
if i==0:
b=1
if i<0:
c+=1
l.append(abs(i))
print((sum(l)-[0,min(l)*2][c%2 and b<1])) | n=int(eval(input()))
a=[*list(map(int,input().split()))]
c=0
l=[]
for i in a:
if i<0: c+=1
l+=[abs(i)]
print((sum(l)-[0,min(l)*2][c%2])) | p03062 |
n=int(eval(input()))
a=[*list(map(int,input().split()))]
c=0
l=[]
for i in a:
if i<0: c+=1
l+=[abs(i)]
print((sum(l)-[0,min(l)*2][c%2])) | n=int(eval(input()))
l=[*list(map(int,input().split()))]
c=0
for e,i in enumerate(l):
if i<0:
c+=1
l[e]=-i
print((sum(l)-[0,min(l)*2][c%2])) | p03062 |
n=int(eval(input()))
l=[*list(map(int,input().split()))]
c=0
for e,i in enumerate(l):
if i<0:
c+=1
l[e]=-i
print((sum(l)-[0,min(l)*2][c%2])) | n=int(eval(input()))
a=[*list(map(int,input().split()))]
l=[*list(map(abs,a))]
print((sum(l)-sum(i<0 for i in a)%2*min(l)*2)) | p03062 |
n=int(eval(input()))
a=[*list(map(int,input().split()))]
l=[*list(map(abs,a))]
print((sum(l)-sum(i<0 for i in a)%2*min(l)*2)) | eval(input())
a=[*list(map(int,input().split()))]
l=[*list(map(abs,a))]
print((sum(l)-sum(i<0 for i in a)%2*min(l)*2)) | p03062 |
N=int(eval(input()))
A=list(map(int,input().split()))
dp=[[0,0] for i in range(N)]
dp[0][0]=A[0]+A[1]
dp[0][1]=-1*dp[0][0]
for i in range(1,N-1):
dp[i][0]=max(dp[i-1][0]+A[i+1],dp[i-1][1]+A[i+1])
dp[i][1]=max(dp[i-1][0]-2*A[i]-A[i+1],dp[i-1][1]+2*A[i]-A[i+1])
print((max(dp[N-2]))) | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
idx=N
for i in range(N):
if A[i]>0:
idx=i
break
if idx==0:
print((sum(A)))
elif idx==N:
print((sum(A[(N//2)*2:])-sum(A[:(N//2)*2])))
else:
x=sum(A[(idx//2)*2:])-sum(A[:(idx//2)*2])
y=sum(A[((idx+1)//2)*2:])-sum(A[:((idx+1)//2)*2])
z=sum(A[(1+idx//2)*2:])-sum(A[:(1+idx//2)*2])
print((max(x,y,z))) | p03062 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=sum(a)
for i in range(n-1):
if a[i]<0:
a[i]=a[i]*(-1)
a[i+1]=a[i+1]*(-1)
b=max(b,sum(a))
print((sum(a))) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in a:
if i<0:
cnt+=1
s=0
for i in range(n):
s+=abs(a[i])
if cnt%2==1:
c=10**10
for i in range(n):
num=abs(a[i])
if num<c:
c=num
s=s-(c*2)
print(s) | p03062 |
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for a in A:
if a < 0:
cnt += 1
C = [abs(a) for a in A]
C.sort(reverse=True)
if cnt%2 == 0:
print((sum(C)))
else:
C[-1] *= (-1)
print((sum(C))) | n = int(eval(input()))
A =list(map(int, input().split()))
dp = [[0]*2 for _ in range(n)]
# dp[i][0]:*1
# dp[i][1]:*(-1)
for i in range(n-1):
if i == 0:
dp[i+1][0] += A[i]
dp[i+1][1] += -A[i]
else:
dp[i+1][0] = max(dp[i][0]+A[i], dp[i][1]+(-1)*A[i])
dp[i+1][1] = max(dp[i][0]+(-1)*A[i], dp[i][1]+A[i])
ans = max(dp[n-1][0]+A[n-1], dp[n-1][1]+(-1)*A[n-1])
print(ans)
| p03062 |
n = int(eval(input()))
a_ls = list(map(int, input().split()))
num_minus = 0
Min = float('inf')
Sum = 0
for i in range(n):
if a_ls[i] < 0:
num_minus += 1
Min = min(abs(a_ls[i]),Min)
Sum += abs(a_ls[i])
if num_minus % 2 == 0:
ans = Sum
else:
ans = Sum - 2 * Min
print(ans) | N = int(eval(input()))
a_ls = list(map(int, input().split()))
abs_ls = [0] * N
minus = 0
for i in range(N):
if a_ls[i] < 0:
minus += 1
abs_ls[i] = abs(a_ls[i])
if minus % 2 == 1:
ans = sum(abs_ls) - 2 * min(abs_ls)
else:
ans = sum(abs_ls)
print(ans) | p03062 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = 100000000000
count = 0
ans = 0
for i in range(n):
if a[i] < 0:
count += 1
x = abs(a[i])
ans += x
m = min(m,x)
if count % 2 != 0:
ans -= 2*m
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
m = 10000000000
count = 0
for i in range(n):
if a[i] < 0:
count += 1
a[i] = -a[i]
if count % 2 == 1:
print((sum(a)-2*min(a)))
else:
print((sum(a))) | p03062 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
m = sum(1 for i in a if i < 0)
z = any(i==0 for i in a)
if m%2 == 0 or z:
print((sum(abs(i) for i in a)))
else:
# print(sum(abs(i) for i in a),min(abs(i) for i in a))
print((sum(abs(i) for i in a)-2*abs(min(abs(i) for i in a))))
| N=int(eval(input()))
A=[int(a) for a in input().split()]
ABS_SUM=sum(abs(a) for a in A)
ans=0
if 0 in A:
ans=ABS_SUM
else:
pal=sum(1 for a in A if a<0)
if pal%2==0:
ans=ABS_SUM
else:
ABS_MIN=min(abs(a) for a in A)
ans=ABS_SUM-ABS_MIN*2
print(ans) | p03062 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
cnt = 0
s = 0
minabs = 10**11
for a in A:
if a <= -1:
cnt += 1
s += abs(a)
minabs = min(minabs, abs(a))
if cnt % 2 == 0:
print(s)
else:
print((s-minabs*2))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
m = 10**20
c = 0
for a in A:
if a < 0:
c += 1
m = min(m, abs(a))
if c % 2 == 0:
ans = sum([abs(a) for a in A])
else:
ans = sum([abs(a) for a in A]) - m*2
print(ans)
| p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
m = 10 ** 9 #絶対値の最小
c = 0 #マイナスの数
for i in range(N):
ans += abs(A[i])
if m > abs(A[i]):
m = abs(A[i])
if A[i] < 0: c += 1
print((ans if c % 2 == 0 else ans - 2 * m)) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] < 0:cnt += 1
if cnt % 2 == 0:
print((sum([abs(x) for x in A])))
else:
a = [abs(x) for x in A]
print((sum(a) - min(a)*2)) | p03062 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
from itertools import combinations
import copy
b=[i for i in range(n-1)]
c=[v for i in range(1,n) for v in combinations(b, i)]
sum_temp=sum(a)
for v in c:
a_temp=copy.copy(a)
for i in v:
a_temp[i]*=-1
a_temp[i+1]*=-1
if sum_temp<sum(a_temp):
sum_temp=sum(a_temp)
print(sum_temp) | n=int(eval(input()))
a=[int(i) for i in input().split()]
ans=None
a_pos=[abs(i) for i in a]
a_min=min(a_pos)
a_neg=sum([1 if i<0 else 0 for i in a])
if a_neg%2==0:
ans=sum(a_pos)
else: ans=sum(a_pos)-2*a_min
print(ans) | p03062 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
A = [int(a) for a in input().split()]
# 正の数p, 負の数nに対して、p+n=N
# 全探索は2^Nで爆発
while True:
ch = False
for i in range(0, N-1):
if i < N-2 and 2*A[i]+3*A[i+1]+2*A[i+2] < 0:
A[i] *= -1
A[i+2] *= -1
ch = True
if A[i] + A[i+1] < 0:
A[i] *= -1
A[i+1] *= -1
ch = True
if ch is False:
break
print((sum(A)))
| # -*- coding: utf-8 -*-
N = int(eval(input()))
A = [int(a) for a in input().split()]
# かっこいい解法版
# Ai, Ai+1を反転して-Ai,-Ai+1であるが、これを繰り返すことで、
# -Ai, Ai+1, Ai+2,....,Aj-1, -Aj というように、
# i < jとなるi,jのみを反転させ、間はそのままという操作が可能。
# ここから、負の数が偶数個であれば、全てを正にすることができる
# 負の数が奇数個であれば、絶対値が一番小さい数を残して残りを正にすればよい
ng = [a for a in A if a < 0] # 負の数の抽出
ab = [abs(a) for a in A] # 絶対値の和
if len(ng) % 2 == 0:
print((sum(ab)))
else:
mn = min(ab)
print((sum(ab)-2*mn))
| p03062 |
n = int(eval(input()))
A = list(map(int,input().split()))
cnt = 0
for a in A:
if a < 0:
cnt += 1
res = 0
A = [abs(a) for a in A]
A.sort()
for a in A:
res += a
if cnt%2 == 1:
res -= 2*A[0]
print(res) | n = int(eval(input()))
A = list(map(int,input().split()))
cnt = 0
for a in A:
if a < 0:
cnt += 1
A = [abs(a) for a in A]
res = sum(A)
if cnt%2 == 1:
res -= 2*min(A)
print(res) | p03062 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
A = LIST()
cnt = 0
for i, x in enumerate(A):
if x < 0:
cnt += 1
A[i] *= -1
if cnt%2:
print((sum(A) - 2*min(A)))
else:
print((sum(A)))
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
A = LIST()
a = [abs(x) for x in A] #Aの絶対値
n = sum([A[i] != a[i] for i in range(N)]) #Aの中で負のものは何個あるか
if n%2:
print((sum(a) - 2*min(a)))
else:
print((sum(a)))
| p03062 |
n = int(eval(input()))
a = list(map(int,input().split()))
aabs = [i if i>=0 else i*(-1) for i in a]
MIN = min(aabs)
ans = 0
mcount = 0
for i in range(n):
if a[i] < 0:
mcount += 1
if mcount%2 == 0:
for i in a:
ans += abs(i)
print(ans)
else:
for i in a:
ans += abs(i)
print((ans - 2*MIN)) | #他の数字はそのままで，任意の2数の符号を同時に反転させることが可能．マイナスの数の偶奇で場合分け
n = int(eval(input()))
a = list(map(int,input().split()))
aabs = [i if i>=0 else i*(-1) for i in a]
MIN = min(aabs)
ans = 0
mcount = 0
for i in range(n):
if a[i] < 0:
mcount += 1
if mcount%2 == 0:
for i in a:
ans += abs(i)
print(ans)
else:
for i in a:
ans += abs(i)
print((ans - 2*MIN)) | p03062 |
def main():
_ = int(eval(input()))
A = [int(i) for i in input().split()]
cnt_minus = 0
zero_flag = False
for i, a in enumerate(A):
if a < 0:
cnt_minus += 1
elif a == 0:
zero_flag = True
ans = 0
if cnt_minus % 2 == 0 or zero_flag:
ans = sum(abs(a) for a in A)
else:
ans = sum(abs(a) for a in A) - min(abs(a) for a in A) * 2
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
_ = int(eval(input()))
A = [int(i) for i in input().split()]
sumA = sum(abs(a) for a in A)
mi = len([a for a in A if a < 0])
if 0 in A or mi % 2 == 0:
print(sumA)
else:
print((sumA - 2*min(abs(a) for a in A)))
if __name__ == '__main__':
main()
| p03062 |
N = int(eval(input()))
arr = list(map(int, input().split()))
count = 0
gokei = 0
mi = float('inf')
flg = False
for i in arr:
gokei += abs(i)
mi = min(mi,abs(i))
if i < 0:
count += 1
if i == 0:
flg = True
if flg or count % 2 == 0:
print(gokei)
else:
print((gokei-mi*2)) | N = int(eval(input()))
arr = list(map(int, input().split()))
cnt = 0
flg = False
for i in range(N):
if arr[i] == 0:
flg = True
if arr[i] < 0:
cnt += 1
arr[i] = abs(arr[i])
if cnt % 2 == 0 or flg:
print((sum(arr)))
else:
print((sum(arr) - min(arr)*2)) | p03062 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
sum_abs, min_abs, cnt_minus = 0, 10**9, 0
for ai in a:
if ai < 0:
cnt_minus += 1
abs_ai = abs(ai)
sum_abs += abs_ai
if abs_ai < min_abs:
min_abs = abs_ai
if cnt_minus % 2 == 0 or 0 in a:
print(sum_abs)
else:
print((sum_abs - 2*min_abs)) | # knk_kei 0 in a の条件は不要
n = int(eval(input()))
a = [int(i) for i in input().split()]
if len([i for i in a if i < 0]) % 2 == 0:
print((sum([abs(i) for i in a])))
else:
print((sum([abs(i) for i in a]) - 2*min([abs(i) for i in a]))) | p03062 |
n = int(eval(input()))
a = list(map(int, input().split()))
pa = []
cnt = 0
for s in a:
if s < 0:
cnt += 1
pa.append(abs(s))
if cnt % 2:
print((sum(pa) - 2 * min(pa)))
else:
print((sum(pa)))
| n = int(eval(input()))
a = list(map(int, input().split()))
pa = [abs(s) for s in a]
cnt = sum([s < 0 for s in a])
if cnt % 2:
print((sum(pa) - 2 * min(pa)))
else:
print((sum(pa)))
| p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
negA = []
posA = []
for a in A:
if a >= 0:
posA.append(a)
else:
negA.append(a)
ans = sum(posA) - sum(negA)
if len(negA) % 2 == 1:
ans -= min([abs(a) for a in A]) * 2
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = [abs(a) for a in A]
minus = sum([a < 0 for a in A])
ans = sum(B)
if minus % 2 == 1:
ans -= min(B) * 2
print(ans)
| p03062 |
N=int(eval(input()))
A=list(map(int,input().strip().split(' ')))
dp=[[0]*2 for i in range(len(A))]
dp[0][0]=A[0]
dp[0][1]=A[0]
for i in range(1,len(A)):
if i!=1:
dp[i][0]=max(dp[i-1][0]+A[i],dp[i-1][1]+A[i])
dp[i][1]=max(dp[i-1][0]-2*A[i-1]-A[i],dp[i-1][1]+2*A[i-1]-A[i])
else:
dp[i][0]=A[i-1]+A[i]
dp[i][1]=-A[i-1]-A[i]
print((max(dp[-1][0],dp[-1][1]))) | eval(input())
A=list(map(int,input().strip().split(" ")))
pos=[]
neg=[]
for x in A:
if x>=0:
pos+=[x]
else:
neg+=[x]
pos=sorted(pos)
neg=sorted(neg)
if len(neg)%2==0:
print((sum(pos)-sum(neg)))
else:
ans1=sum(pos)-sum(neg)+2*neg[-1]
ans2=sum(pos)-sum(neg)+2*neg[-1]
if len(pos)>0:
ans2=sum(pos)-sum(neg)-2*pos[0]
print((max(ans1,ans2)))
| p03062 |
n=int(eval(input()))
t = list(map(int,input().split()))
count = 0
for i in t:
if i < 0:
count += 1
memo = []
for i in t:
memo.append(abs(i))
memo.sort()
if count%2==0:
print((sum(memo)))
else:
print((sum(memo)-memo[0]*2)) | n=int(eval(input()))
a= list(map(int,input().split()))
plus = []
minas = []
for value in a:
if value < 0:
minas.append(abs(value))
else:
plus.append(value)
if len(minas)%2 == 0:
ans = sum(plus)+sum(minas)
else:
if len(plus) > 0:
mini = min(min(plus),min(minas))
ans = sum(plus)+sum(minas)-mini*2
else:
mini = min(minas)
ans = sum(minas)-mini*2
print(ans) | p03062 |
n = int(eval(input()))
a = list(map(int, input().split()))
new_a = []
sum = 0
minus_count = 0
zero_flag = 0
for i in range(n):
new_a.append(abs(a[i]))
for i in range(n):
if a[i] < 0:
minus_count += 1
if a[i] == 0:
zero_flag = 1
if zero_flag == 1:
for i in range(n):
sum += abs(a[i])
elif minus_count % 2 == 0:
for i in range(n):
sum += abs(a[i])
else:
for i in range(n):
sum += new_a[i]
sum = sum - min(new_a) * 2
print(sum) | n = int(eval(input()))
a = list(map(int, input().split()))
new_a = []
sum = 0
minus_count = 0
for i in range(n):
new_a.append(abs(a[i]))
for i in range(n):
if a[i] < 0:
minus_count += 1
if minus_count % 2 == 0:
for i in range(n):
sum += abs(a[i])
else:
for i in range(n):
sum += new_a[i]
sum = sum - min(new_a) * 2
print(sum) | p03062 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
total = 0
mi = f_inf
for a in A:
total += abs(a)
if a < 0:
cnt += 1
if mi > abs(a):
mi = abs(a)
if cnt % 2 == 0:
print(total)
else:
print((total - mi * 2))
def resolve2():
n = int(eval(input()))
A = list(map(int, input().split()))
dp = [[0 for _ in range(2)] for _ in range(n + 1)]
dp[0][1] = -f_inf
for i in range(1, n + 1):
dp[i][0] = max(dp[i - 1][0] + A[i - 1], dp[i - 1][1] - A[i - 1])
dp[i][1] = max(dp[i - 1][0] - A[i - 1], dp[i - 1][1] + A[i - 1])
print((dp[n][0]))
if __name__ == '__main__':
resolve2()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
total = 0
mi = f_inf
cnt_minus = 0
for a in A:
if a < 0:
cnt_minus += 1
if mi > abs(a):
mi = abs(a)
total += abs(a)
print((total if cnt_minus % 2 == 0 else total - mi * 2))
if __name__ == '__main__':
resolve()
| p03062 |
n = int(eval(input()))
lis = list(map(int, input().split()))
if 0 in lis:
ans = 0
for i in lis:
if i < 0:
ans += -1 * i
else:
ans += i
print(ans)
exit()
minus = [0]*n
for i in range(n):
if lis[i] < 0:
minus[i] = 1
if sum(minus) % 2 == 0:
ans = 0
for i in lis:
if i < 0:
ans += -1 * i
else:
ans += i
print(ans)
else:
ans = 0
m = 10**9+1
for i in lis:
if i < 0:
ans += -1*i
else:
ans += i
m = min(m, abs(i))
print((ans - 2*m))
| n = int(eval(input()))
lis = list(map(int, input().split()))
minus = 0
for i in range(n):
if lis[i] < 0:
minus += 1
lis[i] = lis[i]*-1
if 0 in lis or minus % 2 == 0:
print((sum(lis)))
else:
print((sum(lis) - 2*min(lis))) | p03062 |
n=int(eval(input()))
l=list(map(int,input().split()))
a=abs(l[0])
m=0
d=0
z=0
s=0
for i in range(n):
if l[i]<0:
d+=1
elif l[i]==0:
z+=1
if d%2==0 or (d+z)%2==0:
for i in range(n):
s+=abs(l[i])
print(s)
else:
for i in range(1,n):
if a>=abs(l[i]):
a=abs(l[i])
m=i
s=0
for i in range(m):
s+=abs(l[i])
s+=-abs(l[m])
for i in range(m+1,n):
s+=abs(l[i])
print(s)
| n=int(eval(input()))
l=list(map(int,input().split()))
b=False
sum=0
count=0
absmin=10000000
for i in l:
if i==0:
b=True
elif i<0:
count+=1
if absmin>abs(i):
absmin=abs(i)
sum+=abs(i)
if b:
print(sum)
else:
if count%2==1:
print((sum-2*absmin))
else:
print(sum) | p03062 |
N=int(eval(input()))
L=list(map(int,input().split()))
count=0
sum=0
A=float("inf")
for i in L:
sum+=abs(i)
A=min(A,abs(i))
if i<0:
count+=1
if count%2==0:
print(sum)
else:
print((sum-A*2)) | N=int(eval(input()))
L=list(map(int,input().split()))
count=0
sum=0
A=float("inf")
for i in L:
sum+=abs(i)
A=min(A,abs(i))
if i<0:
count+=1
if count%2==0:
print(sum)
else:
B=float("inf")
for i in L:
if abs(i)==A:
if i==0:
print(sum)
exit()
elif i>0:
print((sum-2*i))
exit()
elif i<0:
print((sum-2*A))
exit() | p03062 |
N=int(eval(input()))
L=list(map(int,input().split()))
count=0
sum=0
A=float("inf")
for i in L:
sum+=abs(i)
A=min(A,abs(i))
if i<0:
count+=1
if count%2==0:
print(sum)
else:
B=float("inf")
for i in L:
if abs(i)==A:
if i==0:
print(sum)
exit()
elif i>0:
print((sum-2*i))
exit()
elif i<0:
print((sum-2*A))
exit() | N=int(eval(input()))
L=list(map(int,input().split()))
count=0
sum=0
A=float("inf")
for i in L:
sum+=abs(i)
A=min(A,abs(i))
if i<0:
count+=1
if count%2==0:
print(sum)
else:
print((sum-A*2)) | p03062 |
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = len([1 for i in range(N) if A[i] < 0])
SUM = sum(map(abs,A))
MIN = min(list(map(abs,A)))
if cnt%2 == 0:
print(SUM)
else:
print((SUM-2*MIN)) | N=int(eval(input()))
A=list(map(int,input().split()))
print((sum(map(abs,A))-2*min(list(map(abs,A)))*(sum([1 for i in A if i<0])%2))) | p03062 |
N = int(eval(input()))
A = list(map(int,input().split()))
minus_cnt = 0
abs_sum = 0
min_abs_val = 1000000000
for i in range(N):
abs_val = abs(A[i])
abs_sum = abs_sum + abs_val
if abs_val < min_abs_val:
min_abs_val = abs_val
if A[i] < 0:
minus_cnt = minus_cnt + 1
B_max_sum = 0
if (minus_cnt % 2 == 0) or (min_abs_val == 0):
B_max_sum = abs_sum
else:
B_max_sum = abs_sum - min_abs_val * 2
print(B_max_sum)
| N = int(eval(input()))
A = list(map(int,input().split()))
minus_cnt = 0
abs_sum = 0
min_abs_val = 1000000000
for i in range(N):
val = A[i]
abs_val = abs(val)
abs_sum += abs_val
if abs_val < min_abs_val:
min_abs_val = abs_val
if val < 0:
minus_cnt += 1
B_max_sum = abs_sum
if (minus_cnt % 2 != 0) and (min_abs_val != 0):
B_max_sum -= (min_abs_val * 2)
print(B_max_sum)
| p03062 |
N=int(eval(input()))
A=[int(i) for i in input().split()]
plus=0
zero=0
minus=0
for i in A:
if i>0:
plus+=1
elif i==0:
zero+=1
else:
minus+=1
if zero>0:
print((sum([abs(i) for i in A])))
else:
if minus%2==0:
print((sum([abs(i) for i in A])))
else:
B=[abs(i) for i in A]
print((sum(B)-2*min(B)))
| N=int(eval(input()))
A=[int(i) for i in input().split()]
B=[abs(i) for i in A]
minus=0
for i in A:
if i<0:
minus+=1
if minus%2==0:
print((sum(B)))
else:
print((sum(B)-2*min(B)))
| p03062 |
def solve():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[-1] * 2 for _ in range(n + 1)]
dp[0][False] = 0
# dp[idx][マイナスをかける必要があるか]:=総和の最大値
for j, x in enumerate(a):
if dp[j][True] == -1:
dp[j + 1][False] = dp[j][False] + x
dp[j + 1][True] = dp[j][False] - x
else:
dp[j + 1][False] = max(dp[j][False] + x, dp[j][True] - x)
dp[j + 1][True] = max(dp[j][False] - x, dp[j][True] + x)
return dp[n][False]
if __name__ == '__main__':
print((solve()))
| def main():
inf = 10 ** 14 + 1
n = int(eval(input()))
*a, = list(map(int, input().split()))
stay = 0 # -1を乗算しない
done = -inf # -1を乗算した
for x in a:
stay, done = max(stay + x, done - x), max(stay - x, done + x)
print(stay)
if __name__ == '__main__':
main()
| p03062 |
from itertools import *
from collections import *
N = int(eval(input()))
An = list(map(int, input().split()))
An_pos, An_neg = deque(), deque()
for a in An:
if a >= 0:
An_pos.append(a)
else:
An_neg.append(-a)
pass
pass
ans = sum(chain(An_pos, An_neg))
if len(An_neg) % 2 == 1:
ans -= 2 * min(chain(An_pos, An_neg))
pass
print(ans)
| from itertools import *
N = int(eval(input()))
An = list(map(int, input().split()))
class MyIter:
def __init__(self, it):
self.it = it
self.num_negs = 0
pass
def __iter__(self):
for value in self.it:
if value < 0:
self.num_negs += 1
yield -value
pass
else:
yield value
pass
pass
pass
pass
myiter = MyIter(An)
Bn = list(myiter)
ans = sum(Bn)
if myiter.num_negs % 2 == 1:
ans -= 2 * min(Bn)
pass
print(ans)
| p03062 |
from itertools import *
N = int(eval(input()))
An = list(map(int, input().split()))
class MyIter:
def __init__(self, it):
self.it = it
self.num_negs = 0
self.total = 0
self.minimum = 10**9
pass
def __update(self, value):
self.total += value
self.minimum = min(self.minimum, value)
return value
def __iter__(self):
for value in self.it:
if value < 0:
self.num_negs += 1
yield self.__update(-value)
pass
else:
yield self.__update(value)
pass
pass
pass
def to_ans(self):
if self.num_negs % 2 == 1:
return self.total - 2 * self.minimum
else:
return self.total
pass
pass
myiter = MyIter(An)
Bn = list(myiter)
print((myiter.to_ans()))
| from itertools import *
N = int(eval(input()))
An = list(map(int, input().split()))
total = 0
minim = 1000000000
num_negs = 0
for a in An:
if a < 0:
num_negs += 1
a *= -1
pass
total += a
minim = min(minim, a)
pass
if num_negs % 2:
print((total - 2*minim))
else:
print(total)
pass
| p03062 |
from itertools import *
N = int(eval(input()))
An = list(map(int, input().split()))
total = 0
minim = 1000000000
num_negs = 0
for a in An:
if a < 0:
num_negs += 1
a *= -1
pass
total += a
minim = min(minim, a)
pass
if num_negs % 2:
print((total - 2*minim))
else:
print(total)
pass
|
N = int(eval(input()))
An = list(map(int, input().split()))
total = 0
minim = 1000000000
num_negs = 0
for a in An:
if a < 0:
num_negs += 1
a *= -1
pass
total += a
minim = minim if minim < a else a
pass
if num_negs % 2:
print((total - 2*minim))
else:
print(total)
pass
| p03062 |
n=eval(input())
a=list(map(int,input().split()))
n=sum(x<0 for x in a)
a=list([abs(x) for x in a])
s=sum(a) if n%2==0 else sum(a)-min(a)*2
print(s)
| n=eval(input())
a=list(map(int,input().split()))
n=sum(x<0 for x in a)
a=list(map(abs,a))
s=sum(a) if n%2==0 else sum(a)-min(a)*2
print(s)
| p03062 |
n = int(eval(input()))
a = list(map(int,input().split()))
minus_num = 0
for i in range(n):
if a[i] < 0:
minus_num += 1
if minus_num % 2 == 0:
ans = 0
for i in range(n):
ans += abs(a[i])
else:
min_abs = abs(a[0])
ans = 0
for i in range(n):
ans += abs(a[i])
min_abs = min(min_abs, abs(a[i]))
ans = ans - min_abs * 2
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
cnt = 0
for i in range(n):
if a[i] < 0:
cnt += 1
ans = 0
if cnt % 2 == 0:
for i in range(n):
ans += abs(a[i])
print(ans)
else:
tar = abs(a[0])
for i in range(n):
ans += abs(a[i])
if tar > abs(a[i]):
tar = abs(a[i])
print((ans-2*tar))
| p03062 |
import sys
sys.setrecursionlimit(10**5)
n = int(eval(input()))
a = list(map(int, input().split()))
# dp = [None]*(n+1)
#dp = [[None]*(n+1) for _ in range(2)]
dp = [[None]*(2) for _ in range(n+1)]
def solve(a):
if len(a) == 0:
return 0
elif len(a) == 1:
return a[0]
elif len(a) == 2:
v1 = a[0] + a[1]
v2 = -a[0] - a[1]
return max(v1, v2)
v1 = a[0] + solve(a[1:])
v2 = -a[0] + solve([-a[1]] + a[2:])
return max(v1, v2)
def solve(a, flg):
l = len(a)
if dp[l][flg] is not None:
return dp[l][flg]
if flg == 1:
a[0] = -a[0]
if l == 0:
dp[l][flg] = 0
elif l == 1:
dp[l][flg] = a[0]
elif l == 2:
v1 = a[0] + a[1]
v2 = -a[0] - a[1]
dp[l][flg] = max(v1, v2)
else:
v1 = a[0] + solve(a[1:], 0)
v2 = -a[0] + solve(a[1:], 1)
dp[l][flg] = max(v1, v2)
# if flg == 0:
# v1 = a[0] + solve(a[1:], flg)
# v2 = -a[0] + solve(a[1:], abs(flg - 1))
# dp[l][flg] = max(v1, v2)
# else:
# v1 = -a[0] + solve(a[1:], flg)
# v2 = a[0] + solve(a[1:], abs(flg - 1))
# dp[l][flg] = max(v1, v2)
return dp[l][flg]
#def solve(idx):
print((solve(a, 0)))
#print(solve(a, 1))
#print(solve(a, 0))
# v1 = solve(a, 1)
# v2 = solve(a, 0)
#
# print(v1, v2)
# print(max(v1, v2))
| import sys
sys.setrecursionlimit(10**5)
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[None]*(2) for _ in range(n+1)]
dp[n-1][0] = a[n-1]
dp[n-1][1] = -a[n-1]
for i in reversed(list(range(n-1))):
for j in range(2):
#print('\n# i: ' + str(i))
# Unexe
unexe_unexe = a[i] + dp[i+1][0]
exe_unexe = -a[i] + dp[i+1][1]
dp[i][0] = max(unexe_unexe, exe_unexe)
# Exe
unexe_exe = a[i] + dp[i+1][1]
exe_exe = -a[i] + dp[i+1][0]
dp[i][1] = max(unexe_exe, exe_exe)
#print(dp)
#print(max(dp[0][0], dp[0][1]))
print((dp[0][0]))
| p03062 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
dp = [(0, -1e10)] * (N + 1)
for i in range(N):
a = max(dp[i][0] + A[i], dp[i][1] - A[i])
b = max(dp[i][0] - A[i], dp[i][1] + A[i])
dp[i + 1] = (a, b)
print((dp[N][0])) | N = int(eval(input()))
A = [int(i) for i in input().split()]
a, b = 0, -1e10
for ai in A:
a, b = max(a + ai, b - ai), max(a - ai, b + ai)
print(a) | p03062 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
a, b = 0, -1e10
for ai in A:
a, b = max(a + ai, b - ai), max(a - ai, b + ai)
print(a) | N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [abs(a) for a in A]
if len([a for a in A if a < 0]) % 2 == 1:
print((sum(B) - 2 * min(B)))
else:
print((sum(B)))
| p03062 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
DP = [[None, None] for i in range(N)]
DP[0] = [A[0], -A[0]]
for i in range(1, N):
DP[i][0] = max(DP[i-1][0] + A[i], DP[i-1][1] - A[i])
DP[i][1] = max(DP[i-1][0] - A[i], DP[i-1][1] + A[i])
print((DP[N-1][0]))
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
DP = [[-10 ** 20] * 2 for _ in range(N)]
DP[0][0] = A[0]
DP[0][1] = -1 * A[0]
for i in range(1, N):
a = A[i]
DP[i][0] = max(max(DP[i-1][0] + a, DP[i-1][1] - a), DP[i][0])
DP[i][1] = max(max(DP[i-1][0] - a, DP[i-1][1] + a), DP[i][1])
print((DP[N-1][0]))
return 0
if __name__ == "__main__":
solve() | p03062 |
import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
DP = [[-10 ** 20] * 2 for _ in range(N)]
DP[0][0] = A[0]
DP[0][1] = -1 * A[0]
for i in range(1, N):
a = A[i]
DP[i][0] = max(max(DP[i-1][0] + a, DP[i-1][1] - a), DP[i][0])
DP[i][1] = max(max(DP[i-1][0] - a, DP[i-1][1] + a), DP[i][1])
print((DP[N-1][0]))
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
DP = [[-10 ** 20, -10 ** 20] for _ in range(N)] #[-1が偶数, -1が奇数]
DP[0] = [A[0], -1 * A[0]]
for i in range(1, N):
DP[i][0] = max(DP[i-1][0] + A[i], DP[i-1][1] - A[i])
DP[i][1] = max(DP[i-1][0] - A[i], DP[i-1][1] + A[i])
print((DP[N-1][0]))
#print(DP)
return 0
if __name__ == "__main__":
solve() | p03062 |
n = int(eval(input()))
a_list = [int(i) for i in input().split()]
minus_count_even_flug = True
zero_exist_flug = False
for a in a_list:
if a < 0:
minus_count_even_flug = not minus_count_even_flug
if a == 0:
zero_exist_flug = True
a_abs_list = [abs(a) for a in a_list]
sum_a_abs_list = sum(a_abs_list)
if minus_count_even_flug or zero_exist_flug:
print(sum_a_abs_list)
else:
print((sum_a_abs_list - 2 * min(a_abs_list))) | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(abs, A))
C = [a for a in A if a < 0]
if len(C) % 2 == 0:
print((sum(B)))
else:
print((sum(B) - min(B)*2)) | p03062 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
pm = [0,0]
for i in range(n):
if a[i] == 0:
print((sum(list(map(abs,a)))))
quit()
elif a[i] > 0:
pm[0] += 1
else:
pm[1] += 1
if pm[1] % 2 != 0:
print((sum(list(map(abs,a))) - 2 * min(list(map(abs,a)))))
else:
print((sum(list(map(abs,a))))) | import math
def main():
n = int(eval(input()))
# a, b, t = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
# h = [int(input()) for _ in rane(n)]
a = list(map(int, input().split()))
abs_a = []
minus = 0
for ai in a:
if ai < 0:
minus += 1
abs_a.append(abs(ai))
if minus % 2 == 0:
print((sum(abs_a)))
else:
mini = min(abs_a)
print((sum(abs_a) - 2*mini))
if __name__ == '__main__':
main()
| p03062 |
import sys
sys.setrecursionlimit(10**6)
def dp(i,is_reverse):
if i == 0:
if is_reverse == 0: return 0
else: return -float('inf')
else:
if is_reverse == 0: return max(dp(i-1,0)+A[i-1],dp(i-1,1)-A[i-1])
else: return max(dp(i-1,0)-A[i-1],dp(i-1,1)+A[i-1])
N = int(eval(input()))
A = list(map(int,input().split()))
print((dp(N,0))) | N = int(eval(input()))
A = list(map(int,input().split()))
neg_num = 0
min_abs_a = float('inf')
sum_abs_A = 0
include_zero = False
for a in A:
sum_abs_A += abs(a)
min_abs_a = min(abs(a),min_abs_a)
if a == 0: include_zero = True
if a < 0 : neg_num += 1
print((sum_abs_A if neg_num%2==0 or include_zero is True else sum_abs_A - 2*min_abs_a)) | p03062 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
count = 0
for i in range(n):
if a[i] < 0:
a[i] = -a[i]
count += 1
ans += a[i]
if count % 2 == 0:
print(ans)
else:
print((ans - min(a) * 2))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
for i in range(n):
if a[i] < 0:
a[i] = -a[i]
count += 1
ans = sum(a)
if count % 2 == 0:
print(ans)
else:
print((ans - min(a) * 2))
| p03062 |
import sys
sys.setrecursionlimit(10**6)
def dp(i, j):
if i == 0:
if j:
return -float('inf')
else:
return 0
if j:
return max(dp(i-1, False) - a[i-1], dp(i-1, True) + a[i-1])
else:
return max(dp(i-1, False) + a[i-1], dp(i-1, True) - a[i-1])
n = int(eval(input()))
a = list(map(int, input().split()))
print((dp(n, False))) | n = int(eval(input()))
a = list(map(int, input().split()))
dp = {}
dp[0,0] = 0
dp[0,1] = -float('inf')
for i in range(1, n+1):
dp[i, 0] = max(dp[i-1, 0] + a[i-1], dp[i-1, 1] - a[i-1])
dp[i, 1] = max(dp[i-1, 0] - a[i-1], dp[i-1, 1] + a[i-1])
print((dp[n, 0])) | p03062 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = 0
ans = 0
for i in range(n):
if a[i] < 0:
b += 1
a[i] = abs(a[i])
if (0 in a) or ((b % 2) == 0):
pass
else:
ans -= min(a) * 2
ans += sum(a)
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *a = list(map(int, read().split()))
cnt = 0
for i, aa in enumerate(a):
if aa < 0:
a[i] = -aa
cnt += 1
if cnt % 2 == 0:
print((sum(a)))
else:
print((sum(a) - min(a) * 2))
| p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[0] * 2 for i in range(N)]
dp[0][0] = A[0] + A[1]
dp[0][1] = -A[0] - A[1]
for i in range(1, N - 1):
for j in range(2):
if j == 0:
dp[i][j] = max(dp[i-1][0] + A[i+1], dp[i-1][1] + A[i+1])
else:
dp[i][j] = max(dp[i-1][0] - 2 * A[i] - A[i+1], dp[i-1][1] + 2 * A[i] - A[i+1])
print((max(dp[N-2]))) | N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[0] * 2 for i in range(N+1)]
dp[0][1] = - 10 ** 18
for i in range(N):
for j in range(2):
if j == 0:
dp[i+1][j] = max(dp[i][0] + A[i], dp[i][1] - A[i])
else:
dp[i+1][j] = max(dp[i][0] - A[i], dp[i][1] + A[i])
print((dp[N][0])) | p03062 |
import sys
sys.setrecursionlimit(10 ** 6)
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
def dp(i, j):
if i == 0 and j == 0:
return 0
if i == 0 and j == 1:
return -float('inf')
if j == 0:
return max(dp(i - 1, 0) + a[i - 1], dp(i - 1, 1) - a[i - 1])
if j == 1:
return max(dp(i - 1, 0) - a[i - 1], dp(i - 1, 1) + a[i - 1])
score = dp(n, 0)
print(score)
main()
| def main():
n = int(eval(input()))
aa = list(map(int, input().split()))
pos = [0] * n
neg = [0] * n
pos[0] = aa[0]
neg[0] = -aa[0]
for i, a in enumerate(aa[1:-1], start=1):
pos[i] = max(pos[i - 1] + a, neg[i - 1] - a)
neg[i] = max(pos[i - 1] - a, neg[i - 1] + a)
pos[n - 1] = pos[n - 2] + aa[n - 1]
neg[n - 1] = neg[n - 2] - aa[n - 1]
score = max(pos[n - 1], neg[n - 1])
print(score)
main() | p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[0,0] for i in range(N+1)]
dp[0][1] = -10**20
for i in range(N):
dp[i+1][0] = max(dp[i][0] + A[i], dp[i][1] - A[i])
dp[i+1][1] = max(dp[i][0] - A[i], dp[i][1] + A[i])
print((dp[-1][0]))
| N = int(eval(input()))
A = list(map(int, input().split()))
dp = [0, -10**20]
tmp = [0, 0]
for i in range(N):
tmp[0] = max(dp[0] + A[i], dp[1] - A[i])
tmp[1] = max(dp[0] - A[i], dp[1] + A[i])
dp[0], dp[1] = tmp[0], tmp[1]
print((dp[0])) | p03062 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * 2 for i in range(n + 1)]
# dp[i + 1][j] := i 番目までの最大値（j = 1 なら a[i] の符号反転）
dp[0][1] = -float("inf")
for i in range(n):
dp[i + 1][0] = max(dp[i][0] + a[i], dp[i][1] - a[i])
dp[i + 1][1] = max(dp[i][0] - a[i], dp[i][1] + a[i])
print((dp[n][0])) | n = int(eval(input()))
a = list(map(int, input().split()))
b = []
count = 0
for i in a:
if i < 0:
count += 1
b.append(abs(i))
if count % 2:
print((sum(b) - 2 * min(b)))
else:
print((sum(b))) | p03062 |
n = int(eval(input()))
a = list(map(int,input().split()))
ma = []
pa = []
l =[]
t = 0
k = 0
for i in a:
if i < 0:
ma.append(i)
l.append(i*-1)
k+=1
elif i> 0:
pa.append(i)
l.append(i)
else:
t = 1
s = sum(l)
print((s if t == 1 or k%2==0 else s - 2*min(l))) | #写経
n=eval(input())
a=list(map(int,input().split()))
b=[abs(x)for x in a]
#sum(x<0 for x in a)%2 ここで負の値の個数数えてるのが！
print((sum(b)-2*min(b)if sum(x<0 for x in a)%2 else sum(b))) | p03062 |
# -*- coding: utf-8 -*-
from functools import reduce
n = int(eval(input()))
alist = list(map(int, input().split()))
def isMinus(x):
if x<0:
return 1
else:
return 0
#signature count
s = sum([isMinus(i) for i in alist]) % 2
# print(alist)\\
if s == 0:
ans = sum(map(abs, alist))
else:
ans = sum(map(abs, alist)) - min(list(map(abs, alist)))*2
print(("{}".format(ans))) | n = int(eval(input()))
A = list(map(int, input().split()))
absA = [abs(a) for a in A]
if sum(True if a < 0 else False for a in A) % 2 == 0:
ans = sum(absA)
else:
ans = sum(absA) - 2 * min(absA)
print(ans) | p03062 |
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
count = 0
for i in range(n):
if a_list[i] < 0:
a_list[i] *= -1
count += 1
ans = sum(a_list)
if count % 2 == 1:
a_list.sort()
ans -= a_list[0] * 2
print(ans) | n = int(eval(input()))
a_list = [int(x) for x in input().split()]
count = 0
ans = 0
m = 10 ** 9
for i in range(n):
if a_list[i] < 0:
a_list[i] *= -1
count += 1
ans += a_list[i]
if a_list[i] < m:
m = a_list[i]
if count % 2 == 1:
ans -= m * 2
print(ans) | p03062 |
N=int(eval(input()))
LA=list(map(int,input().split()))
p_m=1
for n in range(N):
p_m*=LA[n]
LA_absolute=[i*(-1) if i<0 else i for i in LA]
if p_m>=0:
print((sum(LA_absolute)))
else:
print((sum(LA_absolute)-2*min(LA_absolute))) | N=int(eval(input()))
LA=list(map(int,input().split()))
Minus=0
Zero=0
L_absolute=[]
for i in LA:
if i<0:
L_absolute.append(i*(-1))
Minus+=1
elif i==0:
Zero=1
else:
L_absolute.append(i)
L_absolute.sort()
if Zero==1:
ans=sum(L_absolute)
elif Minus%2==1:
ans=sum(L_absolute)-2*L_absolute[0]
else:
ans=sum(L_absolute)
print(ans) | p03062 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
negatives = 0
zeros = 0
min_abs = 10**9 + 1
for a in A:
if a < 0:
negatives += 1
if a == zeros:
zeros += 1
min_abs = min(min_abs, abs(a))
ans = sum(map(abs, A))
if negatives % 2 == 0 or zeros != 0:
print(ans)
return
ans -= 2*min_abs
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
negatives = 0
zeros = 0
min_abs = 10**9 + 1
for a in A:
if a < 0:
negatives += 1
if a == 0:
zeros += 1
min_abs = min(min_abs, abs(a))
ans = sum(map(abs, A))
if negatives % 2 == 0 or zeros != 0:
print(ans)
return
ans -= 2*min_abs
print(ans)
if __name__ == '__main__':
main()
| p03062 |
import itertools
N = int(eval(input()))
A = list(map(int, input().split()))
pat = []
for i in range(N-1):
pat.extend(itertools.combinations([i for i in range(N-1)],i+1))
B = A.copy()
B_list = [A.copy()]
for j in pat:
for i in j:
A[i:i+2] = [i * (-1) for i in A[i:i+2]]
B_list.append(A)
A = B.copy()
total = 0
for i in B_list:
if total < sum(i):
total = sum(i)
print(total) | N = int(eval(input()))
A = list(map(int, input().split()))
A_tmp = sorted(A, key=abs, reverse=True,)
total = 0
for i,v in enumerate(A_tmp):
if (v <= 0) and (i < len(A_tmp)-1):
A_tmp[i] = (-1) * A_tmp[i]
A_tmp[i+1] = (-1) * A_tmp[i+1]
total += A_tmp[i]
else:
total += v
print(total) | p03062 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = [abs(i) for i in a]
if (sum([i < 0 for i in a]) + sum([i == 0 for i in a])) % 2 == 0:
print((sum(b)))
else:
print((sum(b) - min(b) * 2)) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [abs(i) for i in a]
if sum([i <= 0 for i in a]) % 2 == 0:
print((sum(b)))
else:
print((sum(b) - min(b) * 2)) | p03062 |
N = int(eval(input()))
A = list(map(int,input().split()))
#偶数個しか正負反転できない
#小さい順に並べてマイナスは全部、境界は判定
S = sorted([[i,A[i]] for i in range(N)],key=lambda x: x[1])
judge = [False]*N
for j in range(0,N-1,2):
if S[j][1]+S[j+1][1]<0:
judge[S[j][0]] = True
judge[S[j+1][0]] = True
for i in range(N-1):
if judge[i]:
A[i] *= -1
A[i+1] *= -1
judge[i+1] ^= True
print((sum(A))) | N = int(eval(input()))
A = list(map(int,input().split()))
#アルゴリズム（動的計画法）で殴る解法
INF = float("inf")
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = -INF
for i in range(N):
dp[i+1][0] = max(dp[i][0]+A[i],dp[i][1]-A[i])
dp[i+1][1] = max(dp[i][0]-A[i],dp[i][1]+A[i])
print((dp[N][0])) | p03062 |
N=int(eval(input()))
A=list(map(int,input().split()))
n=0
sm=0
if A[0]>0:
mn=A[0]
else:
mn=(-1)*A[0]
for i in range(0,N):
if A[i]<0:
n=n+1
AA=A.pop(i)
A.insert(i,(-1)*AA)
sm=sm+AA*(-1)
if (-1)*AA<mn:
mn=(-1)*AA
else:
sm=sm+A[i]
if A[i]<mn:
mn=A[i]
if n%2==0:
print(sm)
else:
print((sm-2*mn)) | N=int(eval(input()))
A=list(map(int,input().split()))
n=0
sm=0
if A[0]>0:
mn=A[0]
else:
mn=(-1)*A[0]
for i in range(0,N):
if A[i]<0:
n=n+1
sm=sm-A[i]
if (-1)*A[i]<mn:
mn=(-1)*A[i]
else:
sm=sm+A[i]
if A[i]<mn:
mn=A[i]
if n%2==0:
print(sm)
else:
print((sm-2*mn)) | p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
absa = [abs(a) for a in A]
m = 0
for a in A:
if a < 0:
m += 1
if m % 2 == 0:
print((sum(absa)))
else:
print((sum(absa) - min(absa)*2)) | N = int(eval(input()))
A = list(map(int, input().split()))
minus = 0
for i in range(N):
if A[i] < 0:
minus += 1
absed = sorted([abs(a) for a in A])
if minus % 2 == 0:
print((sum(absed)))
else:
print((sum(absed) - absed[0]*2))
| p03062 |
N = int(eval(input()))
A = list(map(int,input().split(' ')))
sum = 0
min = 1000000000
minus = 0
for n in range(N):
n_abs = abs(A[n])
sum += n_abs
if min > n_abs:
min = n_abs
if A[n] < 0:
minus += 1
if minus%2 != 0:
sum -= 2*min
print(sum) | N = int(eval(input()))
A = list(map(int,input().split(' ')))
ABS_LIST = list(map(abs,A))
ABS_SUM = sum(ABS_LIST)
if len([x for x in A if x < 0])%2 != 0:
print((ABS_SUM-min(ABS_LIST)*2))
else:
print(ABS_SUM) | p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
Amin = 10**9
ans = 0
counter = 0
for i in range(N):
if(A[i] < 0):
counter = counter + 1
a = abs(A[i])
ans += a
Amin = min(a, Amin)
if(counter%2 == 1):
ans -= 2*Amin
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
neg_A = len(list([x for x in A if x < 0]))
A = sorted(map(abs, A))
if neg_A%2 == 0:
print((sum(A)))
else:
print((sum(A)-2*A[0]))
| p03062 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10000000)
N = int(eval(input()))
A = list(map(int, input().split()))
@lru_cache(maxsize=None)
def rec(i, reverse):
if i == N - 1:
return A[i] * reverse
num_normal = rec(i + 1, 1) + (A[i] * reverse)
num_reverse = rec(i + 1, -1) + (-1 * A[i] * reverse)
return max(num_normal, num_reverse)
print((rec(0, 1)))
| N = int(eval(input()))
A = list(map(int, input().split()))
minus_count = 0
for a in A:
if a < 0:
minus_count += 1
total = 0
min_num = 10 ** 9
for a in A:
total += abs(a)
min_num = min(min_num, abs(a))
if minus_count % 2 == 1:
total -= 2 * min_num
print(total)
| p03062 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
minus = 0
q = abs(a[0])
for i in a:
ans += abs(i)
q = min(q,abs(i))
if i < 0:
minus += 1
if minus%2 == 0:
print(ans)
else:
print((ans - 2*q)) | n = int(eval(input()))
a = list(map(int,input().split()))
minus = 0
mi = 10**10
ans = 0
for i in range(n):
if a[i] < 0:minus+=1
mi = min(mi,abs(a[i]))
ans += abs(a[i])
if minus%2 == 0:
print(ans)
else:
print((ans-2*mi)) | p03062 |
n=int(eval(input()))
a=list(map(int,input().split()))
minabs=10**9+1
minus=0
allsum=0
for i in a:
if i<0:
minus+=1
minabs=min(minabs,abs(i))
allsum+=abs(i)
if minus%2==1:
allsum-=minabs*2
print(allsum) | # 0が一つでもあれば、すべて正の数にできる
# そうでない場合、負の数の数が奇数の場合、負の数を一つ（最も絶対値が小さい）だけ残す
import sys
readline = sys.stdin.readline
N = int(readline())
A = list(map(int,readline().split()))
ans = 0
minabs = 10 ** 9 + 1
haszero = False
minuscnt = 0
for i in range(len(A)):
if A[i] == 0:
haszero = True
elif A[i] < 0:
minuscnt += 1
ans += abs(A[i])
if abs(A[i]) < minabs:
minabs = abs(A[i])
if haszero:
print(ans)
elif minuscnt % 2 == 1:
print((ans - minabs * 2))
else:
print(ans) | p03062 |
n,*a=list(map(int,open(0).read().split()))
b=sum([i<0 for i in a])%2
a=[abs(i) for i in a]
print((sum(a) if b==0 or 0 in a else sum(a)-min(a)*2)) | n,*a=list(map(int,open(0).read().split()))
b=sum(i<0 for i in a)%2
a=list(map(abs,a))
print((sum(a)-min(a)*2*b)) | p03062 |
import math
import re
n = int(input())
a = input().split()
cnt = 0
minus = 0
b = []
for i in a:
a[cnt] = int(i)
b.append(abs(int(i)))
if a[cnt] < 0:
minus += 1
cnt += 1
if minus % 2 != 0:
mini = min(b)
else:
mini = 0
total = 0
for i in b:
total += abs(i)
total -= 2 * abs(mini)
print(total) | # coding:utf-8
import math
def main(n,a):
n = int(n)
a = a.split()
cnt = 0
minus = 0
b = []
for i in a:
a[cnt] = int(i)
b.append(abs(int(i)))
if a[cnt] < 0:
minus += 1
cnt += 1
if minus % 2 != 0:
mini = min(b)
else:
mini = 0
total = 0
for i in b:
total += abs(i)
total -= 2 * abs(mini)
print(total)
return total
if __name__ == "__main__":
n = input()
a = input()
main(n,a) | p03062 |
N=int(eval(input()))
A=list(map(int,input().split()))
cnt=0
S=0
mi=10000000000
C0=False
for i in range(N):
mi=min(mi,abs(A[i]))
if A[i]>0:
S+=A[i]
elif A[i]==0:
C0==True
elif A[i]<0:
cnt+=1
S+=(-A[i])
if cnt%2==0 or C0==True:
print(S)
else:
print((S-mi*2))
| N=int(eval(input()))
A=list(map(int,input().split()))
mi=10**9+1
S=0
cnt=0
for i in range(N):
if A[i]<0:
cnt+=1
a=abs(A[i])
S+=a
mi=min(mi,a)
if cnt%2==0:
ans=S
else:
ans=S-2*mi
print(ans) | p03062 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = sum(A)
for i in range(N):
if A[i] < 0:
if i != N-1:
A[i] = A[i] * -1
A[i+1] = A[i+1] * -1
ans = max(ans, sum(A))
print(ans)
| N = int(eval(input()))
A = [int(i) for i in input().split()]
count = 0
for i in range(N):
if A[i] <0:
count = count + 1
A[i] = A[i] * -1
if 0 in A:
ans = sum(A)
else:
if count%2 == 0:
ans = sum(A)
else:
ans = sum(A) - 2*min(A)
print(ans)
| p03062 |
import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
heapq.heapify(A)
while True:
m = heapq.heappop(A)
n = heapq.heappop(A)
if m + n > 0:
heapq.heappush(A, m)
heapq.heappush(A, n)
break
else:
heapq.heappush(A, -m)
heapq.heappush(A, -n)
print((sum(A))) | import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
heapq.heapify(A)
while True:
m = heapq.heappop(A)
n = heapq.heappop(A)
if m + n >= 0:
heapq.heappush(A, m)
heapq.heappush(A, n)
break
else:
heapq.heappush(A, -m)
heapq.heappush(A, -n)
print((sum(A))) | p03062 |
import bisect
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=10**9+7
if len(set(a))!=len(a) or len(set(b))!=len(b):
print((0))
else:
a.sort()
b.sort()
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
if m*n in a and m*n in b:
L[a.index(m*n)][b.index(m*n)]=m*n
ct=1
ctn=1
ctm=1
for k in range(m*n-1,0,-1):
if k in a and k in b:
L[bisect.bisect_left(a,k)][bisect.bisect_left(b,k)]=k
ct*=1
ctn+=1
ctm+=1
elif k in a or k in b:
if k in a:
ct*=ctm
ctn+=1
if k in b:
ct*=ctn
ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%x
print(ct)
else:
print((0)) | import bisect
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=10**9+7
if len(set(a))!=len(a) or len(set(b))!=len(b):
print((0))
else:
a.sort()
b.sort()
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
if m*n in a and m*n in b:
L[a.index(m*n)][b.index(m*n)]=m*n
ct=1
ctn=1
ctm=1
A=set(a)
B=set(b)
for k in range(m*n-1,0,-1):
if k in A and k in B:
L[bisect.bisect_left(a,k)][bisect.bisect_left(b,k)]=k
ct*=1
ctn+=1
ctm+=1
elif k in A:
ct*=ctm
ctn+=1
elif k in B:
ct*=ctn
ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%x
print(ct)
else:
print((0)) | p03152 |
import bisect
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=10**9+7
if len(set(a))!=len(a) or len(set(b))!=len(b):
print((0))
else:
a.sort()
b.sort()
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
ct=1;ctn=0;ctm=0
A=set(a);B=set(b)
for k in range(m*n,0,-1):
if k in A and k in B:
L[bisect.bisect_left(a,k)][bisect.bisect_left(b,k)]=k
ctn+=1;ctm+=1
elif k in A:
ct*=ctm
ctn+=1
elif k in B:
ct*=ctn
ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%x
print(ct) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=10**9+7
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
ct=1;ctn=0;ctm=0
for k in range(m*n,0,-1):
if k in A and k in B:
L[n-ctn-1][m-ctm-1]=k
ctn+=1;ctm+=1
elif k in A:
ct*=ctm
ctn+=1
elif k in B:
ct*=ctn
ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%x
print(ct) | p03152 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
ct=1;ctn=0;ctm=0
for k in range(m*n,0,-1):
if k in A and k in B:
L[n-ctn-1][m-ctm-1]=k
ctn+=1;ctm+=1
elif k in A:
ct*=ctm;ctn+=1
elif k in B:
ct*=ctn;ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%(10**9+7)
print(ct) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
L=[]
l=[0 for j in range(m)]
for i in range(n):
L.append(l)
ct=1;ctn=0;ctm=0
for k in range(m*n,0,-1):
if k in A and k in B:
L[n-ctn-1][m-ctm-1]=k
ctn+=1;ctm+=1
elif k in A:
ct*=ctm;ctn+=1
elif k in B:
ct*=ctn;ctm+=1
else:
ct*=(ctm*ctn-m*n+k)
if ct==0:
break
ct=ct%(10**9+7)
print(ct) | p03152 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
L=[[0 for j in range(m)] for i in range(n)]
c=1;cn=0;cm=0
for k in range(m*n,0,-1):
if k in A and k in B:
L[n-cn-1][m-cm-1]=k
cn+=1;cm+=1
elif k in A:
c*=cm;cn+=1
elif k in B:
c*=cn;cm+=1
else:
c*=(cm*cn-m*n+k)
if c==0:
break
c=c%(10**9+7)
print(c) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
c=1;cn=0;cm=0
for k in range(m*n,0,-1):
if k in A and k in B:
cn+=1;cm+=1
elif k in A:
c*=cm;cn+=1
elif k in B:
c*=cn;cm+=1
else:
c*=(cm*cn-m*n+k)
if c==0:
break
c=c%(10**9+7)
print(c) | p03152 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
c=1;cn=0;cm=0
for k in range(m*n,0,-1):
if k in A and k in B:
cn+=1;cm+=1
elif k in A:
c*=cm;cn+=1
elif k in B:
c*=cn;cm+=1
else:
c*=(cm*cn-m*n+k)
if c==0:
break
c=c%(10**9+7)
print(c) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print((0))
else:
c=1;cn=0;cm=0
for k in range(m*n,0,-1):
if k in A and k in B:
cn+=1;cm+=1
elif k in A:
c*=cm;cn+=1
elif k in B:
c*=cn;cm+=1
else:
c*=cm*cn-m*n+k
c=c%(10**9+7)
print(c) | p03152 |
n,m=list(map(int,input().split()))
a=set(map(int,input().split()))
b=set(map(int,input().split()))
c=1;N=0;M=0
for k in range(m*n,0,-1):
if k in a and k in b:
N+=1;M+=1
elif k in a:
c*=M;N+=1
elif k in b:
c*=N;M+=1
else:
c*=M*N-m*n+k
c=c%(10**9+7)
print(c) | n,m=list(map(int,input().split()))
a=set(map(int,input().split()))
b=set(map(int,input().split()))
c=1;N=0;M=0
for k in range(m*n,0,-1):
if k in a and k in b:
N+=1;M+=1
elif k in a:
c*=M;N+=1
elif k in b:
c*=N;M+=1
else:
c*=M*N-m*n+k
c%=10**9+7
print(c) | p03152 |
n,m=list(map(int,input().split()))
a,b=set(map(int,input().split())),set(map(int,input().split()))
c=1;N=M=0
for k in range(m*n,0,-1):
if k in a and k in b:
N+=1;M+=1
elif k in a:
c*=M;N+=1
elif k in b:
c*=N;M+=1
else:
c*=M*N-m*n+k
print((c%(10**9+7))) | n,m=list(map(int,input().split()))
a,b=set(map(int,input().split())),set(map(int,input().split()))
c=1;N=M=0
for k in range(m*n,0,-1):
A=k in a;B=k in b
if A and B:N+=1;M+=1
elif A:c*=M;N+=1
elif B:c*=N;M+=1
else:c*=M*N-m*n+k
c%=10**9+7
print(c) | p03152 |
s,a,b=[set(map(int,input().split()))for j in[0]*3];c=1;N=M=0;x=max(a)
for k in range(x,0,-1):
A=k in a;B=k in b
if A and B:M+=1;N+=1
elif A:c*=M;N+=1
elif B:c*=N;M+=1
else:c*=M*N-x+k
c%=10**9+7
print(c) | s,a,b=[set(map(int,input().split()))for j in[0]*3];c=1;N=M=0;k=x=max(a)
while k:A=k in a;B=k in b;N+=A;M+=B;c*=[M*N-x+k,N,M,1][A*2+B];c%=10**9+7;k-=1
print(c) | p03152 |
import sys
input = sys.stdin.readline
from collections import *
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sa = set(A)
sb = set(B)
row, col = 0, 0
ans = 1
MOD = 10**9+7
for i in range(N*M, 0, -1):
if (i in sa) and (i in sb):
row += 1
col += 1
elif (i not in sa) and (i in sb):
ans *= col
row += 1
elif (i in sa) and (i not in sb):
ans *= row
col += 1
else:
ans *= row*col-(N*M-i)
ans %= MOD
print(ans) | import sys
input = sys.stdin.readline
from collections import *
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sa = set(A)
sb = set(B)
row, col = 0, 0
ans = 1
MOD = 10**9+7
for i in range(N*M, 0, -1):
if (i in sa) and (i in sb):
row += 1
col += 1
elif (i not in sa) and (i in sb):
ans *= row
col += 1
elif (i in sa) and (i not in sb):
ans *= col
row += 1
else:
ans *= row*col-(N*M-i)
ans %= MOD
print(ans)
| p03152 |
from bisect import bisect
import sys
p = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if n != len(set(a)) or m!= len(set(b)):
print((0))
sys.exit()
a.sort()
b.sort()
q = 1
for x in range(n*m, 0, -1):
if x in a and x in b:
q *= 1
elif x in a:
q = q * max(m - bisect(b, x), 0) % p
elif x in b:
q = q * max(n - bisect(a, x), 0) % p
else:
u = bisect(a, x)
v = bisect(b, x)
q = q * (max((n-u) * (m-v) - (n * m - x), 0) % p) % p
print(q)
| from bisect import bisect
import sys
p = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if n != len(set(a)) or m!= len(set(b)):
print((0))
sys.exit()
A = set(a)
B = set(b)
a.sort()
b.sort()
q = 1
for x in range(n*m, 0, -1):
if x in A and x in B:
q *= 1
elif x in A:
q = q * max(m - bisect(b, x), 0) % p
elif x in B:
q = q * max(n - bisect(a, x), 0) % p
else:
u = bisect(a, x)
v = bisect(b, x)
q = q * (max((n-u) * (m-v) - (n * m - x), 0) % p) % p
print(q)
| p03152 |
import sys
N, M = list(map(int, input().split()))
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
if len(set(A))!=len(A) or len(set(B))!=len(B):
print((0))
sys.exit()
ans = 1
rows, columna = 0,0
mod = 10**9+7
for x in range(N*M, 0, -1):
if x in A and x in B:
rows += 1
columna += 1
elif x in A and not x in B:
rows += 1
ans = ans * (columna)
elif x in B and not x in A:
columna += 1
ans = ans *(rows)
else:
ans = ans * (rows * columna -(N*M-x))
ans %= mod
print((ans%(10**9+7)))
| def solve():
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = set(map(int, input().split()))
B = set(map(int, input().split()))
row, columun = 0, 0
ans = 1
for i in range(N * M, 0, -1):
in_A = i in A
in_B = i in B
if in_A and in_B:
row += 1
columun += 1
elif in_A:
row += 1
ans *= columun
elif in_B:
columun += 1
ans *= row
else:
ans *= row * columun - (N * M - i)
ans %= MOD
print(ans)
if __name__ == '__main__':
solve()
| p03152 |
def sole():
import sys
N, M = list(map(int, input().split()))
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]
if len(set(A))!=len(A) or len(set(B))!=len(B):
print((0))
sys.exit()
ans = 1
rows, columna = 0,0
mod = 10**9+7
for x in range(N*M, 0, -1):
if x in A and x in B:
rows += 1
columna += 1
elif x in A and not x in B:
rows += 1
ans = ans * (columna)
elif x in B and not x in A:
columna += 1
ans = ans *(rows)
else:
ans = ans * (rows * columna -(N*M-x))
ans %= mod
print((ans%(10**9+7)))
if __name__ == '__main__':
sole()
| def solve():
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = set(map(int, input().split()))
B = set(map(int, input().split()))
row, columun = 0, 0
ans = 1
for i in range(N * M, 0, -1):
in_A = i in A
in_B = i in B
if in_A and in_B:
row += 1
columun += 1
elif in_A:
row += 1
ans *= columun
elif in_B:
columun += 1
ans *= row
else:
ans *= row * columun - (N * M - i)
ans %= MOD
print(ans)
if __name__ == '__main__':
solve()
| p03152 |
mod = 10**9+7
n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
if len(a) != len(set(a)) or len(b) != len(set(b)):
print((0))
exit()
c = 1
N = 0
M = 0
for k in range(n*m, 0, -1):
if k in a and k in b:
N += 1
M += 1
elif k in a:
c *= M
N += 1
elif k in b:
c *= N
M += 1
else:
c *= M*N - (m*n-k)
c %= mod
print(c)
| mod = 10**9+7
n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
if len(a) != len(set(a)) or len(b) != len(set(b)):
print((0))
exit()
a = set(a)
b = set(b)
c = 1
N = 0
M = 0
for k in range(n*m, 0, -1):
if k in a and k in b:
N += 1
M += 1
elif k in a:
c *= M
N += 1
elif k in b:
c *= N
M += 1
else:
c *= M*N - (m*n-k)
c %= mod
print(c)
| p03152 |
MOD = int(1e9) + 7
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sortA = sorted(A)
sortB = sorted(B)
for i in range(1, N):
if sortA[i] == sortA[i-1]:
print((0))
return
for j in range(1, M):
if sortB[j] == sortB[j-1]:
print((0))
return
retval = 1
for num in range(N*M, 0, -1):
icandidates = 0
jcandidates = 0
just = 1
for i in range(N):
if num == A[i]:
icandidates = 1
just = 0
break
if num <= A[i]:
icandidates += 1
for j in range(M):
if num == B[j]:
jcandidates = 1
just = 0
break
if num <= B[j]:
jcandidates += 1
retval *= icandidates * jcandidates - (N*M - num) * just
retval %= MOD
print(retval)
if __name__ == "__main__":
main()
| MOD = int(1e9) + 7
def binsearch(num, ary):
left = 0
right = len(ary)
while left < right:
center = (left + right) // 2
if num <= ary[center]:
left = center + 1
else:
right = center
return left
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sortA = sorted(A, reverse=True)
sortB = sorted(B, reverse=True)
for i in range(1, N):
if sortA[i] == sortA[i-1]:
print((0))
return
for j in range(1, M):
if sortB[j] == sortB[j-1]:
print((0))
return
retval = 1
for num in range(N*M, 0, -1):
just = 1
icandidates = binsearch(num, sortA)
jcandidates = binsearch(num, sortB)
if icandidates >= 1 and sortA[icandidates-1] == num:
icandidates = 1
just = 0
if jcandidates >= 1 and sortB[jcandidates-1] == num:
jcandidates = 1
just = 0
# print(icandidates, jcandidates, sortA, num)
retval *= icandidates * jcandidates - (N*M - num) * just
retval %= MOD
print(retval)
if __name__ == "__main__":
main()
| p03152 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 早期終了
if len(set(A)) != len(A):
print((0))
exit()
if len(set(B)) != len(B):
print((0))
exit()
# 高速化のため事前ソート
# A.sort(reverse=True)結局使わなかった
# B.sort(reverse=True)
n_A, n_B = 0, 0 # ある数よりも大きい要素数(単調増加)
# この問題は場合分けを思いつけるか、計算量を減らせるかにかかっている
# 与えられた集合の中にxょり大きい要素がいくつあるかという処理に大きく時間がかかっている
# これをn_Aとおくと、n_Aには単調増加性があることがすぐにわかる
# xをどんどん小さくしているからである。
# n_Aを逐一計算する代わりに、いままでの情報を使ってn_Aを求められると処理が高速化される
# A=[182, 181, 180, 179, 178, 176, 175, 169, 168, 167, 158, 151, 147, 129]とする(sorted)とすると、
# A[n_A]=xとなるn_Aがほしい。xが登場するまでのイテレーションでx_pre in Aとなる要素があるたび、その回数をカウントすればよい
#
def ret_n_given_x(x):
global n_A, n_B
flgA = True if x in A else False
flgB = True if x in B else False
# print(flgA, flgB)
if flgA and flgB:
n_A += 1 # 上記で解説した個数カウント
n_B += 1 # xより大きな要素が何個あったかついでに記録できる
return 1
elif flgA:
n_A += 1
return n_B
elif flgB:
n_B += 1
return n_A
else:
return (n_A * n_B)-(N*M-x)
MOD = 10**9 + 7
ans = 1
for x in range(N * M, 0, -1):
ans *= ret_n_given_x(x)
ans %= MOD
# print(x, ans, ret_n_given_x(x))
if ans == 0:
break
print((int(ans)))
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 早期終了
if len(set(A)) != len(A):
print((0))
exit()
if len(set(B)) != len(B):
print((0))
exit()
# 高速化のため事前ソート
A.sort(reverse=True)
B.sort(reverse=True)
n_A, n_B = 0, 0 # ある数よりも大きい要素数(単調増加)
# この問題は場合分けを思いつけるか、計算量を減らせるかにかかっている
# 与えられた集合の中にxょり大きい要素がいくつあるかという処理に大きく時間がかかっている
# これをn_Aとおくと、n_Aには単調増加性があることがすぐにわかる
# xをどんどん小さくしているからである。
# n_Aを逐一計算する代わりに、いままでの情報を使ってn_Aを求められると処理が高速化される
# A=[182, 181, 180, 179, 178, 176, 175, 169, 168, 167, 158, 151, 147, 129]とする(sorted)とすると、
# A[n_A]=xとなるn_Aがほしい。xが登場するまでのイテレーションでx_pre in Aとなる要素があるたび、その回数をカウントすればよい
#
def ret_n_given_x(x):
global n_A, n_B
flgA = False
flgB = False
for a in A[n_A:]:
if a == x:
flgA = True
break
for a in B[n_B:]:
if a == x:
flgB = True
break
if flgA and flgB:
n_A += 1 # 上記で解説した個数カウント
n_B += 1 # xより大きな要素が何個あったかついでに記録できる
return 1
elif flgA:
n_A += 1
return n_B
elif flgB:
n_B += 1
return n_A
else:
return (n_A * n_B)-(N*M-x)
MOD = 10**9 + 7
ans = 1
for x in range(N * M, 0, -1):
ans *= ret_n_given_x(x)
ans %= MOD
# print(x, ans, ret_n_given_x(x))
if ans == 0:
break
print((int(ans)))
| p03152 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 10**9+7
SA = set(A)
SB = set(B)
A.sort()
B.sort()
if len(SA) != len(A) or len(SB) != len(B):
print((0))
exit()
ans = 1
import bisect
for i in reversed(list(range(1, n*m+1))):
if i in SA and i in SB:
ans *= 1
elif i in SA:
j = bisect.bisect_left(B, i)
ans *= m-j
elif i in SB:
j = bisect.bisect_left(A, i)
ans *= n-j
else:
j = bisect.bisect_left(A, i)
k = bisect.bisect_left(B, i)
ans *= (n-j)*(m-k) - (n*m-i)
ans %= mod
print(ans) | n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.sort()
B.sort()
SA = set(A)
SB = set(B)
if len(A) != len(SA):
print((0))
exit()
if len(B) != len(SB):
print((0))
exit()
ans = 1
mod = 10**9+7
import bisect
for i in reversed(list(range(1, n*m+1))):
if i in SA and i in SB:
ans *= 1
elif i in SA and i not in SB:
k = bisect.bisect_left(B, i)
ans *= m-k
ans %= mod
elif i not in SA and i in SB:
j = bisect.bisect_left(A, i)
ans *= n-j
ans %= mod
else:
j = bisect.bisect_left(A, i)
k = bisect.bisect_left(B, i)
ans *= (n-j)*(m-k)-(n*m-i)
ans %= mod
#print(ans)
print((ans%mod))
| p03152 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.