oj.uz

답안 #813805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813805 2023-08-08T03:58:53 Z ono_de206 L-triominoes (CEOI21_ltriominoes) C++14
73 / 100
 187 ms 2476 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;
}

string bitstr(int x) {
	string ret = "";
	for(int i = 0; i < 4; i++) {
		if(x >> i & 1) ret.pb('1');
		else ret.pb('0');
	}
	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());
	}
	int ls = 0;
	vector<int> dp(1 << n);
	dp[(1 << n) - 1] = 1;
	gg[m + 1] = (1 << n) - 1;
	if(n <= 3) {
		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;
	}
	vector<pair<int, int>> v;
	for(auto it : gg) {
		if(it.ff == m + 1) continue;
		v.eb(it.ff, it.ss);
	}
	int l = 0;
	for(int i = 1; i <= m; i++) {
		int nxt = m, msk = 0;
		if(l < v.size()) nxt = v[l].ff;
		int kk = (nxt - i - 2) / 6;
		if(kk >= 0) i += kk * 6;
		if(l < v.size() && v[l].ff == i) {
			msk = v[l++].ss;
		}
		vector<int> nwdp(1 << n);
		for(int j = 0; j < (1 << n); j++) {
			if(!dp[j]) continue;
			for(int x : g[j]) {
				if(x & msk) continue;
				nwdp[x | msk] = 1;
			}
		}
		swap(nwdp, dp);
	}
	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;
}

Compilation message

ltrominoes.cpp: In function 'void go()':
ltrominoes.cpp:167:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |   if(l < v.size()) nxt = v[l].ff;
      |      ~~^~~~~~~~~~
ltrominoes.cpp:170:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |   if(l < v.size() && v[l].ff == i) {
      |      ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 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 7 ms 1236 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 7 ms 1244 KB Output is correct
16 Correct 83 ms 2344 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 31 ms 1308 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 56 ms 2284 KB Output is correct
21 Correct 27 ms 1236 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 30 ms 2260 KB Output is correct
26 Correct 29 ms 2260 KB Output is correct
27 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 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 596 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 724 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 720 KB Output is correct
21 Correct 1 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 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 0 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 6 ms 596 KB Output is correct
34 Correct 2 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 596 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 596 KB Output is correct
45 Correct 3 ms 596 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 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 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 724 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 724 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 1 ms 596 KB Output is correct
26 Correct 1 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 1 ms 596 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 1 ms 656 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 32 ms 1292 KB Output is correct
5 Correct 11 ms 952 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 7 ms 1220 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 704 KB Output is correct
20 Correct 40 ms 1236 KB Output is correct
21 Correct 16 ms 960 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 5 ms 724 KB Output is correct
24 Correct 140 ms 2260 KB Output is correct
25 Correct 54 ms 1324 KB Output is correct
26 Correct 135 ms 2356 KB Output is correct
27 Correct 135 ms 2412 KB Output is correct
28 Correct 22 ms 2336 KB Output is correct
29 Correct 65 ms 2356 KB Output is correct
30 Correct 91 ms 2352 KB Output is correct
31 Correct 31 ms 2356 KB Output is correct
32 Correct 61 ms 2348 KB Output is correct
33 Correct 42 ms 1328 KB Output is correct
34 Correct 131 ms 2276 KB Output is correct
35 Correct 186 ms 2372 KB Output is correct
36 Correct 106 ms 2260 KB Output is correct
37 Correct 13 ms 1236 KB Output is correct
38 Correct 28 ms 1236 KB Output is correct
39 Correct 17 ms 964 KB Output is correct
40 Correct 113 ms 2476 KB Output is correct
41 Correct 17 ms 964 KB Output is correct
42 Correct 108 ms 2352 KB Output is correct
43 Correct 112 ms 2372 KB Output is correct
44 Correct 105 ms 2356 KB Output is correct
45 Correct 114 ms 2356 KB Output is correct
46 Correct 9 ms 1224 KB Output is correct
47 Correct 106 ms 2360 KB Output is correct
48 Correct 187 ms 2360 KB Output is correct
49 Correct 72 ms 2260 KB Output is correct
50 Correct 17 ms 852 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 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 7 ms 1236 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 7 ms 1244 KB Output is correct
16 Correct 83 ms 2344 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 31 ms 1308 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 56 ms 2284 KB Output is correct
21 Correct 27 ms 1236 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 30 ms 2260 KB Output is correct
26 Correct 29 ms 2260 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 0 ms 596 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 7 ms 1228 KB Output is correct
33 Incorrect 4 ms 852 KB Output isn't correct
34 Halted 0 ms 0 KB -