摘要：
2588: Spoj 10628. Count on a tree Description 给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案，初始为0，即第一个询问的u是明文。 阅读全文
posted @ 2019-01-17 13:24
ZERO-
阅读(197)
评论(0)
推荐(0)
该文被密码保护。 阅读全文
posted @ 2019-01-13 20:28
ZERO-
阅读(12)
评论(4)
推荐(0)
摘要：
D. Sum in the tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Mitya has a rooted tr 阅读全文
posted @ 2019-01-13 20:02
ZERO-
阅读(514)
评论(0)
推荐(0)
摘要：
C. Postcard time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Andrey received a postcard fr 阅读全文
posted @ 2019-01-13 19:50
ZERO-
阅读(511)
评论(0)
推荐(0)
摘要：
B. Squares and Segments time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Sofia is i 阅读全文
posted @ 2019-01-13 19:42
ZERO-
阅读(569)
评论(0)
推荐(0)
摘要：
A. Snowball time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Today's morning was exception 阅读全文
posted @ 2019-01-13 19:36
ZERO-
阅读(403)
评论(0)
推荐(0)
摘要：
C. Ancient Berland Circus time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output Nowadays all ci 阅读全文
posted @ 2018-12-02 16:05
ZERO-
阅读(438)
评论(0)
推荐(0)
摘要：
D. Maximum Diameter Graph time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Maximum Dia 阅读全文
posted @ 2018-11-30 21:43
ZERO-
阅读(506)
评论(0)
推荐(0)
摘要：
C. Multi-Subject Competition time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Multi-Su 阅读全文
posted @ 2018-11-30 21:38
ZERO-
阅读(334)
评论(0)
推荐(0)
摘要：
B. Vova and Trophies time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Vova and Trophie 阅读全文
posted @ 2018-11-30 21:35
ZERO-
阅读(215)
评论(0)
推荐(0)
浙公网安备 33010602011771号