message stringlengths 2 49.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 446 108k | cluster float64 13 13 | __index_level_0__ int64 892 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all vertices on the path from the root to the vertex i... | instruction | 0 | 34,305 | 13 | 68,610 |
Tags: dfs and similar, trees
Correct Solution:
```
n=int(input())
sd=dict()
lt=[0]*(n+1)
for i in range(1,n+1):
a,b=map(int,input().split())
if(a!=-1):
if(a not in sd):
sd[a]=[]
sd[a].append(i)
if(b==1):
lt[i]=1
an=[]
for j in range(1,n+1):
if(lt[j]==1):
if(j ... | output | 1 | 34,305 | 13 | 68,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all vertices on the path from the root to the vertex i... | instruction | 0 | 34,306 | 13 | 68,612 |
Tags: dfs and similar, trees
Correct Solution:
```
from collections import defaultdict,Counter
n=int(input())
l=[]
p=[0]*n
c=[0]*n
for i in range(n):
pp,cc=map(int,input().split())
p[i],c[i]=pp,cc
d=c[:]
for i in range(n):
if p[i]!=-1 and not c[i]:
d[p[i]-1]=0
if d==[0]*n:
print(-1)
else:
fo... | output | 1 | 34,306 | 13 | 68,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all vertices on the path from the root to the vertex i... | instruction | 0 | 34,307 | 13 | 68,614 |
Tags: dfs and similar, trees
Correct Solution:
```
def isvalid(l):
global obeys
for i in l:
if(obeys[i]==0):
return 0
return 1
n=int(input())
arrofp=[0 for i in range(n+1)]
obeys=[0 for i in range(n+1)]
isparentof=[[] for i in range(n+1)]
for i in range(1,n+1):
l=input().split()
... | output | 1 | 34,307 | 13 | 68,615 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all vertices on the path from the root to the vertex i... | instruction | 0 | 34,308 | 13 | 68,616 |
Tags: dfs and similar, trees
Correct Solution:
```
class node:
def __init__(self, value, parent, respect):
self.value = value
self.children = []
self.parent = parent
self.respect = respect
all_nodes = {}
root = -1
not_respectors = []
import sys
n = int(sys.stdin.readline())
for i... | output | 1 | 34,308 | 13 | 68,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,309 | 13 | 68,618 |
Yes | output | 1 | 34,309 | 13 | 68,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,310 | 13 | 68,620 |
Yes | output | 1 | 34,310 | 13 | 68,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,311 | 13 | 68,622 |
Yes | output | 1 | 34,311 | 13 | 68,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,312 | 13 | 68,624 |
Yes | output | 1 | 34,312 | 13 | 68,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,313 | 13 | 68,626 |
No | output | 1 | 34,313 | 13 | 68,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,314 | 13 | 68,628 |
No | output | 1 | 34,314 | 13 | 68,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,315 | 13 | 68,630 |
No | output | 1 | 34,315 | 13 | 68,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree with vertices numerated from 1 to n. A tree is a connected graph without cycles. A rooted tree has a special vertex named root.
Ancestors of the vertex i are all ver... | instruction | 0 | 34,316 | 13 | 68,632 |
No | output | 1 | 34,316 | 13 | 68,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We define the sum of prefix sums of an array [s_1, s_2, ..., s_k] as s_1 + (s_1 + s_2) + (s_1 + s_2 + s_3) + ... + (s_1 + s_2 + ... + s_k).
You are given a tree consisting of n vertices. Each v... | instruction | 0 | 34,418 | 13 | 68,836 |
No | output | 1 | 34,418 | 13 | 68,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We define the sum of prefix sums of an array [s_1, s_2, ..., s_k] as s_1 + (s_1 + s_2) + (s_1 + s_2 + s_3) + ... + (s_1 + s_2 + ... + s_k).
You are given a tree consisting of n vertices. Each v... | instruction | 0 | 34,419 | 13 | 68,838 |
No | output | 1 | 34,419 | 13 | 68,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We define the sum of prefix sums of an array [s_1, s_2, ..., s_k] as s_1 + (s_1 + s_2) + (s_1 + s_2 + s_3) + ... + (s_1 + s_2 + ... + s_k).
You are given a tree consisting of n vertices. Each v... | instruction | 0 | 34,420 | 13 | 68,840 |
No | output | 1 | 34,420 | 13 | 68,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We define the sum of prefix sums of an array [s_1, s_2, ..., s_k] as s_1 + (s_1 + s_2) + (s_1 + s_2 + s_3) + ... + (s_1 + s_2 + ... + s_k).
You are given a tree consisting of n vertices. Each v... | instruction | 0 | 34,421 | 13 | 68,842 |
No | output | 1 | 34,421 | 13 | 68,843 |
Provide a correct Python 3 solution for this coding contest problem.
We have a weighted directed graph with N vertices numbered 0 to N-1.
The graph initially has N-1 edges. The i-th edge (0 \leq i \leq N-2) is directed from Vertex i to Vertex i+1 and has a weight of 0.
Snuke will now add a new edge (i → j) for every... | instruction | 0 | 34,945 | 13 | 69,890 |
"Correct Solution:
```
N = int(input())
A = [[0] * N for _ in range(N)]
Al = [[0] * (N+1) for _ in range(N+1)]
Ar = [[0] * (N+1) for _ in range(N+1)]
for i in range(N) :
a = [int(i) for i in input().split()]
for j in range(N) :
if i < j :
A[i][j] = a[j-1]
elif i > j :
... | output | 1 | 34,945 | 13 | 69,891 |
Provide a correct Python 3 solution for this coding contest problem.
We have a weighted directed graph with N vertices numbered 0 to N-1.
The graph initially has N-1 edges. The i-th edge (0 \leq i \leq N-2) is directed from Vertex i to Vertex i+1 and has a weight of 0.
Snuke will now add a new edge (i → j) for every... | instruction | 0 | 34,946 | 13 | 69,892 |
"Correct Solution:
```
N = int(input())
A = [[0] * N for _ in range(N)]
Al = [[0] * (N+1) for _ in range(N+1)]
Ar = [[0] * (N+1) for _ in range(N+1)]
for i in range(N) :
a = [int(i) for i in input().split()]
for j in range(N) :
if i < j :
A[i][j] = a[j-1]
elif i > j :
... | output | 1 | 34,946 | 13 | 69,893 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,963 | 13 | 69,926 |
"Correct Solution:
```
N=int(input())
numlist=list(map(int,(input() for _ in range(N))))
numdict={y:x for x,y in enumerate(numlist)}
sorted_list=sorted(numdict.items(),reverse=True)
nextS=lambda Snow,child : Snow+2*child-N
amount_of_child=[1]*N
sum_of_distance_of_child=[0]*N
branch_list=[]
for S,num in sorted_list:
... | output | 1 | 34,963 | 13 | 69,927 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,964 | 13 | 69,928 |
"Correct Solution:
```
N = int(input())
src = [int(input()) for i in range(N)]
idx = {a:i for i,a in enumerate(src)}
size = [1] * N
ss = list(sorted(src))
es = []
gr = [[] for i in range(N)]
while len(ss) > 1:
a = ss.pop()
k = size[idx[a]]
b = a + 2*k - N
if b == a or b not in idx:
print(-1)
... | output | 1 | 34,964 | 13 | 69,929 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,965 | 13 | 69,930 |
"Correct Solution:
```
n = int(input())
d = [int(input()) for i in range(n)]
if sum(d)%2 > 0:
print(-1)
exit()
d = sorted([(dd, i) for i, dd in enumerate(d)], reverse = True)
d_to_i = {dd:i for dd, i in d}
n_child = [1]*n
d_child = [0]*n
ans = []
for dd, i in d:
d_i = dd+2*n_child[i]-n
if d_i in d_to_... | output | 1 | 34,965 | 13 | 69,931 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,966 | 13 | 69,932 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**7)
n = int(input())
d = [int(input()) for _ in range(n)]
r = {v: i for i, v in enumerate(d)}
sz = [1] * n
dsorted = sorted(((di, i) for i, di in enumerate(d)), reverse=True)
ans = []
to = [[] for _ in range(n)]
for di, i in dsorted[:n-1]:
nd = di + (sz[i] ... | output | 1 | 34,966 | 13 | 69,933 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,967 | 13 | 69,934 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N = int(input())
D = [None] + [int(input()) for _ in range(N)]
parent = [None] * (N+1)
size = [None] + [1] * N # 部分木の頂点数、自分を含む
d_to_i = {d:i for i,d in enumerate(D)}
D_desc = sorted(D[1:],reverse=True)
D_subtree = [0] * (N+1)
edges = []
bl = True
for d in ... | output | 1 | 34,967 | 13 | 69,935 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,968 | 13 | 69,936 |
"Correct Solution:
```
def solve(n, ddd):
dsd = {d: i for i, d in enumerate(ddd)}
child_cnt = [1] * n
child_dist = [0] * n
buf = []
srt = sorted(dsd.items(), reverse=True)
for d, i in srt[:-1]:
cc = child_cnt[i]
pd = d - (n - cc * 2)
if pd == d or pd not in dsd:
... | output | 1 | 34,968 | 13 | 69,937 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,969 | 13 | 69,938 |
"Correct Solution:
```
"""
Writer: SPD_9X2
https://atcoder.jp/contests/arc103/tasks/arc103_d
面白そう！
とっかかりはどのへんだろうか
偶奇あたりから考えてみる？
まず、A→BとA←B の距離は等しいので、Dの合計は絶対偶数になる
Dの和が奇数なら構築不可能
辺u,vを取り除いて,2つの部分木に分解する、各木の含む頂点数を x[u],x[v]とすると
D[u]+x[u] == D[v]+x[v] となる (x[u] + x[v] == N)
最大のDについて考えてみよう
最大のDから繋がってる点を根とした部分木は少なくとも半分の数の... | output | 1 | 34,969 | 13 | 69,939 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, an... | instruction | 0 | 34,970 | 13 | 69,940 |
"Correct Solution:
```
n = int(input())
a = []
s = []
for i in range(n):
x = int(input())
a.append(x * n + i)
s.append(1)
a.sort()
a.reverse()
a.append(-1)
Sum = 0
Have = True
result = []
for i in range(n - 1):
l = 0
r = n
val = (a[i] // n) + s[i] + s[i] - n
while (l < r):
m =... | output | 1 | 34,970 | 13 | 69,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,971 | 13 | 69,942 |
Yes | output | 1 | 34,971 | 13 | 69,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,972 | 13 | 69,944 |
Yes | output | 1 | 34,972 | 13 | 69,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,973 | 13 | 69,946 |
Yes | output | 1 | 34,973 | 13 | 69,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,974 | 13 | 69,948 |
Yes | output | 1 | 34,974 | 13 | 69,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,975 | 13 | 69,950 |
No | output | 1 | 34,975 | 13 | 69,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,976 | 13 | 69,952 |
No | output | 1 | 34,976 | 13 | 69,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,977 | 13 | 69,954 |
No | output | 1 | 34,977 | 13 | 69,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?
* The vertices are number... | instruction | 0 | 34,978 | 13 | 69,956 |
No | output | 1 | 34,978 | 13 | 69,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,203 | 13 | 70,406 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
n = int(input()) + 1
res = 0
a = tuple(map(int, input().split()))
for ai in a:
res += ai * (n - ai)
for ai, aj in map(sorted, zip(a, a[1:])):
res -= ai * (n - aj)
print(res)
###
``` | output | 1 | 35,203 | 13 | 70,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,204 | 13 | 70,408 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
##
n = int(input()) + 1
res = 0
a = tuple(map(int, input().split()))
for ai in a:
res += ai * (n - ai)
for ai, aj in map(sorted, zip(a, a[1:])):
res -= ai * (n - aj)
print(res)
##
``` | output | 1 | 35,204 | 13 | 70,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,205 | 13 | 70,410 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading... | output | 1 | 35,205 | 13 | 70,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,206 | 13 | 70,412 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
n=int(input())
l=input().split()
li=[int(i) for i in l]
li.insert(0,0)
ans=0
for i in range(1,n+1):
if(li[i]>=li[i-1]):
ans=ans+((li[i]-li[i-1])*(n-li[i]+1))
else:
ans=ans+(li[i]*(li[i-1]-li[i]))
print(ans)
``` | output | 1 | 35,206 | 13 | 70,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,207 | 13 | 70,414 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
n = int(input()) + 1
res = 0
a = tuple(map(int, input().split()))
for ai in a:
res += ai * (n - ai)
for ai, aj in map(sorted, zip(a, a[1:])):
res -= ai * (n - aj)
print(res)
#####
``` | output | 1 | 35,207 | 13 | 70,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,208 | 13 | 70,416 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
ans = a[0] * (n-a[0]+1)
for i in range(1, n):
if a[i-1] == a[i]: continue
elif a[i-1] < a[i]: ans+= (a[i]-a[i-1]) * (n-a[i]+1)
elif a[i-1] > a[i]: ans+= a[i] * (a[i-1]-a[i])
print(ans)
``... | output | 1 | 35,208 | 13 | 70,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,209 | 13 | 70,418 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
import sys
input = sys.stdin.readline
n=int(input())
A=[0]+list(map(int,input().split()))
ANS=0
for i in range(1,n+1):
if A[i]>A[i-1]:
ANS+=(n-A[i]+1)*(A[i]-A[i-1])
else:
ANS+=A[i]*(A[i-1]-A[i])
print(ANS)
``` | output | 1 | 35,209 | 13 | 70,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 ≤ i < n there is an edge betw... | instruction | 0 | 35,210 | 13 | 70,420 |
Tags: combinatorics, data structures, dp, math
Correct Solution:
```
import sys
n = int(sys.stdin.readline().strip())
a = list(map(int, sys.stdin.readline().strip().split()))
s = a[0] * (n - a[0] + 1)
for i in range (1, n):
if a[i - 1] < a[i]:
s = s + (a[i] - a[i-1]) * (n - a[i] + 1)
if a[i - 1] > a[i]... | output | 1 | 35,210 | 13 | 70,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Form... | instruction | 0 | 35,211 | 13 | 70,422 |
Yes | output | 1 | 35,211 | 13 | 70,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Form... | instruction | 0 | 35,212 | 13 | 70,424 |
Yes | output | 1 | 35,212 | 13 | 70,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Form... | instruction | 0 | 35,213 | 13 | 70,426 |
Yes | output | 1 | 35,213 | 13 | 70,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Form... | instruction | 0 | 35,214 | 13 | 70,428 |
Yes | output | 1 | 35,214 | 13 | 70,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Form... | instruction | 0 | 35,215 | 13 | 70,430 |
No | output | 1 | 35,215 | 13 | 70,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves drawing circles.
One day she has drawn a circle and wanted to draw a tree on it.
The tree is a connected undirected graph consisting of n nodes and n-1 edges. The nodes are numbered from 1 to n.
Nauuo wants to dr... | instruction | 0 | 35,216 | 13 | 70,432 |
Tags: combinatorics, dfs and similar, dp, trees
Correct Solution:
```
n=int(input())
d=[0]*(n+1)
for i in range(n-1):
u,v=map(int,input().split())
d[u]+=1
d[v]+=1
n=n*d[u]*d[v]%998244353
print(n)
``` | output | 1 | 35,216 | 13 | 70,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves drawing circles.
One day she has drawn a circle and wanted to draw a tree on it.
The tree is a connected undirected graph consisting of n nodes and n-1 edges. The nodes are numbered from 1 to n.
Nauuo wants to dr... | instruction | 0 | 35,217 | 13 | 70,434 |
Tags: combinatorics, dfs and similar, dp, trees
Correct Solution:
```
#import sys
#sys.stdin = open('inD', 'r')
n = int(input())
#a = [int(x) for x in input().split()]
#n,m = map(int, input().split())
ans = n
mod = 998244353
d = [0]*(n+1)
for i in range(n-1):
u,v = map(int, input().split())
d[u] += 1
d[v] +... | output | 1 | 35,217 | 13 | 70,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves drawing circles.
One day she has drawn a circle and wanted to draw a tree on it.
The tree is a connected undirected graph consisting of n nodes and n-1 edges. The nodes are numbered from 1 to n.
Nauuo wants to dr... | instruction | 0 | 35,218 | 13 | 70,436 |
Tags: combinatorics, dfs and similar, dp, trees
Correct Solution:
```
from collections import Counter
n = int(input())
f = [1]
for i in range(1, n):
f.append(f[-1] * i % 998244353)
d = []
for _ in range(n-1):
d.extend(input().split())
res = n
for v in Counter(d).values():
res *= f[v]
res %= 998244... | output | 1 | 35,218 | 13 | 70,437 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.