Submission #440800

# Submission time Handle Problem Language Result Execution time Memory
440800 2021-07-03T06:56:43 Z hhhhaura Amusement Park (CEOI19_amusementpark) C++14
19 / 100
199 ms 17232 KB
#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<pii> es;
	set<int> s;
	void init_(int _n, int _m) {
		n = _n, m = _m;
		s.clear();
		es.clear();
	}
	void add_edge(int a, int b) {
		es.push_back({a, b});
	}
	int solve() {
		int ans = 0;
		vector<int> a(n, 0), id(n + 1, 0);
		rep(i, 1, n) a[i - 1] = i;
		do {
			rep(i, 0, n - 1) id[a[i]] = i + 1;
			int msk = 0;
			rep(i, 0, m - 1) {
				pii cur = es[i];
				if(id[cur.first] < id[cur.second]) {
					msk |= ((int) 1 << i );
				}
			}
			if(s.find(msk) == s.end()) {
				ans = (ans + __builtin_popcount(msk)) % MOD;
				s.insert(msk);
			}
		} while(next_permutation(all(a)));
		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;}
      |                     ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 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 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 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 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 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 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 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 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 3 ms 204 KB Output is correct
33 Correct 3 ms 204 KB Output is correct
34 Correct 9 ms 332 KB Output is correct
35 Correct 8 ms 436 KB Output is correct
36 Correct 10 ms 756 KB Output is correct
37 Correct 18 ms 1352 KB Output is correct
38 Correct 17 ms 2164 KB Output is correct
39 Correct 18 ms 320 KB Output is correct
40 Correct 25 ms 316 KB Output is correct
41 Correct 38 ms 332 KB Output is correct
42 Correct 42 ms 444 KB Output is correct
43 Correct 73 ms 1600 KB Output is correct
44 Correct 75 ms 2792 KB Output is correct
45 Correct 108 ms 5808 KB Output is correct
46 Correct 199 ms 10820 KB Output is correct
47 Incorrect 194 ms 17232 KB Output isn't correct
48 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 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 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 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 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 3 ms 204 KB Output is correct
33 Correct 3 ms 204 KB Output is correct
34 Correct 9 ms 332 KB Output is correct
35 Correct 8 ms 436 KB Output is correct
36 Correct 10 ms 756 KB Output is correct
37 Correct 18 ms 1352 KB Output is correct
38 Correct 17 ms 2164 KB Output is correct
39 Correct 18 ms 320 KB Output is correct
40 Correct 25 ms 316 KB Output is correct
41 Correct 38 ms 332 KB Output is correct
42 Correct 42 ms 444 KB Output is correct
43 Correct 73 ms 1600 KB Output is correct
44 Correct 75 ms 2792 KB Output is correct
45 Correct 108 ms 5808 KB Output is correct
46 Correct 199 ms 10820 KB Output is correct
47 Incorrect 194 ms 17232 KB Output isn't correct
48 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 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 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 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 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 3 ms 204 KB Output is correct
33 Correct 3 ms 204 KB Output is correct
34 Correct 9 ms 332 KB Output is correct
35 Correct 8 ms 436 KB Output is correct
36 Correct 10 ms 756 KB Output is correct
37 Correct 18 ms 1352 KB Output is correct
38 Correct 17 ms 2164 KB Output is correct
39 Correct 18 ms 320 KB Output is correct
40 Correct 25 ms 316 KB Output is correct
41 Correct 38 ms 332 KB Output is correct
42 Correct 42 ms 444 KB Output is correct
43 Correct 73 ms 1600 KB Output is correct
44 Correct 75 ms 2792 KB Output is correct
45 Correct 108 ms 5808 KB Output is correct
46 Correct 199 ms 10820 KB Output is correct
47 Incorrect 194 ms 17232 KB Output isn't correct
48 Halted 0 ms 0 KB -