Codeforces Good Bye 2021: 2022 is NEAR ABCDE
A. Integer Diversity
Count the number of figures with different absolute values in all figures. Only when the number of absolute values is less than 2
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int N=200100;
int n,m,t;
int w[N];
int cw[N];
int main(){
cin>>t;
while(t--) ...
Added by jibosh on Wed, 05 Jan 2022 03:22:05 +0200
[construction] Codeforces 1615D X(or)-mas Tree
General idea of the topic
Given a tree with \ (n(1\leq n\leq 2\times 10^5) \) points, some edges of the tree have edge weight and some edges have no edge weight. Given \ (m(1\leq m\leq 2\times 10^5) \) restrictions, whether the number of \ (1 \) bits on the exclusive or sum of edge weights on the path from \ (u \) to \ (v \) is odd or even. Now ...
Added by Jurik on Tue, 04 Jan 2022 14:35:56 +0200
Educational Codeforces Round 112 (Rated for Div. 2)
B. Two Tables
Question meaning: given a rectangle of W*H, there is a blue table in it, with coordinates (left and right vertices) (x1,y1)(x2,y2), and then there is a red table in it. To release the red table, ask you the minimum distance the blue table moves. Idea: you only need to move up, down, left and right in a single direction, because ...
Added by krellen on Mon, 03 Jan 2022 22:09:22 +0200
"Problem solving report" cf1602 (codeworks round #751 (Div. 1 + Div. 2))
This Div2 was a hell of a game, but the harvest was great (the remaining two questions of Div1 really couldn't be filled)
"Game link"
A. Two Subsequences
"Original title link"
Difficulty: \ (800 \) (sign in question)
Main idea of the title:
Split the string \ (S \) into two substrings \ (A \) and \ (B \), so that the dicti ...
Added by subcool on Tue, 09 Nov 2021 08:39:50 +0200
CF468D Tree problem solution
Link.
Codeforces
Luogu
P.S.
It looks so halal. It looks so original. It looks so fresh. The Luogu score is just a purple. It's difficult to open.
woc *3100, fear, fear, claw, claw.
And@ Krimson A practice of Hu together.
Description.
There is a tree with no root and no edge.
The \ (\ {p_i \} \) weight of an array is defined as \ (\ sum\text{dis ...
Added by scottybwoy on Fri, 29 Oct 2021 02:23:21 +0300
Codeforces Round #750 (Div. 2) A.B.C.D
Four Checked-in Issues ~~~
A.Luntik and Concerts
Headline: Given three integers
a
,
b
,
c
a,b,c
a,b,c, which represent the numbers you have now
...
Added by mwood_2k2 on Wed, 27 Oct 2021 19:42:16 +0300
Deltix Round, Summer 2021 (Div. 1 + Div. 2)
Deltix Round, Summer 2021 (Div. 1 + Div. 2)
address
A
Explanation:
Let a < B, the operation can be constructed in one step
(
−
x
,
x
)
(-x,x)
...
Added by SteveFrost on Thu, 02 Sep 2021 03:23:17 +0300