### Swift's blog

By Swift, history, 6 months ago, ,

Hello CF!

I have made a meetup group about competitive programming in Barcelona. We're going to have the first meetup next Thursday, 4th of July! If you're from Barcelona and are interested, please join via the link below:

http://meetu.ps/c/4kkRz/Hbqc4/a

• +20

By Swift, history, 10 months ago, ,

Hi CF community.

I'm registered in Codeforces for more than 6 years. I did ~100 contests, and yet I'm an expert, my max rating is for 4 years ago. I'm not consistent with my training, I train one month before each ICPC regional and then I let it go, after failing to go to world finals I tell myself that I'll train the next year but I don't! I almost never upsolve any problem after the contest ends. I lose my motivation if I do badly in a contest or two (even if it's because of the contest itself).

See, I recognize the problem and I also know the solution: train consistently, upsolve, etc. I always knew the solution and yet I never act on it.

But enough is enough. I have only 2 more years to participate in ICPC. I have decided to train harder and more consistent, but in order to stick to my goal, I want to share it. (although it's not a great idea, I think it works for me)

I want to become an International Master by the end of 2019, meaning I want to have a max rating >= 2300. I know it is a really really hard goal to achieve in a year, but I want to commit, no matter what.

I'm starting with a rating of ~1800, and I want to post contents regularly to update you about my training, my progress and the cool ideas/problems that I come across during my training, so stay tuned.

Any hint, tip or advice is highly appreciated.

Cheers!

• +164

By Swift, history, 11 months ago, ,

# Competitive C++ Manifesto: A Style Guide

There are many style guides for C++ out there, but we can't really use them as competitive programmers. We just want to write our code correctly as fast as possible! Trying to hack people here on codeforces, I realized there is a need for a style guide! Our goal is to write correct, fast, clear and consistent code.

#### Disclaimer

This is not a rulebook. You can integrate parts of it into your coding style. Don't overthink it, especially during a contest!

I'm going to use this guide for myself and to teach my students. I'm planning to make some good stuff in the future following these principles! Stay tuned!

## Compiler

Make use of C++17. Use -Wall -Wextra -Wshadow flags for compilation, and try to eliminate all of the warning messages, this will prevent you from having some silly bugs. There are more debugging flags like -fsanitize=undefined which helps you eliminate bugs such as array out-of-range access and integer overflow during runtime. For more information, check out "Read More" section.

## Naming

C++ libraries use snake_case for functions and classes, in order to differentiate the user-defined code from the standard library, we will use CamelCase.

• Types use UpperCamelCase: Point, SegTree
• Functions and variables use lowerCamelCase: someMethod, someVariable
• Macros and constants use all capital letters seperated by _: SOME_MACRO, MAX_N, MOD
• Use meaningful names or at least meaningful enough for you.
###### Example
#define LOCAL
const double PI = 3.14;

struct MyPoint {
int x, y;
bool someProperty;

int someMethod() {
return someProperty ? x : y;
}
};


#### Note

Using snake_case is fine, but be consistent!

In competitive programming, you usually don't want to write long comments, but in case you do want to write some comments, write them using // instead of /* */. Using // enables you to comment out a chunk of code with /* */ while debugging, and /* /* ... */ */ is a bug!

###### Example
/* commenting out a block of code - no problem!

// some comment about the function below...
void someFunction() {
// do something
}

*/


## Spacing

Control flow statements are if / else / for / while / ...

• Indent using 2 or 4 spaces uniformly. Avoid using tabs since it might make the code stretched out in different websites (e.g. Codeforces) and also in print (e.g. ICPC). Set your editor to emit spaces when you hit the tab key.
• Braces always open on the same line but close on a new line.
• Preferably always use braces for control flow statement blocks even if it's currently only one line.
• else should start on the same line after closing brace of if block.
• Keep lines a reasonable length, some say 80 columns!
• There should be exactly one blank line between methods. This helps you to organize your code better.
• There should be no blank line after an opening brace or before a closing brace.
• Binary operations should be spaced from both sides.
• Unary operations should only be spaced from the left side.
• Brackets <> [] {} are a part of their identifier like a[5], vector<int> or pair{1, 2}.
• Parentheses should only be spaced from outside like (-a[3] + b) * (c + d).
• Semicolons and commas should only be spaced from the right side.
• Question marks and colons should be spaced from both sides (unlike English!). The only exceptions are labels like public: or switch cases case 10:.
• There should not be any extra spaces at the end of each line.
• Add a single newline character at the end of the file.
• There should be exactly one space after control flow statements like if (flag).
• In contrast to control flow statements, function calls should not be spaced like func(arg).
• Preprocess statements should be written like #define SOME_MACRO and #include <iostream>.
• Templates should be written like template <typename T> and a new line.
• Scope resolution operator :: is a part of the identifier and should not be spaced.
• Pointer and reference are a part of the type, space accordingly! Like int* ptr and const string& str. To avoid bugs, declare only one pointer per line.
• . and -> operator should not be spaced. When -> is used to show return type (like in lambda expressions) it should be spaced from both sides.
• Lambda expressions should be written like [](int x) -> int { return x + 1; }. The return type can be omitted most of the times. Feel free to expand the body exactly like a function if it has more than 1 line of code.
• When overloading operators, treat them like functions, no spacing in the name like bool operator!();
• Ellipsis ... should only be spaced from the left side.
###### Example
#include <bits/stdc++.h>

using namespace std;

const int DIFF = 10;

template <typename T>
struct Point {
T x, y;

Point(T _x, T _y) : x(_x), y(_y) {}

friend ostream& operator<<(ostream& os, const Point& p) {
return os << "(" << p.x << ", " << p.y << ")";
}
};

int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
vector<Point<int>> v;
for (int i = 0; i < 5; ++i) {
v.push_back({i, i + DIFF});
}
for (auto p : v) {
if (p.x + DIFF == p.y) {
cout << p << '\n';
} else {
cout << "huh!?\n"; // will never get printed!
}
}
}

