oj.uz

답안 #334701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334701 2020-12-09T20:01:13 Z 12tqian Long Mansion (JOI17_long_mansion) C++17
10 / 100
 3000 ms 7976 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int) (x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define resz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define f1r(i, a, b) for(int i = (a); i < (b); ++i)
#define f0r(i, a) f1r(i, 0, a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto& a : x)

mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> using V = vector<T>;

#ifdef LOCAL
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define dbg(...) 17;
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) { bool f = true; os << "{"; for (const auto &x : c) { if (!f) os << ", "; f = false; os << x; } return os << "}"; }
template<typename T> void debug(string s, T x) { cerr << s << " = " << x << "\n"; }
template<typename T, typename... Args> void debug(string s, T x, Args... args) { cerr << s.substr(0, s.find(',')) << " = " << x << " | "; debug(s.substr(s.find(',') + 2), args...); }

constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1, T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, int SZ> void re(array<T, SZ>& a);
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) {
        re(t); re(ts...); }
    template<class T> void re(complex<T>& x) { T a, b; re(a, b); x = cd(a, b); }
    template<class T1, class T2> void re(pair<T1, T2>& p) { re(p.f, p.s); }
    template<class T> void re(vector<T>& a) { F0R(i, sz(a)) re(a[i]); }
    template<class T, int SZ> void re(array<T, SZ>& a) { F0R(i, SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    template<class T1, class T2> void pr(const pair<T1, T2>& x);
    template<class T> void pr(const T& x);
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
        pr(t); pr(ts...); }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{", x.f, ", ", x.s, "}"); }
    template<class T> void pr(const T& x) {
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst ? ", " : "", a), fst = 0;
        pr("}"); }
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); }
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(), "r", stdin); }
    void setOut(string s) { freopen(s.c_str(), "w", stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s + ".in"), setOut(s + ".out"); }
    }
}

using namespace io;

const int MOD = 1e9+7;
const ld PI = acos((ld) -1);

typedef std::decay <decltype(MOD)>::type mod_t;
struct mi {
    mod_t val;
    explicit operator mod_t() const { return val; }
    mi() { val = 0; }
    mi(const long long& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD; }
    friend std::istream& operator >> (std::istream& in, mi& a) {
        long long x; std::cin >> x; a = mi(x); return in; }
    friend std::ostream& operator << (std::ostream& os, const mi& a) { return os << a.val; }
    friend void pr(const mi& a) { pr(a.val); }
    friend void re(mi& a) { ll x; re(x); a = mi(x); }
    friend bool operator == (const mi& a, const mi& b) { return a.val == b.val; }
    friend bool operator != (const mi& a, const mi& b) { return !(a == b); }
    friend bool operator < (const mi& a, const mi& b) { return a.val < b.val; }
    friend bool operator > (const mi& a, const mi& b) { return a.val > b.val; }
    friend bool operator <= (const mi& a, const mi& b) { return a.val <= b.val; }
    friend bool operator >= (const mi& a, const mi& b) { return a.val >= b.val; }
    mi operator - () const { return mi(-val); }
    mi& operator += (const mi& m) {
        if ((val += m.val) >= MOD) val -= MOD;
        return *this; }
    mi& operator -= (const mi& m) {
        if ((val -= m.val) < 0) val += MOD;
        return *this; }
    mi& operator *= (const mi& m) { val = (long long) val * m.val % MOD;
        return *this; }
    friend mi pow(mi a, long long p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p & 1) ans *= a;
        return ans; }
    friend mi inv(const mi& a) { assert(a != 0); return pow(a, MOD - 2); }
    mi& operator /= (const mi& m) { return (*this) *= inv(m); }
    friend mi operator + (mi a, const mi& b) { return a += b; }
    friend mi operator - (mi a, const mi& b) { return a -= b; }
    friend mi operator * (mi a, const mi& b) { return a *= b; }
    friend mi operator / (mi a, const mi& b) { return a /= b; }
};
typedef pair<mi, mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int main() {
    // setIO("");
    int n; re(n);
    vector<vi> a(n);
    vi c(n);
    f0r(i, n-1) re(c[i]), c[i]--;
    c.back() = -1;
    vi b(n);
    f0r(i, n) {
        re(b[i]);
        a[i].resz(b[i]);
        f0r(j, b[i]) re(a[i][j]), a[i][j]--;
    }
    vi L(n), R(n);
    f0r(i, n) {
        vi in(n);
        auto add = [&](int id) {
            for (int key : a[id]) in[key] = 1;
        };
        int l = i;
        int r = i;
        add(i);
        while (true) {
            if (l && in[c[l-1]]) {
                l--;
                add(l);
                continue;
            } 
            if (r < n-1 && in[c[r]]) {
                r++;
                add(r);
                continue;
            }
            break;
        }
        L[i] = l;
        R[i] = r;
    }
    int q; re(q);
    while (q--) {
        int l, r; re(l, r);
        l--, r--;
        if (L[l] <= r && r <=  R[l]) {
            ps("YES"); 
        } else ps("NO");
    }
    return 0;
}

