답안 #405597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405597	2021-05-16T14:58:34 Z	Falcon	Amusement Park (CEOI19_amusementpark)	C++17	63 / 100	3000 ms	25300 KB

amusementpark

#include <vector>
#include <array>
#include <iostream>

#ifdef DEBUG
#include "debug.hpp"
#endif

using namespace std;

#define all(c)              (c).begin(), (c).end()
#define rall(c)             (c).rbegin(), (c).rend()
#define traverse(c, it)     for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N)           for(int i = 0; i < (N); ++i)
#define rrep(i, N)          for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N)          for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e)       for(int i = (s); i <= (e); ++i)

#ifdef DEBUG
#define debug(x...)         { \
                            ++dbg::depth; \
                            string dbg_vals = dbg::to_string(x); \
                            --dbg::depth; \
                            dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
                            }

#define light_debug(x)      { \
                            dbg::light = true; \
                            dbg::dout << __func__ << ":" << __LINE__; \
                            dbg::dout << "  " << #x << " = " << x << endl; \
                            dbg::light = false; \
                            }

#else
#define debug(x...)         42
#define light_debug(x)      42
#endif


using ll = long long;

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }


constexpr int mod{998244353};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    array<bool, 1 << 18> parity;
    rep(i, 1 << 18) parity[i] = __builtin_popcount(i) % 2 == 0;

    array<int, 1 << 18> lg;
    rep(i, 1 << 18) lg[i] = __lg(i);

    int n, m; cin >> n >> m;
    vector<vector<bool>> adj(n, vector<bool>(n));
    rep(i, m) {
        int u, v; cin >> u >> v; --u, --v;
        adj[u][v] = true;
    }

    vector<vector<int>> single_cost(n, vector<int>(1 << n));
    rep(i, n)
        rep1(mask, (1 << n) - 1) {
             single_cost[i][mask] = single_cost[i][mask - (1 << lg[mask])]
                 + adj[lg[mask]][i];  
        }

    vector<bool> is_independent(1 << n, true);
    rep1(mask, (1 << n) - 1) {
        rep(i, n) 
            if((mask & (1 << i)) && single_cost[i][mask] != 0) {
                is_independent[mask] = false;
                break;
            }
                
    }
            
    vector<long long> dp_s(1 << n), dp_c(1 << n); dp_c[0] = 1;
    vector<int> partial_cost(1 << n);

    int j, sources;
    long long t_s, t_c;
    rep1(mask, (1 << n) - 1) {
        for(sources = mask & (mask - 1); ; sources = (sources - 1) & mask) {
            sources = mask - sources;

            if(is_independent[sources]) {
                j = lg[sources];
                partial_cost[sources] =
                    partial_cost[sources - (1 << j)] + single_cost[j][mask];

                t_c = dp_c[mask ^ sources];
                t_s = dp_s[mask ^ sources] +
                    dp_c[mask ^ sources] * partial_cost[sources] % mod;

                if(parity[sources])
                    dp_s[mask] -= t_s, dp_c[mask] -= t_c;
                else
                    dp_s[mask] += t_s, dp_c[mask] += t_c;
            }

            sources = mask - sources;
            if(sources == 0) break;
        }

        dp_c[mask] %= mod;
        dp_s[mask] %= mod;
    }

    if(dp_s.back() < 0) dp_s.back() += mod;

    cout << dp_s.back()  << '\n';
    
    
    #ifdef DEBUG
    dbg::dout << "\nExecution time: "
              << clock() * 1000 / CLOCKS_PER_SEC 
              << "ms" << endl;
    #endif
    return 0;
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1592 KB	Output is correct
2	Correct	3 ms	1484 KB	Output is correct
3	Correct	3 ms	1484 KB	Output is correct
4	Correct	3 ms	1484 KB	Output is correct
5	Correct	3 ms	1596 KB	Output is correct
6	Correct	4 ms	1484 KB	Output is correct
7	Correct	3 ms	1612 KB	Output is correct
8	Correct	3 ms	1484 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1592 KB	Output is correct
2	Correct	3 ms	1484 KB	Output is correct
3	Correct	3 ms	1484 KB	Output is correct
4	Correct	3 ms	1484 KB	Output is correct
5	Correct	3 ms	1596 KB	Output is correct
6	Correct	4 ms	1484 KB	Output is correct
7	Correct	3 ms	1612 KB	Output is correct
8	Correct	3 ms	1484 KB	Output is correct
9	Correct	3 ms	1484 KB	Output is correct
10	Correct	3 ms	1484 KB	Output is correct
11	Correct	4 ms	1484 KB	Output is correct
12	Correct	3 ms	1484 KB	Output is correct
13	Correct	3 ms	1484 KB	Output is correct
14	Correct	3 ms	1584 KB	Output is correct
15	Correct	3 ms	1484 KB	Output is correct
16	Correct	3 ms	1484 KB	Output is correct
17	Correct	3 ms	1484 KB	Output is correct
18	Correct	3 ms	1484 KB	Output is correct
19	Correct	3 ms	1484 KB	Output is correct
20	Correct	4 ms	1484 KB	Output is correct
21	Correct	3 ms	1484 KB	Output is correct
22	Correct	3 ms	1484 KB	Output is correct
23	Correct	3 ms	1484 KB	Output is correct
24	Correct	3 ms	1484 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1592 KB	Output is correct
2	Correct	3 ms	1484 KB	Output is correct
3	Correct	3 ms	1484 KB	Output is correct
4	Correct	3 ms	1484 KB	Output is correct
5	Correct	3 ms	1596 KB	Output is correct
6	Correct	4 ms	1484 KB	Output is correct
7	Correct	3 ms	1612 KB	Output is correct
8	Correct	3 ms	1484 KB	Output is correct
9	Correct	3 ms	1484 KB	Output is correct
10	Correct	3 ms	1484 KB	Output is correct
11	Correct	4 ms	1484 KB	Output is correct
12	Correct	3 ms	1484 KB	Output is correct
13	Correct	3 ms	1484 KB	Output is correct
14	Correct	3 ms	1584 KB	Output is correct
15	Correct	3 ms	1484 KB	Output is correct
16	Correct	3 ms	1484 KB	Output is correct
17	Correct	3 ms	1484 KB	Output is correct
18	Correct	3 ms	1484 KB	Output is correct
19	Correct	3 ms	1484 KB	Output is correct
20	Correct	4 ms	1484 KB	Output is correct
21	Correct	3 ms	1484 KB	Output is correct
22	Correct	3 ms	1484 KB	Output is correct
23	Correct	3 ms	1484 KB	Output is correct
24	Correct	3 ms	1484 KB	Output is correct
25	Correct	3 ms	1484 KB	Output is correct
26	Correct	3 ms	1484 KB	Output is correct
27	Correct	4 ms	1588 KB	Output is correct
28	Correct	3 ms	1600 KB	Output is correct
29	Correct	3 ms	1484 KB	Output is correct
30	Correct	3 ms	1484 KB	Output is correct
31	Correct	3 ms	1484 KB	Output is correct
32	Correct	3 ms	1484 KB	Output is correct
33	Correct	3 ms	1484 KB	Output is correct
34	Correct	3 ms	1484 KB	Output is correct
35	Correct	3 ms	1484 KB	Output is correct
36	Correct	3 ms	1484 KB	Output is correct
37	Correct	3 ms	1484 KB	Output is correct
38	Correct	3 ms	1484 KB	Output is correct
39	Correct	3 ms	1592 KB	Output is correct
40	Correct	3 ms	1592 KB	Output is correct
41	Correct	4 ms	1592 KB	Output is correct
42	Correct	4 ms	1612 KB	Output is correct
43	Correct	4 ms	1588 KB	Output is correct
44	Correct	3 ms	1612 KB	Output is correct
45	Correct	3 ms	1612 KB	Output is correct
46	Correct	3 ms	1612 KB	Output is correct
47	Correct	3 ms	1612 KB	Output is correct
48	Correct	3 ms	1612 KB	Output is correct
49	Correct	3 ms	1612 KB	Output is correct
50	Correct	3 ms	1612 KB	Output is correct
51	Correct	3 ms	1612 KB	Output is correct
52	Correct	3 ms	1612 KB	Output is correct
53	Correct	3 ms	1612 KB	Output is correct
54	Correct	3 ms	1612 KB	Output is correct
55	Correct	3 ms	1612 KB	Output is correct
56	Correct	3 ms	1612 KB	Output is correct
57	Correct	3 ms	1612 KB	Output is correct
58	Correct	4 ms	1612 KB	Output is correct
59	Correct	3 ms	1612 KB	Output is correct
60	Correct	3 ms	1612 KB	Output is correct
61	Correct	3 ms	1612 KB	Output is correct
62	Correct	4 ms	1612 KB	Output is correct
63	Correct	3 ms	1612 KB	Output is correct
64	Correct	3 ms	1612 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1592 KB	Output is correct
2	Correct	3 ms	1484 KB	Output is correct
3	Correct	3 ms	1484 KB	Output is correct
4	Correct	3 ms	1484 KB	Output is correct
5	Correct	3 ms	1596 KB	Output is correct
6	Correct	4 ms	1484 KB	Output is correct
7	Correct	3 ms	1612 KB	Output is correct
8	Correct	3 ms	1484 KB	Output is correct
9	Correct	3 ms	1484 KB	Output is correct
10	Correct	3 ms	1484 KB	Output is correct
11	Correct	4 ms	1484 KB	Output is correct
12	Correct	3 ms	1484 KB	Output is correct
13	Correct	3 ms	1484 KB	Output is correct
14	Correct	3 ms	1584 KB	Output is correct
15	Correct	3 ms	1484 KB	Output is correct
16	Correct	3 ms	1484 KB	Output is correct
17	Correct	3 ms	1484 KB	Output is correct
18	Correct	3 ms	1484 KB	Output is correct
19	Correct	3 ms	1484 KB	Output is correct
20	Correct	4 ms	1484 KB	Output is correct
21	Correct	3 ms	1484 KB	Output is correct
22	Correct	3 ms	1484 KB	Output is correct
23	Correct	3 ms	1484 KB	Output is correct
24	Correct	3 ms	1484 KB	Output is correct
25	Correct	3 ms	1484 KB	Output is correct
26	Correct	3 ms	1484 KB	Output is correct
27	Correct	4 ms	1588 KB	Output is correct
28	Correct	3 ms	1600 KB	Output is correct
29	Correct	3 ms	1484 KB	Output is correct
30	Correct	3 ms	1484 KB	Output is correct
31	Correct	3 ms	1484 KB	Output is correct
32	Correct	3 ms	1484 KB	Output is correct
33	Correct	3 ms	1484 KB	Output is correct
34	Correct	3 ms	1484 KB	Output is correct
35	Correct	3 ms	1484 KB	Output is correct
36	Correct	3 ms	1484 KB	Output is correct
37	Correct	3 ms	1484 KB	Output is correct
38	Correct	3 ms	1484 KB	Output is correct
39	Correct	3 ms	1592 KB	Output is correct
40	Correct	3 ms	1592 KB	Output is correct
41	Correct	4 ms	1592 KB	Output is correct
42	Correct	4 ms	1612 KB	Output is correct
43	Correct	4 ms	1588 KB	Output is correct
44	Correct	3 ms	1612 KB	Output is correct
45	Correct	3 ms	1612 KB	Output is correct
46	Correct	3 ms	1612 KB	Output is correct
47	Correct	3 ms	1612 KB	Output is correct
48	Correct	3 ms	1612 KB	Output is correct
49	Correct	3 ms	1612 KB	Output is correct
50	Correct	3 ms	1612 KB	Output is correct
51	Correct	3 ms	1612 KB	Output is correct
52	Correct	3 ms	1612 KB	Output is correct
53	Correct	3 ms	1612 KB	Output is correct
54	Correct	3 ms	1612 KB	Output is correct
55	Correct	3 ms	1612 KB	Output is correct
56	Correct	3 ms	1612 KB	Output is correct
57	Correct	3 ms	1612 KB	Output is correct
58	Correct	4 ms	1612 KB	Output is correct
59	Correct	3 ms	1612 KB	Output is correct
60	Correct	3 ms	1612 KB	Output is correct
61	Correct	3 ms	1612 KB	Output is correct
62	Correct	4 ms	1612 KB	Output is correct
63	Correct	3 ms	1612 KB	Output is correct
64	Correct	3 ms	1612 KB	Output is correct
65	Correct	18 ms	2892 KB	Output is correct
66	Correct	18 ms	2892 KB	Output is correct
67	Correct	17 ms	2896 KB	Output is correct
68	Correct	16 ms	2872 KB	Output is correct
69	Correct	35 ms	2764 KB	Output is correct
70	Correct	29 ms	2892 KB	Output is correct
71	Correct	32 ms	2880 KB	Output is correct
72	Correct	26 ms	2764 KB	Output is correct
73	Correct	25 ms	2868 KB	Output is correct
74	Correct	22 ms	2892 KB	Output is correct
75	Correct	21 ms	2892 KB	Output is correct
76	Correct	23 ms	2996 KB	Output is correct
77	Correct	54 ms	4216 KB	Output is correct
78	Correct	47 ms	4220 KB	Output is correct
79	Correct	51 ms	4168 KB	Output is correct
80	Correct	43 ms	4168 KB	Output is correct
81	Correct	39 ms	4232 KB	Output is correct
82	Correct	39 ms	4168 KB	Output is correct
83	Correct	36 ms	4288 KB	Output is correct
84	Correct	35 ms	4168 KB	Output is correct
85	Correct	97 ms	4144 KB	Output is correct
86	Correct	88 ms	4184 KB	Output is correct
87	Correct	86 ms	4168 KB	Output is correct
88	Correct	70 ms	4168 KB	Output is correct
89	Correct	68 ms	4168 KB	Output is correct
90	Correct	60 ms	4168 KB	Output is correct
91	Correct	58 ms	4232 KB	Output is correct
92	Correct	57 ms	4168 KB	Output is correct

