qq_41648012的博客

E. Middle Duplication1.先找到所有需要<重复>的节点；2.对树上的节点进行标记，上面部分为可以<重复>的节点，下面部分为不能<重复>的节点。#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include<stdio.h>#include<math.h>#include<algorithm>#include<string.h&gt

1. 树状数组[1, 2, 3… n]; 查询[l, r];int n;ll a[MAX_N + 1];ll bit[MAX_N + 1];ll query(int l, int r) { ll res = 0; while (r >= l) { res = gcd(res, a[r]); r--; while (r - (r & -r) >= l) { res = gcd(res, bit[r]); r -= r & -r; } }

题目链接：https://codeforces.com/contest/1373/problem/E枚举结果的后两位，从[0,100 - k），保证最后一个数不会对百位产生进位影响（至于为什么这样，打表观测后，猜测不会有进位到百位的情况）；最后两位确定了，然后这k+1个数的其他位是相同的，用x9999…填充，x可以计算得出；比较取出最小的值即可；ac代码：#define _CRT_SECURE_NO_WARNINGS#include<iostream>#include<std

比赛链接：https://codeforces.com/contest/1369A.FashionabLee判断边数是否为4的倍数#include <iostream> using namespace std; int main(){ int T; cin>>T; while(T--){ int n; cin>>n; if(n%4==0)cout<<"YES"<&lt

Problem DescriptionN sticks are arranged in a row, and their lengths are a1,a2,…,aN.There are Q querys. For i-th of them, you can only use sticks between li-th to ri-th. Please output the maximum ci...

DescriptionGiven two positive integers a and b, we can easily calculate the greatest common divisor (GCD) and the least common multiple (LCM) of a and b. But what about the inverse? That is: given GC...

题目描述Your are given an undirect connected graph.Every edge has a cost to pass.You should choose a path from S to T and you need to pay for all the edges in your path. However, you can choose at most k...

#include<bits/stdc++.h>using namespace std;const int MAX_N=500+5;int n,m;int a[MAX_N+1][MAX_N+1];int b1[MAX_N+1],b2[MAX_N+1];int q1[MAX_N+1],q2[MAX_N+1];void solve(){ int res=0; ...

传送门#include<bits/stdc++.h>using namespace std; typedef long long ll; const int INF=0x3f3f3f3f;const int MAX_N=50000+5;const int MAX_V=50000+5;const int M=998244353; int n;int a[MAX_N...

传送门#include<bits/stdc++.h>using namespace std;#define fi first#define se secondtypedef long long ll;typedef pair<int,int> P;const int INF=0x3f3f3f3f;const int MAX_N=400000+5;con...

#include<bits/stdc++.h>using namespace std;typedef long long ll;const int INF=0x3f3f3f3f;const int MAX_N=300+5;const int MAX_M=506+5;ll a,b,m;ll mod_pow(ll x,ll n,ll mod,bool &t){...

传送门DescriptionFarmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to t...

Problem DescriptionYou have an array: a1, a2, , an and you must answer for some queries.For each query, you are given an interval [L, R] and two numbers p and K. Your goal is to find the Kth closes...

Problem Description传送门zz6d likes reading very much, so he bought a lot of books. One day, zz6d brought n books to a classroom in school. The books of zz6d is so popular that K students in the classr...

Problem Description传送门Farmer John keeps a website called ‘FansBlog’ .Everyday , there are many people visited this blog.One day, he find the visits has reached P , which is a prime number.He thinks ...

题目链接：http://codeforces.com/gym/102220/problem/EMinimum Spanning TreeIn the mathematical discipline of graph theory, the line graph of a simple undirected weighted graph G is another simple undirecte...

题目：Taylor is wandering in a milk candy store. The store has m types of sweets and there are n sweets in the store. The i-th sweet has the value of ai, and it is of type bi.Taylor is planning to buy ...

Description“Fat and docile, big and dumb, they look so stupid, they aren’t muchfun…”-Cows with Guns by Dana LyonsThe cows want to prove to the public that they are both smart and fun. In order to ...

DescriptionBessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new university called The University of W...

ProblemYou are given a tree T that consists of N nodes. Each node is numbered from 1 to N, and node 1 is always the root node of T. Consider the following two operations on T:M v: (Mark) Mark node ...

题目链接：http://codeforces.com/gym/102220/problem/HAt the main street of Byteland, there will be built n skyscrapers, standing sequentially one next to other. If look leftside right, sequence of their he...

题目描述小阳手中一共有 n 个贝壳，每个贝壳都有颜色，且初始第 i 个贝壳的颜色为 coli。现在小阳有 3 种操作：1 l r x：给 [l,r] 区间里所有贝壳的颜色值加上 x 。2 l r：询问 [l,r] 区间里所有相邻贝壳 颜色值的差（取绝对值） 的最大值（若 l=r 输出 0）。3 l r ：询问 [l,r]区间里所有贝壳颜色值的最大公约数。输入描述:第一行输入两个正整数 ...

Description传送门根据一些书上的记载，上帝的一次失败的创世经历是这样的：第一天， 上帝创造了一个世界的基本元素，称做“元”。第二天， 上帝创造了一个新的元素，称作“α”。“α”被定义为“元”构成的集合。容易发现，一共有两种不同的“α”。第三天， 上帝又创造了一个新的元素，称作“β”。“β”被定义为“α”构成的集合。容易发现，一共有四种不同的“β”。第四天， 上帝创造了新的元素...

Problem Description传送门Master QWsin is dating with Sindar. And now they are in a restaurant, the restaurant has n dishes in order. For each dish, it has a delicious value ai. However, they can only o...

#include <iostream>#include<stdio.h>#include<math.h>#include<algorithm>#include<string>#include<cstring>#include<queue>#include<map>#include<...

题目链接：http://codeforces.com/gym/102220/problem/GRadar ScannerThere are