Блог пользователя Qualified

Автор Qualified, 4 года назад, По-английски

Why not use

#include <bits/extc++.h>

It has all of the policy based data structure "includes" in these articles Implicit cartesian tree in GNU C++ STL C++ STL: Policy based data structures and everything included in

#include <bits/stdtr1c++.h>

and

#include <bits/stdc++.h>

Also, with precompiled headers, it runs in about the same time as

#include <bits/stdc++.h>

Link to the file of

#include <bits/extc++.h>
  • Проголосовать: нравится
  • +38
  • Проголосовать: не нравится

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Auto comment: topic has been updated by Qualified (previous revision, new revision, compare).

»
4 года назад, # |
  Проголосовать: нравится -29 Проголосовать: не нравится

I'm not sure if anyone really uses policy based data structures, it is quite easy to write cartesian tree or segment tree etc. if you had done it enough times, or even write once, copypaste and modificate to the particular problem you solve. Of course you are welcome to do it if you want. Although it is quite feasible not to use bits/stdc++.h to reduce compile time (or even use autoimport tools, but I'm not familiar with such for c++)

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

I used it for some days, then stopped it after getting compilation error in vjudge on an old atcoder problem: Compilation error vs Accepted (You need to login to vjudge to view the source codes, they are same, except bits/extc++.h vs bits/stdc++.h).