FastIO
(lib/00-util/FastIO.cpp)

• View this file on GitHub
• Last update: 2023-05-30 04:32:15+09:00
• Link: View error logs on GitHub Actions

FastIO

• 自作の高速Input
• cinより速いはずだけど、上位層に比べると全然速くない
• writeは遅いので、int128をどうしても出力したい時のみ。

reference

• https://ningenme.net/compro-category/topic/topic_U82LNT/problem

TODO

• char, double, を受け取れるようにする

Verified with

• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-reverse2.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-reverse.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-reverse2.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-rmq.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-rsqrafq.test.cpp
• test/binary-search-tree/WordSizeTreeSet.test.cpp
• test/convolution/DivisorZetaMoebiusTransform-gcd-convolution.test.cpp
• test/convolution/DivisorZetaMoebiusTransform-lcm-convolution.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-1000000007-1.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-998244353-1.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-998244353-2.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-fft.test.cpp
• test/graph/DinicMaxFlow-2.test.cpp
• test/graph/PrimalDualMinCostFlow.test.cpp
• test/math/MontmortNumber.test.cpp
• test/math/Prime-divisor-1.test.cpp
• test/math/Prime-miller-rabin-1.test.cpp
• test/math/Prime-miller-rabin-2.test.cpp
• test/math/Prime-rho-discrete-logarithm.test.cpp
• test/math/Prime-rho.test.cpp
• test/needless/IntegerRangeFrequencyQueryTree-range-freq.test.cpp
• test/needless/RangeFrequencyQueryTree-range-freq.test.cpp
• test/polynomial/FormalPowerSeries-exp.test.cpp
• test/polynomial/FormalPowerSeries-interpolation.test.cpp
• test/polynomial/FormalPowerSeries-inv.test.cpp
• test/polynomial/FormalPowerSeries-log.test.cpp
• test/polynomial/FormalPowerSeries-multi-eval.test.cpp
• test/polynomial/FormalPowerSeries-nth.test.cpp
• test/polynomial/FormalPowerSeries-pow.test.cpp
• test/queue/DoubleEndedPriorityQuere.test.cpp
• test/queue/RadixHeap-64bit.test.cpp
• test/queue/SwagDeque-deque-composite.test.cpp
• test/queue/SwagDeque-queue-composite.test.cpp
• test/queue/SwagQueue-composite.test.cpp
• test/segment-tree/DualSegmentTree-pcq.test.cpp
• test/segment-tree/DynamicSegmentTree-rcq-1.test.cpp
• test/segment-tree/RangeIntegerFrequencyQuerySqrtTree-range-freq.test.cpp
• test/segment-tree/SegmentTree2D-rsq.test.cpp
• test/segment-tree/SortableSegmentTree-rcq.test.cpp
• test/static-range-query/DisjointSparseTable.test.cpp
• test/static-range-query/LongestIncreasingSubsequence-index.test.cpp
• test/static-range-query/LongestIncreasingSubsequence-size.test.cpp
• test/static-range-query/SparseTable.test.cpp
• test/static-range-query/WaveletMatrix-range-freq.test.cpp
• test/static-range-query/WaveletMatrix-range-kth-1.test.cpp
• test/static-range-query/WaveletMatrix-range-kth-2.test.cpp
• test/union-find-tree/UndoUnionFindTree.test.cpp
• test/union-find-tree/UnionFindTree.test.cpp
• test/util/FastIO-int128.test.cpp
• test/util/FastIO-int64.test.cpp

Code

/*
 * @title FastIO
 * @docs md/util/FastIO.md
 */
class FastIO{
private:
    inline static constexpr int ch_0='0';
    inline static constexpr int ch_9='9';
    inline static constexpr int ch_n='-';
    inline static constexpr int ch_s=' ';
    inline static constexpr int ch_l='\n';
    inline static void endline_skip(char& ch) {
        while(ch==ch_l) ch=getchar();
    }
    template<typename T> inline static void read_integer(T &x) {
        int neg=0; char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        if(ch==ch_n) neg=1,ch=getchar();
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
        if(neg) x*=-1;
    }
    template<typename T> inline static void read_unsigned_integer(T &x) {
        char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
    }
    inline static void read_string(string &x) {
        char ch; x="";
        ch=getchar();
        endline_skip(ch);
        for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch);
    }
    inline static char ar[40];
    inline static char *ch_ar;
    template<typename T> inline static void write_integer(T x) {
        ch_ar=ar;
        if(x< 0) putchar(ch_n), x=-x;
        if(x==0) putchar(ch_0);
        for(;x;x/=10) *ch_ar++=(ch_0+x%10);
        while(ch_ar--!=ar) putchar(*ch_ar);
    }
public:
    inline static void read(int &x) {read_integer<int>(x);}
    inline static void read(long long &x) {read_integer<long long>(x);}
    inline static void read(unsigned int &x) {read_unsigned_integer<unsigned int>(x);}
    inline static void read(unsigned long long &x) {read_unsigned_integer<unsigned long long>(x);}
    inline static void read(string &x) {read_string(x);}
    inline static void read(__int128_t &x) {read_integer<__int128_t>(x);}
    inline static void write(__int128_t x) {write_integer<__int128_t>(x);}
    inline static void write(char x) {putchar(x);}
};
#define read(arg) FastIO::read(arg)
#define write(arg) FastIO::write(arg)

#line 1 "lib/00-util/FastIO.cpp"
/*
 * @title FastIO
 * @docs md/util/FastIO.md
 */
class FastIO{
private:
    inline static constexpr int ch_0='0';
    inline static constexpr int ch_9='9';
    inline static constexpr int ch_n='-';
    inline static constexpr int ch_s=' ';
    inline static constexpr int ch_l='\n';
    inline static void endline_skip(char& ch) {
        while(ch==ch_l) ch=getchar();
    }
    template<typename T> inline static void read_integer(T &x) {
        int neg=0; char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        if(ch==ch_n) neg=1,ch=getchar();
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
        if(neg) x*=-1;
    }
    template<typename T> inline static void read_unsigned_integer(T &x) {
        char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
    }
    inline static void read_string(string &x) {
        char ch; x="";
        ch=getchar();
        endline_skip(ch);
        for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch);
    }
    inline static char ar[40];
    inline static char *ch_ar;
    template<typename T> inline static void write_integer(T x) {
        ch_ar=ar;
        if(x< 0) putchar(ch_n), x=-x;
        if(x==0) putchar(ch_0);
        for(;x;x/=10) *ch_ar++=(ch_0+x%10);
        while(ch_ar--!=ar) putchar(*ch_ar);
    }
public:
    inline static void read(int &x) {read_integer<int>(x);}
    inline static void read(long long &x) {read_integer<long long>(x);}
    inline static void read(unsigned int &x) {read_unsigned_integer<unsigned int>(x);}
    inline static void read(unsigned long long &x) {read_unsigned_integer<unsigned long long>(x);}
    inline static void read(string &x) {read_string(x);}
    inline static void read(__int128_t &x) {read_integer<__int128_t>(x);}
    inline static void write(__int128_t x) {write_integer<__int128_t>(x);}
    inline static void write(char x) {putchar(x);}
};
#define read(arg) FastIO::read(arg)
#define write(arg) FastIO::write(arg)

Back to top page