###### Output
(0, 10)
(1, 11)
(2, 12)
(3, 13)
(4, 14)


## Competitive Coding Recommendations

• Use #include <bits/stdc++.h> instead of many includes.
• Use using namespace std; instead of typing std:: every time.
• Use using instead of typedef, for example using ll = long long;. Rationale: It's more consistent with the style of modern C++.
• Use struct instead of class. Rationale: It defaults to public, and you don't need encapsulation in competitive programming!
• Don't use too many macros but don't be afraid of using macros! Rationale: It's not easy to debug and read a code full of ugly macros. but we're hackers after all!
• Use const for defining a constant instead of #define. Rationale: consts have a type, and they are evaluated at compile time.
• To avoid bugs, you can use curly braces for each case of switch statement.
• Use auto to increase readability and decrease code size.
• Use braced initializer lists.
• Use emplace and emplace_back for containers when dealing with pairs and tuples. Rationale: (elem1, elem2, ...) instead of ({elem1, elem2, ...}).
• Use lambda functions! They're especially useful when passing functions as arguments like in sort. Don't repeat yourself, use lambda functions in your code instead of copy/pasting.
• Use nullptr instead of NULL or 0.
• Boolean values are true and false!
• Use ios::sync_with_stdio(false); and cin.tie(nullptr); for a faster I/O using cin/cout.
• Use builtin functions starting with __builtin.
• GCD and LCM are available in C++17 under gcd and lcm.
• Use C++11 for-each style for loops for (auto& elem : vec).
• Use C++17 binding style like for (auto& [key, val] : dic) and auto [x, y] = myPoint;
• Use C++17 template argument deduction pair p{1, 2.5}; instead of pair<int, double> p{1, 2.5};.
• If you have a lot of nested loops and conditions, refactor! You probably should be using functions.
• Never use goto! But be brave enough to use goto when you want to break from several nested loops (in case you just can't refactor it)!
• Some websites like codeforces use the flag -DONLINE_JUDGE to compile your code, this means that you can remove your cerrs or your debug functions automatically or redirect input/output to file instead of stdin/stdout, etc.
#ifdef ONLINE_JUDGE
#define cerr if (false) cerr
#endif
// Alternatively this can be done using a local -DLOCAL flag

• Prefer using normal operators like !, &&, ||, ^, ... instead of their alternative representations not, and, or, xor, .... Rationale: We're not coding in python!
• Break down your code into different smaller functions. Your code will be cleaner and easier to debug.
• Don't try to be too clever!
• Don't reinvent the wheel!Make use of standard library!
• Use common sense and be consistent!

## Contribution

Any suggestions are welcome. You can contribute to this post by commenting or using GitHub.

Contributors so far: ntrung03, SharpC

• +251

By Swift, history, 2 years ago, ,

I actually got accepted on most of these problems, but they're shown as "red", why is that?

• +49

By Swift, 3 years ago, ,

There are infinite number of people, each one has a whether red or blue hat. Everyone can see everyone's hat but can't see their own. Is it possible that with a strategy, only a finite number of people guess their hat color wrong?

• +48

By Swift, 5 years ago, ,

Hi codeforces community.

I thought there is no good 2-SAT tutorial in the internet, so I decided to write one.

2-SAT is a special case of boolean satisfiability.

Good question! Boolean satisfiability or just SAT determines whether we can give values (TRUE or FALSE only) to each boolean variable in such a way that the value of the formula become TRUE or not. If we can do so, we call formula satisfiable, otherwise we call it unsatisfiable. Look at the example below:

f = A ∧ ¬B, is satisfiable, cause A = TRUE and B = FALSE makes it TRUE.

but g = A ∧ ¬A, is unsatisfiable, look at this table:

 A ¬A A ∧ ¬A TRUE FALSE FALSE FALSE TRUE FALSE

As you can see g is unsatisfiable cause whatever values of its boolean variables are, g is FALSE.

Note: ¬ in ¬X is boolean not operation. in X ∧ Y is boolean and operation and finally in X ∨ Y is boolean or operation.

SAT is a NP-Complete problem, though we can solve 1-SAT and 2-SAT problems in a polynomial time.

#### 1-SAT

Note: This doesn't really exist, I define it cause it help understanding 2-SAT.

Consider f = x1 ∧ x2 ∧ ...  ∧ xn.

Problem: Is f satisfiable?

Solution: Well 1-SAT is an easy problem, if there aren't both of xi and ¬xi in f, then f is satisfiable, otherwise it's not.

#### 2-SAT

Consider f = (x1 ∨ y1) ∧ (x2 ∨ y2) ∧ ...  ∧ (xn ∨ yn).

Problem: Is f satisfiable?

But how to solve this problem? xi ∨ yi and and are all equivalent. So we convert each of (xi ∨ yi) s into those two statements.

Now consider a graph with 2n vertices; For each of (xi ∨ yi) s we add two directed edges

1. From ¬xi to yi

2. From ¬yi to xi

f is not satisfiable if both ¬xi and xi are in the same SCC (Strongly Connected Component) (Why?) Checking this can be done with a simple Kosaraju's Algorithm.

Assume that f is satisfiable. Now we want to give values to each variable in order to satisfy f. It can be done with a topological sort of vertices of the graph we made. If ¬xi is after xi in topological sort, xi should be FALSE. It should be TRUE otherwise.

Some problems:

#### Pseudo Code

func dfsFirst(vertex v):
marked[v] = true
for each vertex u adjacent to v do:
if not marked[u]:
dfsFirst(u)
stack.push(v)

func dfsSecond(vertex v):
marked[v] = true
for each vertex u adjacent to v do:
if not marked[u]:
dfsSecond(u)
component[v] = counter

for i = 1 to n do:
for i = 1 to n do:
if not marked[x[i]]:
dfsFirst(x[i])
if not marked[y[i]]:
dfsFirst(y[i])
if not marked[not x[i]]:
dfsFirst(not x[i])
if not marked[not y[i]]:
dfsFirst(not y[i])

set all marked values false
counter = 0
flip directions of edges // change v -> u to u -> v

while stack is not empty do:
v = stack.pop
if not marked[v]
counter = counter + 1
dfsSecond(v)

for i = 1 to n do:
if component[x[i]] == component[not x[i]]:
it is unsatisfiable
exit
if component[y[i]] == component[not y[i]]:
it is unsatisfiable
exit

it is satisfiable
exit


• +144

By Swift, 5 years ago, ,

I see lots of programmers write code like this one:

pair<int, int> p;
vector<int> v;
// ...
p = make_pair(3, 4);
v.push_back(4); v.push_back(5);


while you can just do this:

pair<int, int> p;
vector<int> v;
// ...
p = {3, 4};
v = {4, 5};