oj.uz

답안 #813777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813777 2023-08-08T03:33:04 Z ono_de206 L-triominoes (CEOI21_ltriominoes) C++14
45 / 100
 2158 ms 2400 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
 
// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
 
template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}
 
template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}


template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1 << 14;
vector<int> g[mxn];
map<int, int> gg;
int n, m, k, S;

bool is(int x, int bit) {
	return (x & (1 << bit)) > 0;
}

void build(int now, int ans, int bit) {
	if(bit - 2 >= 0 && !is(now, bit - 2)) return;
	if(bit == n) {
		if(now == (1 << n) - 1) g[S].pb(ans);
		return;
	}
	// 1 **
	//    *
	if(bit - 1 >= 0 && !is(now, bit) && !is(ans, bit) && !is(ans, bit - 1)) {
		build(now ^ (1 << bit), ans ^ (1 << bit) ^ (1 << (bit - 1)), bit + 1);
	}
	// 2 **
	//   *
	if(bit + 1 < n && !is(now, bit) && !is(ans, bit) && !is(ans, bit + 1)) {
		build(now ^ (1 << bit), ans ^ (1 << bit) ^ (1 << (bit + 1)), bit + 1);
	}
	// 3 *
	//   **
	if(bit - 1 >= 0 && !is(now, bit - 1) && !is(now, bit) && !is(ans, bit - 1)) {
		build(now ^ (1 << bit) ^ (1 << (bit - 1)), ans ^ (1 << (bit - 1)), bit + 1);
	}
	// 4  *
	//   **
	if(bit - 1 >= 0 && !is(now, bit - 1) && !is(now, bit) && !is(ans, bit)) {
		build(now ^ (1 << bit) ^ (1 << (bit - 1)), ans ^ (1 << bit), bit + 1);
	}
	// 5
	build(now, ans, bit + 1);
}

vector<vector<int>> get(vector<vector<int>> &a, vector<vector<int>> &b) {
	vector<vector<int>> ret(1 << n, vector<int>(1 << n));
	for(int k = 0; k < (1 << n); k++) {
		for(int i = 0; i < (1 << n); i++) {
			for(int j = 0; j < (1 << n); j++) {
				if(a[i][k] && b[k][j]) ret[i][j] = 1;
			}
		}
	}
	return ret;
}
 
vector<int> solve(vector<int> &prdp, int len, int pp) {
	vector<vector<int>> can(1 << n, vector<int>(1 << n)), tmp(1 << n, vector<int>(1 << n));
	for(int i = 0; i < (1 << n); i++) {
		for(int x : g[i]) {
			tmp[i][x] = 1;
		}
	} 
	for(int i = 0; i < (1 << n); i++) {
		can[i][i] = 1;
	}
	for(; len; len >>= 1) {
		if(len & 1) can = get(can, tmp);
		tmp = get(tmp, tmp);
	}
	vector<int> ret(1 << n);
	for(int i = 0; i < (1 << n); i++) {
		if(!prdp[i]) continue;
		for(int j = 0; j < (1 << n); j++) {
			if(j & pp) continue;
			if(can[i][j]) ret[j | pp] = 1;
		}
	}
	return ret;
}

