結果
問題 | No.3015 右に寄せろ! |
ユーザー | lif4635 |
提出日時 | 2025-01-25 12:59:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 161 ms / 2,000 ms |
コード長 | 2,586 bytes |
コンパイル時間 | 192 ms |
コンパイル使用メモリ | 82,408 KB |
実行使用メモリ | 137,112 KB |
最終ジャッジ日時 | 2025-01-25 22:29:53 |
合計ジャッジ時間 | 3,606 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge7 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
# inputimport sysinput = sys.stdin.readlineII = lambda : int(input())MI = lambda : map(int, input().split())LI = lambda : list(map(int, input().split()))SI = lambda : input().rstrip()LLI = lambda n : [list(map(int, input().split())) for _ in range(n)]LSI = lambda n : [input().rstrip() for _ in range(n)]MI_1 = lambda : map(lambda x:int(x)-1, input().split())LI_1 = lambda : list(map(lambda x:int(x)-1, input().split()))def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:edge = [set() for i in range(n+1+index)]for _ in range(m):a,b = map(int, input().split())a += indexb += indexedge[a].add(b)if not dir:edge[b].add(a)return edgedef graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:edge = [set() for i in range(n+1+index)]for _ in range(m):a,b,c = map(int, input().split())a += indexb += indexedge[a].add((b,c))if not dir:edge[b].add((a,c))return edgemod = 998244353inf = 1001001001001001001ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97yes = lambda : print("Yes")no = lambda : print("No")yn = lambda flag : print("Yes" if flag else "No")def acc(a:list[int]):sa = [0]*(len(a)+1)for i in range(len(a)):sa[i+1] = a[i] + sa[i]return saprinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)alplow = "abcdefghijklmnopqrstuvwxyz"alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]# import pypyjit# pypyjit.set_param('max_unroll_recursion=-1')# sys.setrecursionlimit(10**7)# sys.set_int_max_str_digits(0)from heapq import heappop,heappush,heapifydef run_length_encode(s):encoded = []n = len(s)i = 0while i < n:current_char = s[i]count = 0while i < n and s[i] == current_char:count += 1i += 1encoded.append([int(current_char), count])return encodeds = list(map(int,SI()))n = len(s)ans = 0c0 = 0c1 = 0for i in reversed(range(n)):if s[i] == 0:ans += (c1//2)*c0c1 = 0c0 += 1else:c1 += 1print(ans + (c1//2)*c0)