Compilation message

long_mansion.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
long_mansion.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
long_mansion.cpp: In function 'void io::setIn(std::string)':
long_mansion.cpp:154:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  154 |     void setIn(string s) { freopen(s.c_str(), "r", stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
long_mansion.cpp: In function 'void io::setOut(std::string)':
long_mansion.cpp:155:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  155 |     void setOut(string s) { freopen(s.c_str(), "w", stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 512 KB Output is correct
2 Correct 45 ms 640 KB Output is correct
3 Correct 104 ms 748 KB Output is correct
4 Correct 19 ms 620 KB Output is correct
5 Correct 51 ms 620 KB Output is correct
6 Correct 25 ms 620 KB Output is correct
7 Correct 23 ms 620 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 512 KB Output is correct
2 Correct 45 ms 640 KB Output is correct
3 Correct 104 ms 748 KB Output is correct
4 Correct 19 ms 620 KB Output is correct
5 Correct 51 ms 620 KB Output is correct
6 Correct 25 ms 620 KB Output is correct
7 Correct 23 ms 620 KB Output is correct
8 Correct 1384 ms 6508 KB Output is correct
9 Correct 1399 ms 6620 KB Output is correct
10 Correct 1428 ms 6984 KB Output is correct
11 Correct 1471 ms 7276 KB Output is correct
12 Correct 1343 ms 6124 KB Output is correct
13 Correct 1377 ms 6636 KB Output is correct
14 Correct 1361 ms 6628 KB Output is correct
15 Correct 1378 ms 6860 KB Output is correct
16 Correct 1397 ms 6432 KB Output is correct
17 Correct 1369 ms 6764 KB Output is correct
18 Correct 1379 ms 6764 KB Output is correct
19 Correct 1397 ms 7020 KB Output is correct
20 Correct 1391 ms 6764 KB Output is correct
21 Correct 1377 ms 6628 KB Output is correct
22 Correct 1376 ms 6508 KB Output is correct
23 Correct 1369 ms 6636 KB Output is correct
24 Correct 1375 ms 6636 KB Output is correct
25 Correct 1375 ms 6892 KB Output is correct
26 Correct 1365 ms 6564 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3062 ms 7976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 512 KB Output is correct
2 Correct 45 ms 640 KB Output is correct
3 Correct 104 ms 748 KB Output is correct
4 Correct 19 ms 620 KB Output is correct
5 Correct 51 ms 620 KB Output is correct
6 Correct 25 ms 620 KB Output is correct
7 Correct 23 ms 620 KB Output is correct
8 Correct 1384 ms 6508 KB Output is correct
9 Correct 1399 ms 6620 KB Output is correct
10 Correct 1428 ms 6984 KB Output is correct
11 Correct 1471 ms 7276 KB Output is correct
12 Correct 1343 ms 6124 KB Output is correct
13 Correct 1377 ms 6636 KB Output is correct
14 Correct 1361 ms 6628 KB Output is correct
15 Correct 1378 ms 6860 KB Output is correct
16 Correct 1397 ms 6432 KB Output is correct
17 Correct 1369 ms 6764 KB Output is correct
18 Correct 1379 ms 6764 KB Output is correct
19 Correct 1397 ms 7020 KB Output is correct
20 Correct 1391 ms 6764 KB Output is correct
21 Correct 1377 ms 6628 KB Output is correct
22 Correct 1376 ms 6508 KB Output is correct
23 Correct 1369 ms 6636 KB Output is correct
24 Correct 1375 ms 6636 KB Output is correct
25 Correct 1375 ms 6892 KB Output is correct
26 Correct 1365 ms 6564 KB Output is correct
27 Execution timed out 3062 ms 7976 KB Time limit exceeded
28 Halted 0 ms 0 KB -