QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#523810#9155. 集合peaneval_kala100 ✓232ms52208kbC++239.3kb2024-08-18 18:30:312024-08-18 18:30:31

Judging History

你现在查看的是最新测评结果

  • [2024-08-18 18:30:31]
  • 评测
  • 测评结果:100
  • 用时:232ms
  • 内存:52208kb
  • [2024-08-18 18:30:31]
  • 提交

answer

#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) { x = min(x, y); }
template <typename T>
inline void chkmax(T &x, T y) { x = max(x, y); }
namespace FastIO
{
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined (_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
    inline char gc() { return getchar(); }
    inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
    INLINE_V constexpr int _READ_SIZE = 1 << 18;
    INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
    inline char gc()
    {
        if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
        {
            _read_ptr = _read_buffer;
            _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
            if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
        }
        return *_read_ptr++;
    }
#else
    INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
    inline char gc() { return *_read_ptr++; }
#endif
    INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
    INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
    inline void pc(char c)
    {
        *_write_ptr++ = c;
        if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
        {
            fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
            _write_ptr = _write_buffer;
        }
    }
    INLINE_V struct _auto_flush
    {
        ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
    }	_auto_flush;
#endif
#ifdef CHK_EOF
    inline bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
    inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
    inline bool _isdigit(char c) { return c & 16; }
    inline bool _isgraph(char c) { return c > 32; }
#endif
    template < class T >
    INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
    template < class T >
    INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
    template < class T >
    INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
    template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
    template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
    template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
    template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
    inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
    inline void read_cstr(char *s)
    {
        char c = gc(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) *s++ = c, c = gc();
        *s = 0;
    }
    inline void read(string &s)
    {
        char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) s.push_back(c), c = gc();
    }
#ifdef IN_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void read(T &x)
    {
        char c = gc(); bool f = true; x = 0;
        while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
        if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
        else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void read(T &x)
    {
        char c = gc(); while ( !_isdigit(c) ) c = gc();
        x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
    }
    inline void write(char c) { pc(c); }
    inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
    inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
        else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
        while ( digits ) pc(buffer[--digits]);
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
        while ( digits ) pc(buffer[--digits]);
    }
    template < int N > struct _tuple_io_helper
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
    };
    template <> struct _tuple_io_helper < 1 >
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
    };
    template < class ...T >
    inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
    template < class ...T >
    inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
    template < class T1, class T2 >
    inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
    template < class T1, class T2 >
    inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
    template < class T1, class ...T2 >
    inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
    template < class ...T >
    inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
    template < class T1, class ...T2 >
    inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
    template < class ...T >
    inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
    template < class T >
    inline void print(const T &x) { write(x); }
    inline void print_cstr(const char *x) { write_cstr(x); }
    template < class T1, class ...T2 >
    inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
    template < class ...T >
    inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
    inline void println() { pc(10); }
    inline void println_cstr() { pc(10); }
    template < class ...T >
    inline void println(const T &...x) { print(x...), pc(10); }
    template < class ...T >
    inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
const ull qwq = ull(-1) >> 1;
const int N = 1e6 + 10;
int n, m, q;
inline ull qpw(ull a, ull b) {
    ull ans = 1;
    while (b) {
        if (b & 1) ans = ans * a;
        a = a * a, b >>= 1;
    }
    return ans;
}
mt19937_64 rng(random_device{}());
ull r[N], ax[N], bx[N];
array<int, 3> a[N], b[N];
ull dx = 1, dy = 1;
inline void ins(int x) {
    for (int i = 0; i < 3; i++) {
        dx *= qpw(ax[a[x][i]], qwq);
        ax[a[x][i]] += r[x];
        dx *= ax[a[x][i]];
    }
    for (int i = 0; i < 3; i++) {
        dy *= qpw(bx[b[x][i]], qwq);
        bx[b[x][i]] += r[x];
        dy *= bx[b[x][i]];
    }
}
inline void del(int x) {
    for (int i = 0; i < 3; i++) {
        dx *= qpw(ax[a[x][i]], qwq);
        ax[a[x][i]] -= r[x];
        dx *= ax[a[x][i]];
    }
    for (int i = 0; i < 3; i++) {
        dy *= qpw(bx[b[x][i]], qwq);
        bx[b[x][i]] -= r[x];
        dy *= bx[b[x][i]];
    }
}
vector<pair<int, int> > vec[N];
bool ans[N];
int main() {
    read(n, m, q);
    for (int i = 1; i <= m; i++) ax[i] = bx[i] = 1;
    for (int i = 1; i <= n; i++) r[i] = (rng() >> 1) << 1;
    for (int i = 1; i <= n; i++) read(a[i][0], a[i][1], a[i][2]);
    for (int i = 1; i <= n; i++) read(b[i][0], b[i][1], b[i][2]);
    for (int i = 1; i <= q; i++) {
        int u, v;
        read(u, v), vec[v].emplace_back(u, i);
    }
    int l = 1;
    for (int r = 1; r <= n; r++) {
        ins(r);
        while (dx != dy) del(l++);
        for (auto [x, id] : vec[r]) ans[id] = x >= l; 
    }
    for (int i = 1; i <= q; i++) println(ans[i] ? "Yes"s : "No"s);
    return 0;
}