void go() {
	cin >> n >> m >> k;
	for(int i = 0; i < k; i++) {
		int x, y; cin >> x >> y;
		gg[y] |= (1 << (x - 1));
	}
	for(int i = 0; i < (1 << n); i++) {
		S = i;
		build(i, 0, 0);
		sort(all(g[S]));
		g[S].erase(unique(all(g[S])), g[S].end());
	}
	if(k == 0) {
		if(n % 6 == 0) {
			if(m >= 2) cout << "YES\n";
			else cout << "NO\n";
		} else if(n % 2 == 0) {
			if(m % 3 == 0) cout << "YES\n";
			else cout << "NO\n";
		} else if(n == 3) {
			if(m % 2 == 0) cout << "YES\n";
			else cout << "NO\n";
		} else if(n == 9) {
			if(m != 1 && m != 3) cout << "YES\n";
			else cout << "NO\n";
		} else {
			if(m % 3 == 0 && m >= 6) cout << "YES\n";
			else cout << "NO\n";
		}
		return;
	}
	if(m <= 1000) {
		vector<int> dp(1 << n);
		dp[(1 << n) - 1] = 1;
		for(int i = 1; i <= m; i++) {
			int val = gg[i];
			vector<int> nwdp(1 << n);
			for(int j = 0; j < (1 << n); j++) {
				if(!dp[j]) continue;
				for(int x : g[j]) {
					if((x & val) > 0) continue;
					nwdp[x | val] = 1;
				}
			}
			swap(dp, nwdp);
		}
		if(dp[(1 << n) - 1]) cout << "YES\n";
		else cout << "NO\n";
		return;
	}
	int ls = 0;
	vector<int> dp(1 << n);
	dp[(1 << n) - 1] = 1;
	gg[m + 1] = (1 << n) - 1;
	if(n <= 6) {
		for(auto it : gg) {
			dp = solve(dp, it.ff - ls, it.ss);
			ls = it.ff;
		}
		if(dp[(1 << n) - 1]) cout << "YES\n";
		else cout << "NO\n";
		return;
	}
	for(auto it : gg) {
		int dis = it.ff - ls;
		int kk = (dis - 2) / 6;
		if(kk >= 0) dis -= kk * 6;
		for(int t = 1; t <= dis; t++) {
			vector<int> nwdp(1 << n);
			for(int i = 0; i < (1 << n); i++) {
				if(!dp[i]) continue;
				for(int x : g[i]) {
					if(t == dis && (i & it.ss) > 0) continue;
					if(t == dis) nwdp[x | it.ss] = 1;
					else nwdp[x] = 1;
				}
			}
			swap(dp, nwdp);
		}
		ls = it.ff;
	}
	if(dp[(1 << n) - 1]) cout << "YES\n";
	else cout << "NO\n";
}

