Submission #440799

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
440799	2021-07-03T06:29:49 Z	hhhhaura	Amusement Park (CEOI19_amusementpark)	C++14	19 / 100	3000 ms	316 KB

amusementpark

#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1000000000000000000
#define MOD 998244353
#define eps (1e-9)

using namespace std;

#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
	int n, m, cur;
	vector<vector<int>> mp;
	vector<int> x, y, es, vis;
	void init_(int _n, int _m) {
		n = _n, m = _m;
		mp.assign(n + 1, vector<int>());
		x.clear();
		y.clear();
		es.clear();
	}
	void add_edge(int a, int b) {
		mp[a].push_back(es.size());
		mp[b].push_back(es.size());
		x.push_back(a);
		y.push_back(b);
		es.push_back(a ^ b);
	}
	pii get(int id) {
		bool yes = (cur >> id) & 1;
		if(yes) return {y[id], x[id]};
		else return {x[id], y[id]};
	}
	int solve() {
		int ans = 0, ok = 0;
		rep(i, 0, (1 << m) - 1) {
			cur = i, ok = 0;
			vis.assign(n + 1, 0);
			rep(j, 0, m - 1) {
				pii es = get(j);
				vis[es.second] ++;
			}
			queue<int> q;
			rep(j, 1, n) if(!vis[j]) q.push(j);
			while(q.size()) {
				int p = q.front(); q.pop();
				ok ++;
				for(auto i : mp[p]) {
					int to = es[i] ^ p;
					if(get(i) == pii(p, to)) {
						vis[to] --;
						if(!vis[to]) q.push(to);
					}
				}
			}
			if(ok == n) ans = (ans + __builtin_popcount(i)) % MOD;
		}
		return ans;
	} 

};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, m; cin >> n >> m;
	init_(n, m);
	rep(i, 1, m) {
		int a, b; cin >> a >> b;
		add_edge(a, b);
	}
	cout << solve() << "\n";
	return 0;	
}

Compilation message

amusementpark.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
amusementpark.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
amusementpark.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	316 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	244 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	8 ms	204 KB	Output is correct

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	316 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	244 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	8 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	304 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	308 KB	Output is correct
29	Correct	7 ms	204 KB	Output is correct
30	Correct	55 ms	308 KB	Output is correct
31	Correct	460 ms	288 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	16 ms	312 KB	Output is correct
36	Correct	233 ms	292 KB	Output is correct
37	Execution timed out	3039 ms	224 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	316 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	244 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	8 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	304 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	308 KB	Output is correct
29	Correct	7 ms	204 KB	Output is correct
30	Correct	55 ms	308 KB	Output is correct
31	Correct	460 ms	288 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	16 ms	312 KB	Output is correct
36	Correct	233 ms	292 KB	Output is correct
37	Execution timed out	3039 ms	224 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	316 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	244 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	8 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	304 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	308 KB	Output is correct
29	Correct	7 ms	204 KB	Output is correct
30	Correct	55 ms	308 KB	Output is correct
31	Correct	460 ms	288 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	16 ms	312 KB	Output is correct
36	Correct	233 ms	292 KB	Output is correct
37	Execution timed out	3039 ms	224 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Submission #440799

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 21.0

Subtask #5 0 / 37.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 21.0

Subtask #5
0 / 37.0