Subtask #5
0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1592 KB	Output is correct
2	Correct	3 ms	1484 KB	Output is correct
3	Correct	3 ms	1484 KB	Output is correct
4	Correct	3 ms	1484 KB	Output is correct
5	Correct	3 ms	1596 KB	Output is correct
6	Correct	4 ms	1484 KB	Output is correct
7	Correct	3 ms	1612 KB	Output is correct
8	Correct	3 ms	1484 KB	Output is correct
9	Correct	3 ms	1484 KB	Output is correct
10	Correct	3 ms	1484 KB	Output is correct
11	Correct	4 ms	1484 KB	Output is correct
12	Correct	3 ms	1484 KB	Output is correct
13	Correct	3 ms	1484 KB	Output is correct
14	Correct	3 ms	1584 KB	Output is correct
15	Correct	3 ms	1484 KB	Output is correct
16	Correct	3 ms	1484 KB	Output is correct
17	Correct	3 ms	1484 KB	Output is correct
18	Correct	3 ms	1484 KB	Output is correct
19	Correct	3 ms	1484 KB	Output is correct
20	Correct	4 ms	1484 KB	Output is correct
21	Correct	3 ms	1484 KB	Output is correct
22	Correct	3 ms	1484 KB	Output is correct
23	Correct	3 ms	1484 KB	Output is correct
24	Correct	3 ms	1484 KB	Output is correct
25	Correct	3 ms	1484 KB	Output is correct
26	Correct	3 ms	1484 KB	Output is correct
27	Correct	4 ms	1588 KB	Output is correct
28	Correct	3 ms	1600 KB	Output is correct
29	Correct	3 ms	1484 KB	Output is correct
30	Correct	3 ms	1484 KB	Output is correct
31	Correct	3 ms	1484 KB	Output is correct
32	Correct	3 ms	1484 KB	Output is correct
33	Correct	3 ms	1484 KB	Output is correct
34	Correct	3 ms	1484 KB	Output is correct
35	Correct	3 ms	1484 KB	Output is correct
36	Correct	3 ms	1484 KB	Output is correct
37	Correct	3 ms	1484 KB	Output is correct
38	Correct	3 ms	1484 KB	Output is correct
39	Correct	3 ms	1592 KB	Output is correct
40	Correct	3 ms	1592 KB	Output is correct
41	Correct	4 ms	1592 KB	Output is correct
42	Correct	4 ms	1612 KB	Output is correct
43	Correct	4 ms	1588 KB	Output is correct
44	Correct	3 ms	1612 KB	Output is correct
45	Correct	3 ms	1612 KB	Output is correct
46	Correct	3 ms	1612 KB	Output is correct
47	Correct	3 ms	1612 KB	Output is correct
48	Correct	3 ms	1612 KB	Output is correct
49	Correct	3 ms	1612 KB	Output is correct
50	Correct	3 ms	1612 KB	Output is correct
51	Correct	3 ms	1612 KB	Output is correct
52	Correct	3 ms	1612 KB	Output is correct
53	Correct	3 ms	1612 KB	Output is correct
54	Correct	3 ms	1612 KB	Output is correct
55	Correct	3 ms	1612 KB	Output is correct
56	Correct	3 ms	1612 KB	Output is correct
57	Correct	3 ms	1612 KB	Output is correct
58	Correct	4 ms	1612 KB	Output is correct
59	Correct	3 ms	1612 KB	Output is correct
60	Correct	3 ms	1612 KB	Output is correct
61	Correct	3 ms	1612 KB	Output is correct
62	Correct	4 ms	1612 KB	Output is correct
63	Correct	3 ms	1612 KB	Output is correct
64	Correct	3 ms	1612 KB	Output is correct
65	Correct	18 ms	2892 KB	Output is correct
66	Correct	18 ms	2892 KB	Output is correct
67	Correct	17 ms	2896 KB	Output is correct
68	Correct	16 ms	2872 KB	Output is correct
69	Correct	35 ms	2764 KB	Output is correct
70	Correct	29 ms	2892 KB	Output is correct
71	Correct	32 ms	2880 KB	Output is correct
72	Correct	26 ms	2764 KB	Output is correct
73	Correct	25 ms	2868 KB	Output is correct
74	Correct	22 ms	2892 KB	Output is correct
75	Correct	21 ms	2892 KB	Output is correct
76	Correct	23 ms	2996 KB	Output is correct
77	Correct	54 ms	4216 KB	Output is correct
78	Correct	47 ms	4220 KB	Output is correct
79	Correct	51 ms	4168 KB	Output is correct
80	Correct	43 ms	4168 KB	Output is correct
81	Correct	39 ms	4232 KB	Output is correct
82	Correct	39 ms	4168 KB	Output is correct
83	Correct	36 ms	4288 KB	Output is correct
84	Correct	35 ms	4168 KB	Output is correct
85	Correct	97 ms	4144 KB	Output is correct
86	Correct	88 ms	4184 KB	Output is correct
87	Correct	86 ms	4168 KB	Output is correct
88	Correct	70 ms	4168 KB	Output is correct
89	Correct	68 ms	4168 KB	Output is correct
90	Correct	60 ms	4168 KB	Output is correct
91	Correct	58 ms	4232 KB	Output is correct
92	Correct	57 ms	4168 KB	Output is correct
93	Correct	2339 ms	25296 KB	Output is correct
94	Correct	2272 ms	25292 KB	Output is correct
95	Correct	2382 ms	25296 KB	Output is correct
96	Correct	2162 ms	25300 KB	Output is correct
97	Correct	1798 ms	25296 KB	Output is correct
98	Correct	1913 ms	25292 KB	Output is correct
99	Correct	163 ms	6984 KB	Output is correct
100	Correct	174 ms	7048 KB	Output is correct
101	Correct	141 ms	7048 KB	Output is correct
102	Correct	111 ms	6984 KB	Output is correct
103	Correct	1182 ms	12964 KB	Output is correct
104	Correct	683 ms	12992 KB	Output is correct
105	Correct	575 ms	12992 KB	Output is correct
106	Correct	393 ms	12992 KB	Output is correct
107	Execution timed out	3080 ms	25280 KB	Time limit exceeded
108	Halted	0 ms	0 KB	-

답안 #405597

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 23.0 / 23.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 37.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
23.0 / 23.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 37.0