signed main() {
	// #ifndef ONO
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	// #endif
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 10 ms 1344 KB Output is correct
9 Correct 3 ms 936 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 13 ms 1256 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 7 ms 1236 KB Output is correct
16 Correct 101 ms 2372 KB Output is correct
17 Correct 6 ms 824 KB Output is correct
18 Correct 39 ms 1356 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 95 ms 2400 KB Output is correct
21 Correct 36 ms 1364 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 98 ms 2384 KB Output is correct
26 Correct 101 ms 2400 KB Output is correct
27 Correct 1 ms 724 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 7 ms 1236 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 18 ms 2224 KB Output is correct
19 Correct 18 ms 2260 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 0 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 704 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 6 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 6 ms 724 KB Output is correct
21 Correct 0 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 8 ms 724 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 7 ms 596 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 5 ms 616 KB Output is correct
41 Correct 4 ms 596 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 3 ms 724 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 712 KB Output is correct
3 Correct 261 ms 724 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 6 ms 596 KB Output is correct
10 Correct 47 ms 700 KB Output is correct
11 Correct 323 ms 724 KB Output is correct
12 Correct 2158 ms 844 KB Output is correct
13 Correct 46 ms 596 KB Output is correct
14 Correct 42 ms 704 KB Output is correct
15 Correct 287 ms 724 KB Output is correct
16 Correct 1386 ms 760 KB Output is correct
17 Correct 274 ms 724 KB Output is correct
18 Correct 298 ms 724 KB Output is correct
19 Correct 1079 ms 752 KB Output is correct
20 Correct 449 ms 724 KB Output is correct
21 Correct 83 ms 724 KB Output is correct
22 Correct 390 ms 752 KB Output is correct
23 Correct 24 ms 724 KB Output is correct
24 Correct 271 ms 724 KB Output is correct
25 Correct 1418 ms 756 KB Output is correct
26 Correct 37 ms 724 KB Output is correct
27 Correct 220 ms 724 KB Output is correct
28 Correct 72 ms 724 KB Output is correct
29 Correct 191 ms 724 KB Output is correct
30 Correct 89 ms 596 KB Output is correct
31 Correct 272 ms 724 KB Output is correct
32 Correct 1406 ms 752 KB Output is correct
33 Correct 1366 ms 752 KB Output is correct
34 Correct 213 ms 724 KB Output is correct
35 Correct 288 ms 760 KB Output is correct
36 Correct 58 ms 724 KB Output is correct
37 Correct 264 ms 764 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 10 ms 1344 KB Output is correct
9 Correct 3 ms 936 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 13 ms 1256 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 7 ms 1236 KB Output is correct
16 Correct 101 ms 2372 KB Output is correct
17 Correct 6 ms 824 KB Output is correct
18 Correct 39 ms 1356 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 95 ms 2400 KB Output is correct
21 Correct 36 ms 1364 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 98 ms 2384 KB Output is correct
26 Correct 101 ms 2400 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 0 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 7 ms 1236 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 0 ms 596 KB Output is correct
41 Correct 0 ms 596 KB Output is correct
42 Correct 0 ms 596 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 18 ms 2224 KB Output is correct
46 Correct 18 ms 2260 KB Output is correct
47 Correct 0 ms 596 KB Output is correct
48 Correct 0 ms 596 KB Output is correct
49 Correct 1 ms 724 KB Output is correct
50 Correct 1 ms 724 KB Output is correct
51 Correct 1 ms 724 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 0 ms 596 KB Output is correct
54 Correct 0 ms 596 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 0 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 1 ms 596 KB Output is correct
62 Correct 1 ms 704 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 596 KB Output is correct
65 Correct 1 ms 596 KB Output is correct
66 Correct 1 ms 596 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 6 ms 596 KB Output is correct
69 Correct 1 ms 596 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 6 ms 724 KB Output is correct
72 Correct 0 ms 596 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 0 ms 596 KB Output is correct
76 Correct 1 ms 596 KB Output is correct
77 Correct 3 ms 596 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 596 KB Output is correct
81 Correct 2 ms 596 KB Output is correct
82 Correct 2 ms 596 KB Output is correct
83 Correct 1 ms 596 KB Output is correct
84 Correct 8 ms 724 KB Output is correct
85 Correct 3 ms 596 KB Output is correct
86 Correct 7 ms 596 KB Output is correct
87 Correct 3 ms 596 KB Output is correct
88 Correct 2 ms 596 KB Output is correct
89 Correct 2 ms 596 KB Output is correct
90 Correct 2 ms 596 KB Output is correct
91 Correct 5 ms 616 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 1 ms 596 KB Output is correct
94 Correct 3 ms 596 KB Output is correct
95 Correct 1 ms 724 KB Output is correct
96 Correct 3 ms 724 KB Output is correct
97 Correct 1 ms 596 KB Output is correct
98 Correct 2 ms 724 KB Output is correct
99 Correct 2 ms 596 KB Output is correct
100 Correct 1 ms 596 KB Output is correct
101 Correct 5 ms 596 KB Output is correct
102 Correct 5 ms 712 KB Output is correct
103 Correct 261 ms 724 KB Output is correct
104 Correct 2 ms 596 KB Output is correct
105 Correct 9 ms 724 KB Output is correct
106 Correct 4 ms 596 KB Output is correct
107 Correct 1 ms 596 KB Output is correct
108 Correct 1 ms 596 KB Output is correct
109 Correct 6 ms 596 KB Output is correct
110 Correct 47 ms 700 KB Output is correct
111 Correct 323 ms 724 KB Output is correct
112 Correct 2158 ms 844 KB Output is correct
113 Correct 46 ms 596 KB Output is correct
114 Correct 42 ms 704 KB Output is correct
115 Correct 287 ms 724 KB Output is correct
116 Correct 1386 ms 760 KB Output is correct
117 Correct 274 ms 724 KB Output is correct
118 Correct 298 ms 724 KB Output is correct
119 Correct 1079 ms 752 KB Output is correct
120 Correct 449 ms 724 KB Output is correct
121 Correct 83 ms 724 KB Output is correct
122 Correct 390 ms 752 KB Output is correct
123 Correct 24 ms 724 KB Output is correct
124 Correct 271 ms 724 KB Output is correct
125 Correct 1418 ms 756 KB Output is correct
126 Correct 37 ms 724 KB Output is correct
127 Correct 220 ms 724 KB Output is correct
128 Correct 72 ms 724 KB Output is correct
129 Correct 191 ms 724 KB Output is correct
130 Correct 89 ms 596 KB Output is correct
131 Correct 272 ms 724 KB Output is correct
132 Correct 1406 ms 752 KB Output is correct
133 Correct 1366 ms 752 KB Output is correct
134 Correct 213 ms 724 KB Output is correct
135 Correct 288 ms 760 KB Output is correct
136 Correct 58 ms 724 KB Output is correct
137 Correct 264 ms 764 KB Output is correct
138 Correct 1 ms 596 KB Output is correct
139 Incorrect 1 ms 596 KB Output isn't correct
140 Halted 0 ms 0 KB -