input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import deque
N,M=list(map(int,input().split()))
even_list=[list(map(int,input().split())) for _ in range(M)]
#リストVのN番目には頂点Nがあり、そこには頂点Nとつながっている頂点が入っている。
#seen[i]は、頂点iを訪問済みの場合はTrue、未訪問の場合はFalse
seen=[False for i in range(N+1)]
count=0
graph=[[] for _ in range(N+1)]
for i in even_list:
... | from collections import deque
N,M=list(map(int,input().split()))
graph=[[] for _ in range(N+1)]
for _ in range(M):
a,b,c=list(map(int,input().split()))
graph[a].append(b)
graph[b].append(a)
#seen[i]は、頂点iを訪問済みの場合はTrue、未訪問の場合はFalse
seen=[False]*(N+1)
count=0
for i in range(1,N+1):
... | p03045 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
n,m,*l=list(map(int,open(0).read().split()))
graph=[[]*n for _ in range(n)]
unvis=[True]*n
@lru_cache(maxsize=None)
def dfs(x):
for y in graph[x]:
if unvis[y]:
unvis[y]=False
dfs(y)
for i,j in zip(l[::3],l[1::3]):
gr... | import sys
sys.setrecursionlimit(200000)
n,m,*l=list(map(int,open(0).read().split()))
graph=[[]*n for _ in range(n)]
unvis=[True]*n
def dfs(x):
for y in graph[x]:
if unvis[y]:
unvis[y]=False
dfs(y)
for i,j in zip(l[::3],l[1::3]):
graph[i-1].append(j-1)
graph[j-1].append(i-1)
ans=0
fo... | p03045 |
import collections
def main():
n,m = list(map(int,input().split()))
f = [False for _ in range(n)]
a = [[] for _ in range(n)]
res = 0
for _ in range(m):
x,y,z = list(map(int,input().split()))
a[x-1].append(y-1)
a[y-1].append(x-1)
for i in range(n):
... | import sys
sys.setrecursionlimit(10**7)
n,m = list(map(int,input().split()))
f = [False for _ in range(n)]
a = [[] for _ in range(n)]
res = 0
def dfs(k):
f[k] = True
for g in a[k]:
if not f[g]:
dfs(g)
for _ in range(m):
x,y,z = list(map(int,input().split()))
a[x-1].a... | p03045 |
import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b,c = list(map(int, input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
def dfs(v):
if len(edge[v])==0:
return 0
for u in edge[v]:
if visited[u]==Fa... | N, M = list(map(int, input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y)... | p03045 |
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b,c = list(map(int, input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
from collections import deque
ans = 0
visited = [False]*N
d = deque()
for i in range(N):
if visited[i]==False:
visited[i... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y... | p03045 |
n, m = list(map(int, input().split()))
card = [[] for _ in range(n)]
for _ in range(m):
x, y, _ = list(map(int, input().split()))
card[x-1].append(y-1)
card[y-1].append(x-1)
checked = [False] * n
count = 0
import queue
q = queue.Queue()
for i in range(n):
if checked[i]:
conti... | n, m = list(map(int, input().split()))
card = [[] for _ in range(n)]
for _ in range(m):
x, y, _ = list(map(int, input().split()))
card[x-1].append(y-1)
card[y-1].append(x-1)
checked = [False] * n
count = 0
from collections import deque
for i in range(n):
if checked[i]:
continu... | p03045 |
n, m = list(map(int, input().split()))
card = [[] for _ in range(n)]
for _ in range(m):
x, y, _ = list(map(int, input().split()))
card[x-1].append(y-1)
card[y-1].append(x-1)
checked = [False] * n
count = 0
from collections import deque
for i in range(n):
if checked[i]:
continu... | n, m = list(map(int, input().split()))
card = [[] for _ in range(n)]
for _ in range(m):
x, y, _ = list(map(int, input().split()))
card[x-1].append(y-1)
card[y-1].append(x-1)
checked = [False] * n
count = 0
for i in range(n):
if checked[i]:
continue
count += 1
q = [i]
... | p03045 |
import sys
sys.setrecursionlimit(10**6)
n,m = list(map(int,input().split()))
global clasta
clasta = [-1 for i in range(n)]
path = [[] for i in range(n)]
used = [0 for i in range(n)]
for _ in range(m):
x,y,z = list(map(int,input().split()))
path[x-1].append(y-1)
path[y-1].append(x-1)
def dfs... | import sys
sys.setrecursionlimit(10**6)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return se... | p03045 |
# -*- coding:utf-8 -*-
class UnionFindVerSize():
def __init__(self, N):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
# グループのサイズ（個数）
self._size = [1] * N
def find_root(self, x):
... | # -*- coding:utf-8 -*-
class UnionFindVerDepth():
def __init__(self, N):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
# グループの深さ
self._depth = [1] * N
def find_root(self, x):
""... | p03045 |
import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n + 1)]
for i in range(m):
x, y, z = list(map(int,input().split()))
adjacent_list[x].append(y)
adjacent_list[y].append(x)
##結局、グラフが何個あるか数える
finished = set()
ans = 0
def dfs(node):
... | import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n + 1)]
for i in range(m):
x, y, z = list(map(int,input().split()))
adjacent_list[x].append(y)
adjacent_list[y].append(x)
##結局、グラフが何個あるか数える
finished = set()
ans = 0
def dfs(node):
... | p03045 |
import collections
class UnionFind:
def __init__(self, max_size):
self.parent = [i for i in range(max_size+1)]
self.depth = [0 for _ in range(max_size+1)]
self.cnt = [1 for i in range(max_size+1)]
# 菲再起にしたい Whileでスタックに突っこみながら見てスタックの中身全部に代入
'''
# 実はこっちのほうが速かったなんで？
... | import collections
class UnionFind:
def __init__(self, max_size):
self.parent = [i for i in range(max_size+1)]
self.depth = [0 for _ in range(max_size+1)]
self.cnt = [1 for i in range(max_size+1)]
def find(self, x):
deque = collections.deque()
t = x
while... | p03045 |
import sys
from collections import deque
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
memo = set(list(range(n)))
E = [[] for i in range(n)]
for i in range(m):
x, y, z = list(map(int, input().split()))
E[x-1].append(y-1)
E[y-1].append(x-1)
def dfs(... | import sys
from collections import deque
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
memo = set(list(range(n)))
E = [[] for i in range(n)]
for i in range(m):
x, y, z = list(map(int, input().split()))
E[x-1].append(y-1)
E[y-1].append(x-1)
def dfs(... | p03045 |
import sys
from collections import deque
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
memo = set(list(range(n)))
E = [[] for i in range(n)]
for i in range(m):
x, y, z = list(map(int, input().split()))
E[x-1].append(y-1)
E[y-1].append(x-1)
def dfs(... | import sys
from collections import deque
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
memo = [1 for _ in range(n)]
E = [[] for _ in range(n)]
for i in range(m):
x, y, z = list(map(int, input().split()))
E[x-1].append(y-1)
E[y-1].append(x-1)
def df... | p03045 |
def search(n):
while A[n-1] != n:
n = A[n-1]
return n
N, M = list(map(int, input().split()))
A = [i for i in range(1, N+1)]
ans = 0
for i in range(M):
X, Y, Z = list(map(int, input().split()))
X_root, Y_root = search(X), search(Y)
if X_root != Y_root:
A[X_root-1] =... | def search(n):
idx = n
while A[n-1] != n:
n = A[n-1]
A[idx-1] = n
return n
N, M = list(map(int, input().split()))
A = [i for i in range(1, N+1)]
ans = 0
for i in range(M):
X, Y, Z = list(map(int, input().split()))
X_root, Y_root = search(X), search(Y)
if X_root !=... | p03045 |
r=lambda x:x if u[x]<0else r(u[x])
n,m,*t=list(map(int,open(0).read().split()))
u=[-1]*-~n
for x,y in zip(t[::3],t[1::3]):
x,y=sorted((r(x),r(y)))
if x!=y:u[x]+=u[y];u[y]=x
print((sum(i<0for i in u)-1)) | r=lambda x:x*(u[x]<0)or r(u[x])
n,m,*t=list(map(int,open(0).read().split()))
u=[-1]*-~n
for x,y in zip(t[::3],t[1::3]):
x,y=sorted((r(x),r(y)))
if x!=y:u[x]+=u[y];u[y]=x
print((sum(i<0for i in u)-1)) | p03045 |
# --*-coding:utf-8-*--
def dsMakeSet(ds, x):
ds[x] = x
def dsFind(ds, x):
if ds[x] == x:
return x
while ds[x] != x:
x = ds[x]
ds[x] = x
return x
def dsUnion(ds, x, y):
xRoot = dsFind(ds, x)
yRoot = dsFind(ds, y)
if xRoot != yRoot:
... | # --*-coding:utf-8-*--
def dsMakeSet(ds, x):
ds[x] = x
def dsFind(ds, x):
if ds[x] == x:
return x
x0 = x
while ds[x] != x:
x = ds[x]
ds[x0] = x
return x
def dsUnion(ds, x, y):
xRoot = dsFind(ds, x)
yRoot = dsFind(ds, y)
if xRoot !=... | p03045 |
import sys
sys.setrecursionlimit(10 ** 5)
class UniteFind:
def __init__(self, N):
self.par = [i for i in range(N)]
def root(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.root(self.par[x])
return self.par[x]
def u... | import sys
sys.setrecursionlimit(10 ** 5)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
ans = list(range(N))
def root(a):
if a==ans[a]:
return a
else:
ans[a] = root(ans[a])
return ans[a]
for _ in range(M):
x, y, _ = [int(a)-1 for a in input().... | p03045 |
import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
N, M = list(map(int,input().split()))
q = []
c = [0] * N
A = [[] for i in range(N)]
for i in range(M):
x, y, z = list(map(int,input().split()))
x = x - 1
y = y - 1
A[x].append(y)
... | import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
N, M = list(map(int,input().split()))
q = []
c = [0] * N
A = [[] for i in range(N)]
for i in range(M):
x, y, z = list(map(int,input().split()))
x = x - 1
y = y - 1
A[x].append(y)
... | p03045 |
# input = sys.stdin.readline
from bisect import *
from collections import *
from heapq import *
# import functools
# import itertools
# import math
N,M=list(map(int,input().split()))
XYZ=[list(map(int,input().split())) for i in range(M)]
data=[[] for i in range(N+1)]
ittenai=[]
for x,y,z in XYZ:
data[x]... | # input = sys.stdin.readline
from bisect import *
from collections import *
from heapq import *
# import functools
# import itertools
# import math
N,M=list(map(int,input().split()))
XYZ=[list(map(int,input().split())) for i in range(M)]
data=[[] for i in range(N+1)]
ittenai=[]
for x,y,z in XYZ:
data[x]... | p03045 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, ... | def main():
#Union Find
#locate x
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
#merge x y
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return False
... | p03045 |
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return False
else:
if par[x] > par[y]:
x,y = y,x
par[x] += par[y]
par[y] = x
... | n,m = list(map(int,input().split()))
par = [-1]*(n)
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x]) #経路圧縮
return par[x]
def same(x,y):
return find(x) == find(y)
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return 0
els... | p03045 |
from collections import deque
N,M = list(map(int,input().split()))
node_list = [[] for i in range(N)]
for i in range(M):
x,y,z=list(map(int,input().split()))
node_list[x-1].append(y-1)
node_list[y-1].append(x-1)
checked_list = [-1 for i in range(N)]
def BFS(start,color,checked_list,nod... | import sys
def input():
return sys.stdin.readline()[:-1]
N,M = list(map(int,input().split()))
e_list = [[] for i in range(N)]
for i in range(M):
x,y,z = list(map(int,input().split()))
x,y = x-1,y-1
e_list[x].append(y)
e_list[y].append(x)
from collections import deque
def BFS(vi,... | p03045 |
N, M = list(map(int, input().split()))
XYZ = [list(map(int, input().split())) for _ in range(M)]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03045 |
n,m=list(map(int,input().split()))
import sys
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
root[x]=r(root[x])
return root[x]
def unite(x,y):
x=r(x)
... | n,m=list(map(int,input().split()))
import sys
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
return r(root[x])
def unite(x,y):
x=r(x)
y=r(y)
if ... | p03045 |
import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
num_edges = M
edges = [list(map(int, input().split())) for i in range(num_edges)]
adj = [[] for i in range(N+1)]
for ed in edges:
adj[ed[0]] += [[ed[1], ed[2]]]
adj[ed[1]] += [[ed[0], ed[2]]]
col_list = [-1 for i in range(N+... | class UnionFind():
def __init__(self,size):
self.table=[-1]*size
def root(self,x):
while self.table[x]>=0:
x=self.table[x]
return x
def unite(self,x,y):
s1=self.root(x)
s2=self.root(y)
if s1!=s2:
if self.table[s1]>self.table[... | p03045 |
import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
t = [[] for i in range(n)]
c = [-1 for i in range(n)]
for i in range(m):
x, y ,z = list(map(int, input().split()))
x -= 1
y -= 1
t[x].append(y)
t[y].append(x)
def dfs(num, depth):
if c[num] != -1:
... | import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
t = [[] for i in range(n)]
c = [-1 for i in range(n)]
for line in sys.stdin:
x, y ,z = list(map(int, line.split()))
x -= 1
y -= 1
t[x].append(y)
t[y].append(x)
def dfs(num, depth):
if c[num] != -1:
... | p03045 |
import sys
from collections import deque, defaultdict
import copy
import bisect
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
import math
N, M = list(map(int, input().split()))
XYZ = []
for i in range(M):
XYZ.append(list(map(int, input().split())))
renketu = [dict() for i in range(N)]
f... |
import sys
def input():
return sys.stdin.readline().strip()
N, M = list(map(int, input().split()))
class Union_Find():
def __init__(self, n):
self.union = [i for i in range(n)]
self.level = [0 for i in range(n)]
self.num = n
def root(self, i, mode=0):
keiro = [i]
ans = i
while ans... | p03045 |
N,M=list(map(int, input().split()))
E=[[] for _ in range(N)]
for _ in range(M):
x,y,z=[int(i)-1 for i in input().split()]
E[x].append(y)
E[y].append(x)
#情報のつながりがあるカードでグルーピングする
#グループIDのリスト(0は未割り当て)
G=[0]*(N+1)
def dfs(root,g):
stack=[root]
G[root]=g
while stack:
node=stac... | import sys
def main():
input = sys.stdin.readline
N,M=list(map(int, input().split()))
uf = UnionFindTree(N)
for _ in range(M):
x,y,z=list(map(int, input().split()))
uf.union(x-1,y-1)
c=set([uf.find(i) for i in range(N)])
print((len(c)))
class UnionFindTree:
d... | p03045 |
# coding: utf-8
# Your code here!
class UnionFind:
def __init__(self, n):
self.parent = list(range(n))#親ノード
self.size = [1]*n #グループの要素数
def root(self, x): #root(x): xの根ノードを返す．
while self.parent[x] != x:
self.parent[x] = self.parent[self.parent[x]]
x = s... | # coding: utf-8
# Your code here!
class UnionFind:
def __init__(self, n):
self.parent = list(range(n))#親ノード
self.size = [1]*n #グループの要素数
def root(self, x): #root(x): xの根ノードを返す．
while self.parent[x] != x:
self.parent[x] = self.parent[self.parent[x]]
x = s... | p03045 |
# coding: utf-8
# Your code here!
class UnionFind:
def __init__(self, n):
self.parent = list(range(n))#親ノード
self.size = [1]*n #グループの要素数
def root(self, x): #root(x): xの根ノードを返す．
while self.parent[x] != x:
self.parent[x] = self.parent[self.parent[x]]
x = s... | # coding: utf-8
# Your code here!
class UnionFind:
def __init__(self, n):
self.parent = list(range(n))#親ノード
self.size = [1]*n #グループの要素数
def root(self, x): #root(x): xの根ノードを返す．
while self.parent[x] != x:
self.parent[x] = self.parent[self.parent[x]]
x = s... | p03045 |
# coding: utf-8
# Your code here!
class UnionFind:
def __init__(self, n):
self.parent = list(range(n))#親ノード
self.size = [1]*n #グループの要素数
def root(self, x): #root(x): xの根ノードを返す．
while self.parent[x] != x:
self.parent[x] = self.parent[self.parent[x]]
x = s... | class UnionFind:
def __init__(self, size):
self.parent = [-1]*size #非負なら親ノード，負ならグループの要素数
def root(self, x): #root(x): xの根ノードを返す．
if self.parent[x] < 0:
return x
elif self.parent[self.parent[x]] < 0:
return self.parent[x]
else:
self.p... | p03045 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
... | class UnionFind:
def __init__(self, n):
self.par = [-1]*(n+1)
self.sizes=[1]*(n+1)
# 検索
def find(self, x):
if self.par[x]<0:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self,... | p03045 |
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = list(range(n + 1))
self.ranks = [0 for _ in range(n + 1)]
def get_root(self, x):
if self.parents[x] == x:
return x
self.parents[x] = self.get_root(self.parents[x])
return self... | import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | p03045 |
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | p03045 |
def dfs(g, start):
global visit
visiting = [start]
while visiting:
v = visiting.pop()
visit[v] = True
for v2 in g.get(v,()):
if v2 in visit or v2 in visiting:
continue
visiting.append(v2)
N,M = list(map(int, input().split()))
vis... | N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
x, y, z = list(map(int, input().split()))
x, y = x-1, y-1
graph[x].append(y)
graph[y].append(x)
visited = [False for i in range(N)]
def dfs(v):
Q = []
visited[v] = True
Q.append(v)
while ... | p03045 |
import sys
sys.setrecursionlimit(1000000)
N,M = list(map(int,input().split()))
XYZ = [list(map(int,input().split())) for _ in range(M)]
G = [[] for _ in range(N)]
for i in XYZ:
G[i[0]-1].append(i[1])
G[i[1]-1].append(i[0])
check = [False for _ in range(N)]
def DFS(G,s):
check[s-1] = Tru... | import sys
sys.setrecursionlimit(1000000)
N, M = list(map(int, input().split()))
X = [0] * M
Y = [0] * M
Z = [0] * M
for i in range(M):
X[i], Y[i], Z[i] = list(map(int, input().split()))
reach = [[] for _ in range(N)]
for i in range(M) :
reach[Y[i]-1].append(X[i])
reach[X[i]-1].append(Y[i])
... | p03045 |
import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in con[v]:
if seen[nv]:
continue
seen[nv]=1
update(nv)
N,M=list(map(int,input().split()))
seen=[0]*N
con=[[] for i in range(N)]
cnt=[[i,0] for i in range(N)]
for i in range(M):
X,Y,Z=list(map(int,i... | import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in G[v]:
if seen[nv]:
continue
seen[nv]=1
update(nv)
N,M=list(map(int,input().split()))
seen=[0]*N
G=[[] for i in range(N)]
for i in range(M):
X,Y,Z=list(map(int,input().split()))
X,Y=X-1,Y-1
... | p03045 |
n,m=list(map(int,input().split()))
parent=[i for i in range(n)]
rank=[0 for i in range(n)]
def find(a):
if parent[a]==a:
return a
else:
return find(parent[a])
def union(a,b):
ar=find(a)
br=find(b)
if ar==br:
return
if rank[a]>rank[b]:
parent[br]=ar
else:
parent[ar... | import sys
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
# 0-indexed
class UnionFind:
N=0
parent=None
size=None
def __init__(self,N):
self.N=N
self.parent=[i for i in range(self.N)]
self.size=[1]*self.N
def root(self,x):
while x!=self.paren... | p03045 |
N, M = list(map(int,input().split()))
par = [i for i in range(N+1)]
size = [1 for _ in range(N+1)]
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return 0
par[x] ... | N, M = list(map(int,input().split()))
par = [i for i in range(N+1)]
size = [1 for _ in range(N+1)]
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return 1
par[x] ... | p03045 |
import sys
sys.setrecursionlimit(10**6)
class UnionFind:
def __init__(self, N):
self.par = list(range(N))
def root(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.root(self.par[x])
return self.par[x]
def unite(se... | import sys
sys.setrecursionlimit(10**6)
class MergeFind:
def __init__(self, N):
self.par = list(range(N))
self.num_sets = N
def root(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.root(self.par[x])
return self.p... | p03045 |
n,m=list(map(int,input().split()))
#union-find
par=[-1]*(n+1)
def find(x):
if par[x]<0:
return x
else:
par[x]=find(par[x])
return par[x]
def size(x):
oya=find(x)
return -par[oya]
def unite(x,y):
if find(x)==find(y):
return False
else:
if si... | import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
# union-find
# xの根を求める
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
# xとyの属する集合の併合
def unite(x, y):
x = find(x)
y = find(y)
if x ... | p03045 |
import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
def main():
if os.... | import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
def main():
if os.... | p03293 |
numerosStr = input().split(" ")
numeros=[]
contador=0
i=0
for j in numerosStr:
numeros.append(int(j))
A = numeros[0]
B = numeros[1]
T = numeros[2]+0.5
print((int(((T)//A)*B))) | a,b,t = list(map(int, input().split()))
if a > t:
print((0))
else:
tempo = int((t + 0.5) / a)
print((tempo * b)) | p03059 |
a, b, t = [int(x) for x in input().split()]
s = 0
x = a
while x <= t + 0.5:
s += b
x += a
print(s)
| A, B, C = list(map(int, input().split()))
ans = (int(C/A))*B
print(ans) | p03059 |
a,b,t=list(map(int,input().split()))
print((t//a*b)) | a,b,t=list(map(int,input().split()))
print((int(((t+0.5)//a)*b))) | p03059 |
import itertools
import fractions
def main():
a,b,t = list(map(int,input().split()))
print((b * (t//a)))
if __name__ == '__main__':
main() | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
from collections import defaultdict
#import bisect
#
# d = m - k... | p03059 |
a,b,c=list(map(int,input().split()))
print(((c//a)*b)) | a,b,t=list(map(int,input().split()))
print(((t//a)*b)) | p03059 |
a,b,t=list(map(int,input().split()))
print(((t//a)*b)) | a,b,t=list(map(int,input().split()))
print((b*(t//a))) | p03059 |
a,b,t = list(map(int, input().split()))
c = t // a
print((c*b))
| a,b,t = list(map(int,input().split()))
print((t//a * b)) | p03059 |
a,b,c=list(map(int, input().split()))
print((c//a*b))
| a, b, t = list(map(int, input().split()))
print((t // a * b)) | p03059 |
A, B, T = list(map(int, input().split()))
tmp = (T+0.5) // A
print((int(B*tmp))) | A, B, T = list(map(int, input().split()))
res = B * (T // A)
print(res) | p03059 |
# T/A * B を出力する
a,b,t = list(map(int,input().split()))
print((b*(t//a)))
| a,b,c=list(map(int,input().split()))
print(((c//a)*b)) | p03059 |
a,b,t = list(map(int,input().split()))
print(((t//a)*b)) | a,b,t = list(map(int,input().split()))
ans = t//a*b
print(ans)
| p03059 |
a, b, t = list(map(int, input().split()))
answer = int(t / a) * b
print(answer) | a,b,t=list(map(int,input().split()))
ans=int(t/a)*b
print(ans) | p03059 |
import itertools
import math
a, b, t = list(map(int, input().split()))
sum = 0
for i in range(1,21):
if a * i <= t:
sum += b
print(sum) | a, b, t = list(map(int, input().split()))
print((b*(t//a))) | p03059 |
A, B, T = list(map(int, input().split()))
ans = 0
for i in range(T+1):
if i >= A and i % A == 0:
ans += B
print(ans)
| A, B, T = list(map(int, input().split()))
ans = 0
for i in range(1, T+1):
if i % A == 0:
ans += B
print(ans)
| p03059 |
a,b,t=list(map(int,input().split()));print((t//a*b)) | a,b,c=list(map(int,input().split()))
print((c//a*b)) | p03059 |
a,b,t = list(map(int,input().split()))
s = t + 0.5
print((int((s // a) * b))) | a,b,t=list(map(int,input().split()))
t+=0.5
print((int(b*(t//a)))) | p03059 |
a,b,t = list(map(int,input().split()))
print((b*(t//a))) | a,b,t = list(map(int,input().split()))
ans = t//a*b
print(ans) | p03059 |
a, b, t = list(map(int, input().split()))
ret = 0
for i in range(a, t + 1, a):
ret += b
print(ret)
| a, b, t = list(map(int, input().split()))
print((b * (t // a))) | p03059 |
a, b, t = list(map(int, input().split()))
print((int((t+0.5)/a)*b))
| a, b, t = list(map(int, input().split()))
print((t//a*b))
| p03059 |
M = 1299710
isPrime = [1]*M
isPrime[0],isPrime[1] = 0,0
lp = [0]*M; p = []
b = 2
for i in range(2,M):
if isPrime[i]:
for j in range(i*i,M,i):
isPrime[j] = 0
p.append(i)
b = i
lp[i] = b
while 1:
n = eval(input())
if n==0: break
print(p[p.index(lp[n])... | M = 1299710
isPrime = [1]*M
isPrime[0],isPrime[1] = 0,0
for i in range(2,M):
if isPrime[i]:
for j in range(i*i,M,i):
isPrime[j] = 0
while 1:
n = eval(input())
if n==0: break
p = q = n
if isPrime[n]:
print(0)
else:
while isPrime[p]==0:p-=1
... | p00855 |
a,b,c,d,e=[int(eval(input())) for _ in range(5)]
if a<0:
print((-a*c+d+b*e))
else:
print(((b-a)*e)) | a,b,c,d,e=[int(eval(input())) for _ in range(5)]
print((-a*c+d+b*e if a<0 else (b-a)*e)) | p00553 |
def count_bigger(a, b):
i = j = 0
c = []
while i < len(a) and j < len(b):
if a[i] >= b[j]:
j += 1
continue
c.append(len(b) - j)
i += 1
if len(c) < len(a):
c += [0] * (len(a) - len(c))
for i in range(len(c) - 1, 0, -1):
c[i -... | from itertools import product
def solve(string):
n, s = string.split()
r, g, b = [], [], []
r2, g2, b2 = set([]), set([]), set([])
for i, _s in enumerate(s):
if _s == "R":
r.append(i)
r2.add(2 * i)
if _s == "G":
g.append(i)
g... | p02714 |
from sys import stdin
n = int(eval(input()))
s = stdin.readline()
rind = []
gind = []
bind = []
ans = 0
for i in range(n):
if s[i] == "R":
rind.append(i+1)
elif s[i] == "G":
gind.append(i+1)
else:
bind.append(i+1)
for i in range(len(rind)):
for j in range(len(gind)... | from sys import stdin
n = int(eval(input()))
s = stdin.readline()
r = 0
g = 0
b = 0
for i in range(n):
if s[i] == "R":
r += 1
elif s[i] == "G":
g += 1
else:
b += 1
count1 = r*g*b
count2 = 0
for i in range(0,n-2):
for j in range(i+1,n-1):
if 2*j-i<=n-1:
... | p02714 |
import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def exit():
import sys
sys.exit(0)
def perm_sub(li, ... | import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def notab(a, b):
s = set((a,b))
for c in "RGB":
... | p02714 |
from math import gcd
n=int(input().strip())
s=input().strip()
c = 0
for i in range(n-2):
for j in range(i+1,n-1):
if s[i] == s[j]:
continue
for k in range(j+1,n):
if j - i == k - j:
continue
if s[i] == s[k]:
continue... | from math import gcd
n=int(input().strip())
s=input().strip()
r = 0
g = 0
for i in s:
if i == 'R':
r += 1
elif i == 'G':
g += 1
ans = r * g * (n - r - g)
for i in range(0, n-1):
for d in range(1, (n - i + 1) // 2):
if s[i] != s[i+d] and s[i] != s[i+d+d] and s[i+d] ... | p02714 |
# D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB", "GB... | # D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(2 * i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB",... | p02714 |
# D - RGB Triplets
from collections import defaultdict
def main():
_, S = open(0).read().split()
indices, doubled_indices = defaultdict(list), defaultdict(set)
for i, c in enumerate(S):
indices[c].append(i)
doubled_indices[c].add(2 * i)
cnt = S.count("R") * S.count("G") * S.c... | # D - RGB Triplets
from collections import defaultdict
def main():
_, S = open(0).read().split()
indices, doubled_indices = defaultdict(list), defaultdict(set)
for i, c in enumerate(S):
indices[c].append(i)
doubled_indices[c].add(2 * i)
cnt = len(indices["R"]) * len(indices... | p02714 |
from sys import stdin
import bisect
def main():
#入力
readline=stdin.readline
N=int(readline())
S=readline().strip()
res=0
R=[]
G=[]
B=[]
flags=[""]*N
for i in range(N):
if S[i]=="R":
R.append(i)
flags[i]="R"
elif S[i]=="G... | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
s=readline().strip()
ans=s.count("R")*s.count("G")*s.count("B")
for i in range(n):
for j in range(i+1,n):
k=2*j-i
if k>=n: break
x=s[i]
y=s[j]
... | p02714 |
n,s=open(0);n=int(n);c=s.count;print((c('R')*c('G')*c('B')-sum(len(set(s[i:j+1:j-i>>1]))>2for i in range(n)for j in range(i+2,n,2)))) | n,s=open(0);n=int(n);c=s.count;print((c('R')*c('G')*c('B')-sum(s[i]!=s[j]!=s[i+j>>1]!=s[i]for i in range(n)for j in range(i+2,n,2)))) | p02714 |
n,s=open(0);n=int(n);c=s.count;print((c('R')*c('G')*c('B')-sum(s[i]!=s[j]!=s[i+j>>1]!=s[i]for i in range(n)for j in range(i+2,n,2)))) | n,s=open(0);n=int(n);c=s.count;print((c('R')*c('G')*c('B')-sum(s[i]!=s[i+j>>1]!=s[j]!=s[i]for i in range(n)for j in range(i+2,n,2)))) | p02714 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string ... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string ... | p02714 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def inp():
return int(input())
def inps():
return input().rstrip()
def inpl():
return list(map(int, input().split()))
def _debug(obj):
print(obj, file=sys.stderr)
# import decimal
# from decimal import Decimal
# decimal.... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def inp():
return int(input())
def inps():
return input().rstrip()
def inpl():
return list(map(int, input().split()))
def _debug(obj):
print(obj, file=sys.stderr)
# import decimal
# from decimal import Decimal
# decimal.... | p02714 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
N = i_i()
S = i_s()
ans = 0
for i in range(N):
for j in range(i, N):
if S[i] != S[j]:
if S[i] == '... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
N = i_i()
S = i_s()
r = S.count('R')
g = S.count('G')
b = S.count('B')
cnt = 0
for i in range(N):
for j in range(i+... | p02714 |
def main():
import sys
input = sys.stdin.readline
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
n=int(eval(input()))
s=input().rstrip('\n'... |
def main():
import sys
input = sys.stdin.readline
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
n=int(eval(input()))
s=input().rstrip('\n'... | p02714 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
from bisect import bisect_left
def resolve():
N = ir()
S = sr()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i)
eli... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
from bisect import bisect_left
def resolve():
N = ir()
S = sr()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i+1)
e... | p02714 |
from itertools import permutations
inputs = open(0).readlines()
n = int(inputs[0])
S = inputs[1].strip()
R = [i for i, c in enumerate(S) if c == 'R']
G = [i for i, c in enumerate(S) if c == 'G']
B = [i for i, c in enumerate(S) if c == 'B']
def f(Z, i, x, y):
for z in Z[i:]:
if z == 2*y-x:
... | n = int(eval(input()))
S = input().strip()
r, g, b = list(map(S.count, 'RGB'))
t = 0
for i in range(n-2):
for w in range(1, (n-i+1) // 2):
t += len({S[i], S[i+w], S[i+2*w]}) == 3
print((r*g*b - t)) | p02714 |
from sys import stdin
N = list(map(int, (stdin.readline().strip().split())))[0]
S= list(stdin.readline().strip())
ans=0
for i in range(1,N+1):
for j in range(i+1,N+1):
for k in range(j+1,N+1):
if j-i !=k-j:
if S[i-1] != S[j-1] and S[j-1] !=S[k-1] and S[i-1] != S[k-1]:
... | from sys import stdin
N = list(map(int, (stdin.readline().strip().split())))[0]
S= list(stdin.readline().strip())
ans = S.count("R")*S.count("G")*S.count("B")
for i in range(N):
for j in range(i+1,N):
k=2*j-i
if k>=N:break
if S[i]!=S[j] and S[j]!=S[k] and S[i] !=S[k]:
... | p02714 |
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N = int(eval(input()))
S = input().rstrip()
all = {'R','G','B'}
R = set([])
G = set([])
B = set([])
for i ... | # import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N = int(eval(input()))
S = input().rstrip()
R = set([])
G = set([])
B = set([])
for i in range(N):
temp ... | p02714 |
from sys import stdin
n = int(stdin.readline().rstrip())
s = str(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
ans = 0
for i in range... | from sys import stdin
n = int(stdin.readline().rstrip())
s = str(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
rnum = s.count("R")
gnum... | p02714 |
import sys
n = int(sys.stdin.readline().rstrip())
s = sys.stdin.readline().rstrip()
r = []
b = []
g = []
for i, si in enumerate(s):
if si == 'R':
r.append(i + 1)
elif si == 'G':
g.append(i + 1)
elif si == 'B':
b.append(i + 1)
count = 0
gb = sorted(g + b)
br = sorted(... | import sys
n = int(sys.stdin.readline().rstrip())
s = sys.stdin.readline().rstrip()
r = []
b = []
g = []
for i, si in enumerate(s):
if si == 'R':
r.append(i + 1)
elif si == 'G':
g.append(i + 1)
elif si == 'B':
b.append(i + 1)
count = 0
for i in range(n):
for j in... | p02714 |
n = int(eval(input()))
seq = input().strip()
ans = 0
r = []
g = []
b = []
for i in range(len(seq)):
if seq[i] == 'R':
r.append(i)
elif seq[i] == 'G':
g.append(i)
else:
b.append(i)
for i in r:
for j in g:
for k in b:
z,x,c = sorted([i,j,k])
... | n = int(eval(input()))
seq = input().strip()
ans = 0
r = set()
g = set()
b = set()
for i in range(len(seq)):
if seq[i] == 'R':
r.add(i)
elif seq[i] == 'G':
g.add(i)
else:
b.add(i)
ans = len(r)*len(g)*len(b)
for i in r:
for j in g:
if (i+j) % 2 == 0 and (... | p02714 |
import sys
import fractions
def in_ctrl():
_input = [_.rstrip() for _ in sys.stdin.readlines()]
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
N = int(_input[0])
S = _input[1]
# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
return N,S
def out_ctrl(s):
print(s)
... | from sys import stdin
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
N = int(_in[0]) # type:int
S = _in[1] # type:str
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
cnt = S.count('R')*S.count('G')*S.count('B')
for i in range(N):
for j i... | p02714 |
# this is a good problem !
import sys
si = sys.stdin.readline
d = ['R', 'G', 'B']
ld = [[], [], []] # letter distribution
def main():
count = 0
n = int(si())
l = list(si())
l.pop()
dc = d[:]
for i in range(n-1, -1, -1):
if i == n-1:
if l[i] == 'R':
... | import sys
si = sys.stdin.readline
so = sys.stdout.write
def main():
n = int(si())
s = si()[:-1]
cnt = s.count('R')*s.count('G')*s.count('B')
for i in range(n-2):
for j in range(i+1, n-1):
k = j+j-i
if k < n and s[i] != s[j] and s[j] != s[k] and s[k] != s[... | p02714 |
import math
import sys
import os
from operator import mul
import bisect
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_... | import math
import sys
import os
from operator import mul
import bisect
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_... | p02714 |
import sys
input = sys.stdin.readline
def linput():
return [int(x) for x in input().split()]
n = int(eval(input()))
s = input().rstrip()
from collections import Counter
r = []
g = []
b = []
for i in range(n):
if s[i] == "R":
r.append(i)
elif s[i] == "G":
g.append(... | import sys
input = sys.stdin.readline
def linput():
return [int(x) for x in input().split()]
n = int(eval(input()))
s = input().rstrip()
from collections import Counter
r = [0] * (n + 1)
g = [0] * (n + 1)
b = [0] * (n + 1)
for i in range(1, n + 1):
if s[i - 1] == "R":
r[i] = r[... | p02714 |
from itertools import accumulate, dropwhile
from sys import stdin
def main():
N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
r_sum, g_sum, b_sum = [list(accumulate(1 if c == x else 0 for c in S)) for x in 'RGB']
sums = {'R': r_sum, 'G': g_sum, 'B': b_sum}
r_idx, g_idx, b... | from sys import stdin
def main():
N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
r_count, g_count, b_count = [S.count(x) for x in 'RGB']
ans = r_count * g_count * b_count
for i in range(N - 2):
for j in range(i + 1, N - 1):
k = j + (j - i)
... | p02714 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): re... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): re... | p02714 |
from bisect import bisect_right
N = int(eval(input()))
S = input().strip()
R = []
G = []
B = []
Ron = [0 for _ in range(len(S))]
Gon = [0 for _ in range(len(S))]
Bon = [0 for _ in range(len(S))]
for i in range(N):
if S[i]=="R":
R.append(i)
Ron[i]=1
elif S[i]=="G":
G.append(... | N = int(eval(input()))
S = input().strip()
C = {"R":[],"G":[],"B":[]}
for i in range(N):
C[S[i]].append(i)
C["B"] = set(C["B"])
cnt = 0
for r in C["R"]:
for g in C["G"]:
if r<g:
i = r
j = g
else:
i = g
j = r
cnt += len(C["B"]... | p02714 |
from sys import stdin
def get_result(data):
# N = int(data[0][0])
S = data[1][0]
r_index = [i for i in range(len(S)) if S[i] == 'R']
g_index = [i for i in range(len(S)) if S[i] == 'G']
b_index = [i for i in range(len(S)) if S[i] == 'B']
all_case = len(r_index) * len(g_index) * len(b_i... | from sys import stdin
def get_result(data):
# N = int(data[0][0])
S = data[1][0]
r_index = [i for i in range(len(S)) if S[i] == 'R']
g_index = [i for i in range(len(S)) if S[i] == 'G']
b_index = set([i for i in range(len(S)) if S[i] == 'B'])
all_case = len(r_index) * len(g_index) * le... | p02714 |
e=enumerate
_,s=open(0)
r,g,b=list(map(s.count,'RGB'))
print((r*g*b-sum(c!=d!=s[i-~j]!=c for i,c in e(s)for j,d in e(s[i+2:-1:2])))) | e=enumerate
_,s=open(0)
r,g,b=list(map(s.count,'RGB'))
print((r*g*b-sum(c!=d!=s[i+j]!=c for i,c in e(s)for j,d in e(s[i:-1:2])))) | p02714 |
import sys, math
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
res = 0
r = []
g = []
b = []
for i, c in enumerate(s):
if c == "R":
r.append(i)
if c == "G":
g.append(i)
if c == "B":
b.append(i)
res = len(r) * len(b) * len(g)
for i in r... | import sys, math
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
res = 0
r = []
g = []
b = []
for i, c in enumerate(s):
if c == "R":
r.append(i)
if c == "G":
g.append(i)
if c == "B":
b.append(i)
res = len(r) * len(b) * len(g)
def bin_fi... | p02714 |
from time import time
def solve(N, S):
answer = 0
for i in range(N):
Si = S[i]
for k in range(i+2, N):
Sk = S[k]
if Si == Sk:
continue
for j in range(i+1, k):
if j-i == k-j:
continue
... | from time import time
def solve(N, S):
answer = 0
Cs = [[], [], []]
for i in range(N):
c = S[i]
if c == 'R':
Cs[0].append(i)
elif c == 'G':
Cs[1].append(i)
elif c == 'B':
Cs[2].append(i)
answer = len(Cs[0]) * len(Cs[1]) * ... | p02714 |
import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
c = collections.Counter(list(s))
left = collections.defaultdict(int)
cnt = 0
for i in range(n - 2):
le... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
r = s.count("R")
g = s.count("G")
b = s.count("B")
cnt = r * g * b
for i in range(n - 2):
for j in range(i + 1, n - 1... | p02714 |
# abc162_d.py
import sys
import time
import unittest
from io import StringIO
import itertools
def resolve():
N = int(input())
S = input()
sum = 0
for i, j, k in itertools.combinations(range(N), 3):
if S[i] != S[j] and S[i] != S[k] and S[j] != S[k] and j - i != k - j:
... | # abc162_d.py
import sys
import time
import unittest
from io import StringIO
def resolve():
int(input())
S = input()
r = S.count("R")
g = S.count("G")
b = S.count("B")
sum = r * g * b
for i in range(len(S)):
for j in range(i + 1, len(S)):
k = j + (j - i)... | p02714 |
from sys import stdin, stdout
def main():
N=int(stdin.readline())
S=stdin.readline().rstrip()
R, G, B = [], [], []
for i, c in enumerate(S):
if c == 'R':
R.append(i)
elif c == 'G':
G.append(i)
else:
B.append(i)
cnt = 0
for ... | from sys import stdin, stdout
def main():
N=int(stdin.readline())
S=stdin.readline().rstrip()
R, G, B = set(), set(), set()
for i, c in enumerate(S):
if c == 'R':
R.add(i)
elif c == 'G':
G.add(i)
else:
B.add(i)
cnt, total = 0, l... | p02714 |
import sys
N = int(sys.stdin.readline().rstrip())
S = sys.stdin.readline().rstrip()
if len(set(S)) == 1 or N < 3:
print((0))
sys.exit()
ans = []
for i in range(N - 2):
a = S[i]
for j in range(i + 1, N - 1):
b = S[j]
if a == b:
continue
jtoi = j - i
... | import sys
N = int(sys.stdin.readline().rstrip())
S = sys.stdin.readline().rstrip()
if len(set(S)) == 1 or N < 3:
print((0))
sys.exit()
Rs = S.count("R")
Gs = S.count("G")
Bs = S.count("B")
ans = Rs * Gs * Bs
for i in range(N - 1):
for j in range(i + 1, N):
k = j + (j - i)
... | p02714 |
#!/usr/bin/env pypy3
# n,m = map(int,sys.stdin.readline().split())
# a = list(map(int,sys.stdin.readline().split()))
# a = [sys.stdin.readline() for s in range(n)]
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
# d = collections.defaultdict(list)
# import math
# from functools import reduce... | #!/usr/bin/env pypy3
# n,m = map(int,sys.stdin.readline().split())
# a = list(map(int,sys.stdin.readline().split()))
# a = [sys.stdin.readline() for s in range(n)]
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
# d = collections.defaultdict(list)
# import math
# from functools import reduce... | p02714 |
import sys
import math
from functools import reduce
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()... | import sys
import math
from functools import reduce
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()... | p02714 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.