LP_Cong

Tree Problem Description You are given a tree with N nodes which are numbered by integers 1..N. Each node is associated with an integer as the weight. Your task is to deal with M operatio

3282: TreeTime Limit: 30 Sec  Memory Limit: 512 MBSubmit: 2500  Solved: 1194[Submit][Status][Discuss]Description给定Ｎ个点以及每个点的权值，要你处理接下来的Ｍ个操作。操作有４种。操作从０到３编号。点从１到Ｎ编号。０：后接两个整数（ｘ，ｙ），代表询问从ｘ到ｙ的路径上的点的权值的ｘｏｒ和。保...

3669: [Noi2014]魔法森林Time Limit: 30 Sec  Memory Limit: 512 MBSubmit: 3462  Solved: 2216[Submit][Status][Discuss]Description为了得到书法大家的真传，小E同学下定决心去拜访住在魔法森林中的隐士。魔法森林可以被看成一个包含个N节点M条边的无向图，节点标号为1..N，边标号为1..M。初...

3514: Codechef MARCH14 GERALD07加强版Time Limit: 60 Sec  Memory Limit: 256 MBSubmit: 2269  Solved: 871[Submit][Status][Discuss]DescriptionN个点M条边的无向图，询问保留图中编号在[l,r]的边的时候图中的联通块个数。Input第一行四个整数N、M、K、type，代表点...

In this problem you will be given a tree with NN nodes and N - 1N−1 bidirectional edges. Now you should handle three kinds of operations. 11. Given two integers x, yx,y, you should make a new edge be...

Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 720    Accepted Submission(s): 266   Problem Description Alice and Bob are playing with...

Description 神犇有一个n个节点的图。因为神犇是神犇，所以在T时间内一些边会出现后消失。神犇要求出每一时间段内这个图是否是二分图。这么简单的问题神犇当然会做了，于是他想考考你。  Input 输入数据的第一行是三个整数n,m,T。  第2行到第m+1行，每行4个整数u,v,start,end。第i+1行的四个整数表示第i条边连接u,v两个点，这条边在start时刻出现，在第end时刻...