Details


Pretests

Pretest #1:

score: 5
Accepted
time: 0ms
memory: 14128kb

Pretest #2:

score: 5
Accepted
time: 3ms
memory: 15972kb

Pretest #3:

score: 5
Accepted
time: 3ms
memory: 13896kb

Pretest #4:

score: 5
Accepted
time: 3ms
memory: 13832kb

Pretest #5:

score: 5
Accepted
time: 4ms
memory: 15940kb

Pretest #6:

score: 5
Accepted
time: 4ms
memory: 15936kb

Pretest #7:

score: 5
Accepted
time: 0ms
memory: 15884kb

Pretest #8:

score: 5
Accepted
time: 3ms
memory: 15972kb

Pretest #9:

score: 5
Accepted
time: 9ms
memory: 16392kb

Pretest #10:

score: 5
Accepted
time: 9ms
memory: 16424kb

Pretest #11:

score: 5
Accepted
time: 136ms
memory: 32656kb

Pretest #12:

score: 5
Accepted
time: 141ms
memory: 32732kb

Pretest #13:

score: 5
Accepted
time: 5ms
memory: 14180kb

Pretest #14:

score: 5
Accepted
time: 2ms
memory: 13912kb

Pretest #15:

score: 5
Accepted
time: 24ms
memory: 26276kb

Pretest #16:

score: 5
Accepted
time: 28ms
memory: 26296kb

Pretest #17:

score: 5
Accepted
time: 16ms
memory: 16416kb

Pretest #18:

score: 5
Accepted
time: 13ms
memory: 16620kb

Pretest #19:

score: 5
Accepted
time: 200ms
memory: 40100kb

Pretest #20:

score: 5
Accepted
time: 207ms
memory: 52208kb

Final Tests

Test #1:

score: 5
Accepted
time: 4ms
memory: 13932kb

Test #2:

score: 5
Accepted
time: 4ms
memory: 13868kb

Test #3:

score: 5
Accepted
time: 2ms
memory: 13840kb

Test #4:

score: 5
Accepted
time: 4ms
memory: 13904kb

Test #5:

score: 5
Accepted
time: 0ms
memory: 13804kb

Test #6:

score: 5
Accepted
time: 0ms
memory: 13844kb

Test #7:

score: 5
Accepted
time: 0ms
memory: 13912kb

Test #8:

score: 5
Accepted
time: 0ms
memory: 13792kb

Test #9:

score: 5
Accepted
time: 3ms
memory: 18128kb

Test #10:

score: 5
Accepted
time: 4ms
memory: 16600kb

Test #11:

score: 5
Accepted
time: 144ms
memory: 29148kb

Test #12:

score: 5
Accepted
time: 144ms
memory: 31408kb

Test #13:

score: 5
Accepted
time: 0ms
memory: 15928kb

Test #14:

score: 5
Accepted
time: 5ms
memory: 14056kb

Test #15:

score: 5
Accepted
time: 32ms
memory: 26592kb

Test #16:

score: 5
Accepted
time: 32ms
memory: 26820kb

Test #17:

score: 5
Accepted
time: 10ms
memory: 14368kb

Test #18:

score: 5
Accepted
time: 16ms
memory: 16420kb

Test #19:

score: 5
Accepted
time: 205ms
memory: 38120kb

Test #20:

score: 5
Accepted
time: 232ms
memory: 50600kb

Extra Test:

score: 0
Extra Test Passed