oj.uz

답안 #679253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679253 2023-01-07T23:23:11 Z Joshua_Andersson Political Development (BOI17_politicaldevelopment) C++14
100 / 100
 469 ms 33968 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 1

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 1
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template<typename T> inline void eraseOne(multiset<T>& mSet, T k) { auto itr = mSet.find(k); if (itr != mSet.end()) { mSet.erase(itr); } }
template<typename T, typename U> inline T first(U& a) { return *begin(a); }
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T> inline T randint(T lo, T hi) { return uniform_int_distribution<T>(lo, hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<T>((int)0, v.size() - 1)(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;


int32_t main()
{
    fast();

    dread2(int, n, k);

    vector<fast_set<int>> edges(n);
    std::priority_queue<int> pq;
    rep(i, n)
    {
        dread(int, s);
        if (s <= k) pq.push(i);
        rep(j, s)
        {
            dread(int, o);
            edges[i].insert(o);
        }
    }

    int ans = 0;
    vb vis(n);
    while (pq.size())
    {
        int u = pq.top();
        pq.pop();
        if (vis[u]) continue;
        vis[u] = 1;

        rep(mask, 1 << edges[u].size())
        {
            int i = 0;
            bool works = true;
            repe(e, edges[u])
            {
                if (mask&(1<<i))
                {
                    int j = 0;
                    repe(e2, edges[u])
                    {
                        if (i!=j&&mask & (1 << j))
                        {
                            if (!setcontains(edges[e2], e))
                            {
                                works = false;
                                goto nope;
                            }
                        }
                        j++;
                    }
                }
                i++;
            }
        nope:;

            if (works)
            {
                ans = max(ans, (int)popcount(mask));
            }
        }

        repe(edge, edges[u])
        {
            edges[edge].erase(u);
            if (edges[edge].size() <= k)
            {
                pq.push(edge);
            }
        }
    }
    cout << ans+1;

    quit;
}

Compilation message

politicaldevelopment.cpp: In function 'int32_t main()':
politicaldevelopment.cpp:223:36: warning: comparison of integer expressions of different signedness: '__gnu_pbds::detail::gp_ht_set<long long int, __gnu_pbds::null_type, chash, std::equal_to<long long int>, std::allocator<char>, false, __gnu_pbds::direct_mask_range_hashing<>, __gnu_pbds::linear_probe_fn<long unsigned int>, __gnu_pbds::hash_standard_resize_policy<__gnu_pbds::hash_exponential_size_policy<>, __gnu_pbds::hash_load_check_resize_trigger<>, false, long unsigned int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  223 |             if (edges[edge].size() <= k)
      |                 ~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 1748 KB Output is correct
4 Correct 5 ms 2132 KB Output is correct
5 Correct 3 ms 2004 KB Output is correct
6 Correct 3 ms 1876 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 1616 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 1748 KB Output is correct
4 Correct 5 ms 2132 KB Output is correct
5 Correct 3 ms 2004 KB Output is correct
6 Correct 3 ms 1876 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 1616 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 3 ms 2004 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 2116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1876 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 4 ms 1876 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 3 ms 1620 KB Output is correct
23 Correct 5 ms 1876 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 6 ms 1876 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 5 ms 1748 KB Output is correct
29 Correct 4 ms 1620 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 5 ms 1748 KB Output is correct
32 Correct 4 ms 1876 KB Output is correct
33 Correct 5 ms 1720 KB Output is correct
34 Correct 5 ms 1840 KB Output is correct
35 Correct 3 ms 1108 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 7 ms 2160 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 7 ms 2148 KB Output is correct
43 Correct 7 ms 2160 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1620 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 443 ms 33688 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 469 ms 33968 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 442 ms 33684 KB Output is correct
16 Correct 434 ms 33684 KB Output is correct
17 Correct 438 ms 33728 KB Output is correct
18 Correct 442 ms 33600 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 1748 KB Output is correct
4 Correct 5 ms 2132 KB Output is correct
5 Correct 3 ms 2004 KB Output is correct
6 Correct 3 ms 1876 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 1616 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 3 ms 2004 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 2116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1876 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 4 ms 1876 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 3 ms 1620 KB Output is correct
23 Correct 5 ms 1876 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 6 ms 1876 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 5 ms 1748 KB Output is correct
29 Correct 4 ms 1620 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 5 ms 1748 KB Output is correct
32 Correct 4 ms 1876 KB Output is correct
33 Correct 5 ms 1720 KB Output is correct
34 Correct 5 ms 1840 KB Output is correct
35 Correct 3 ms 1108 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 7 ms 2160 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 7 ms 2148 KB Output is correct
43 Correct 7 ms 2160 KB Output is correct
44 Correct 129 ms 3744 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 8 ms 2128 KB Output is correct
47 Correct 22 ms 2944 KB Output is correct
48 Correct 8 ms 2132 KB Output is correct
49 Correct 22 ms 2968 KB Output is correct
50 Correct 30 ms 3028 KB Output is correct
51 Correct 120 ms 4812 KB Output is correct
52 Correct 3 ms 2004 KB Output is correct
53 Correct 87 ms 6012 KB Output is correct
54 Correct 198 ms 5284 KB Output is correct
55 Correct 6 ms 1876 KB Output is correct
56 Correct 3 ms 2004 KB Output is correct
57 Correct 2 ms 1620 KB Output is correct
58 Correct 78 ms 5856 KB Output is correct
59 Correct 12 ms 2324 KB Output is correct
60 Correct 6 ms 1948 KB Output is correct
61 Correct 12 ms 2260 KB Output is correct
62 Correct 12 ms 2260 KB Output is correct
63 Correct 120 ms 3612 KB Output is correct
64 Correct 57 ms 2328 KB Output is correct
65 Correct 8 ms 2004 KB Output is correct
66 Correct 12 ms 2260 KB Output is correct
67 Correct 99 ms 3388 KB Output is correct
68 Correct 57 ms 2392 KB Output is correct
69 Correct 8 ms 2108 KB Output is correct
70 Correct 32 ms 2892 KB Output is correct
71 Correct 96 ms 3352 KB Output is correct
72 Correct 76 ms 3348 KB Output is correct
73 Correct 4 ms 1712 KB Output is correct
74 Correct 30 ms 2868 KB Output is correct
75 Correct 79 ms 3356 KB Output is correct
76 Correct 12 ms 2408 KB Output is correct
77 Correct 84 ms 3764 KB Output is correct
78 Correct 3 ms 1620 KB Output is correct
79 Correct 43 ms 2040 KB Output is correct
80 Correct 12 ms 2388 KB Output is correct
81 Correct 83 ms 3788 KB Output is correct
82 Correct 2 ms 724 KB Output is correct
83 Correct 41 ms 2020 KB Output is correct
84 Correct 41 ms 3532 KB Output is correct
85 Correct 3 ms 724 KB Output is correct
86 Correct 46 ms 3632 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 1748 KB Output is correct
4 Correct 5 ms 2132 KB Output is correct
5 Correct 3 ms 2004 KB Output is correct
6 Correct 3 ms 1876 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 1616 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 3 ms 2004 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 2116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1876 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 4 ms 1876 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 3 ms 1620 KB Output is correct
23 Correct 5 ms 1876 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 6 ms 1876 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 5 ms 1748 KB Output is correct
29 Correct 4 ms 1620 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 5 ms 1748 KB Output is correct
32 Correct 4 ms 1876 KB Output is correct
33 Correct 5 ms 1720 KB Output is correct
34 Correct 5 ms 1840 KB Output is correct
35 Correct 3 ms 1108 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 7 ms 2160 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 7 ms 2148 KB Output is correct
43 Correct 7 ms 2160 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 141 ms 22276 KB Output is correct
46 Correct 57 ms 15336 KB Output is correct
47 Correct 159 ms 22744 KB Output is correct
48 Correct 143 ms 22224 KB Output is correct
49 Correct 34 ms 16320 KB Output is correct
50 Correct 99 ms 29780 KB Output is correct
51 Correct 176 ms 22812 KB Output is correct
52 Correct 31 ms 15028 KB Output is correct
53 Correct 30 ms 16348 KB Output is correct
54 Correct 19 ms 13436 KB Output is correct
55 Correct 98 ms 30104 KB Output is correct
56 Correct 28 ms 13396 KB Output is correct
57 Correct 31 ms 14976 KB Output is correct
58 Correct 61 ms 13988 KB Output is correct
59 Correct 28 ms 13520 KB Output is correct
60 Correct 29 ms 13420 KB Output is correct
61 Correct 64 ms 13996 KB Output is correct
62 Correct 40 ms 13440 KB Output is correct
63 Correct 86 ms 17508 KB Output is correct
64 Correct 28 ms 13392 KB Output is correct
65 Correct 128 ms 19844 KB Output is correct
66 Correct 42 ms 13484 KB Output is correct
67 Correct 87 ms 17492 KB Output is correct
68 Correct 113 ms 19260 KB Output is correct
69 Correct 123 ms 19776 KB Output is correct
70 Correct 40 ms 13392 KB Output is correct
71 Correct 117 ms 19292 KB Output is correct
72 Correct 71 ms 17408 KB Output is correct
73 Correct 146 ms 21024 KB Output is correct
74 Correct 41 ms 13520 KB Output is correct
75 Correct 44 ms 9180 KB Output is correct
76 Correct 68 ms 17788 KB Output is correct
77 Correct 137 ms 21064 KB Output is correct
78 Correct 66 ms 10716 KB Output is correct
79 Correct 43 ms 9080 KB Output is correct
80 Correct 12 ms 4480 KB Output is correct
81 Correct 68 ms 10612 KB Output is correct
82 Correct 109 ms 20508 KB Output is correct
83 Correct 13 ms 4496 KB Output is correct
84 Correct 111 ms 20504 KB Output is correct