oj.uz

Submission #576761

# Submission time Handle Problem Language Result Execution time Memory
576761 2022-06-13T11:58:17 Z amunduzbaev L-triominoes (CEOI21_ltriominoes) C++17
17 / 100
 1429 ms 8140 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int int64_t
const int N = 15;
const int M = 1005;
int dp[2][N][1 << N];
int is[N][M];
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin>>n>>m>>k;
	if(m > 1000) {
		if(n == 3){
			if(m % 2 == 0) cout<<"YES\n";	
			else cout<<"NO\n";
			return 0;
		}
		
		if(n * m % 3 == 0) cout<<"YES\n"; 
		else cout<<"NO\n";
		return 0;
	}
	//~ if(m > 1000){
		//~ if(n < 6){
			//~ if((n * m) % 6 == 0) cout<<"YES\n";
			//~ else cout<<"NO\n";
		//~ } else {
			//~ if((n * m) % 3 == 0) cout<<"YES\n";
			//~ else cout<<"NO\n";
		//~ }
		//~ return 0;
	//~ }
	
	vector<int> x(k), y(k);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			is[i][j] = 1;
		}
	} 
	for(int i=0;i<k;i++){
		cin>>x[i]>>y[i]; x[i]--, y[i]--;
		is[x[i]][y[i]] = 0;
	}
	
	int ch[4][2] = {
		{0, 0},
		{-1, 0},
		{-1, 1},
		{0, 1}
	};
	int P[4] = {1, 0, -1, 0}, mas[4] = {14, 13, 11, 7};
	int mask = (!is[0][1]);
	for(int i=0;i<n;i++){
		if(!is[i][0]) mask |= (1 << (i + 1));
	}
	
	dp[0][1][mask] = 1;
	for(int i=0;i+1<m;i++){
		int c = i&1;
		memset(dp[!c], 0, sizeof dp[!c]);
		for(int j=1;j<n;j++){
			for(int mask=0;mask < (1 << (n + 1));mask++){
				if(!dp[c][j][mask]) continue;
				int us = 0;
				for(int t=0;t<4;t++){
					us |= (is[j + ch[t][0]][i + ch[t][1]] & (t < 3 ? !(mask >> (j + P[t]) & 1) : 1)) << t;
				}
				
				for(int t=0;t<4;t++){
					if((us & mas[t]) != mas[t]) continue;
					int m2 = mask;
					for(int l=0;l<4;l++){
						if(mas[t] >> l & 1){
							//~ assert(!(m2 >> (j + P[l]) & 1));
							m2 |= (1 << (j + P[l]));
						}
					}
					if(t == 1 && !(mask >> j & 1)) continue;
					if(t == 3){
						m2 ^= (1 << j);
						m2 |= (!is[j][i + 1]) << j;
					}
					
					if(j + 1 < n){
						dp[c][j + 1][m2] = 1;
					} else if(m2 >> n & 1) {
						m2 ^= (1 << n);
						m2 = m2 << 1 | (!is[0][i + 2]);
						dp[!c][1][m2] = 1;
					}
				}
				
				if(mask >> j & 1){
					int m2 = mask;
					if(j + 1 < n){
						m2 ^= (1 << j);
						m2 |= (!is[j][i+1]) << j;
						dp[c][j + 1][m2] = 1;
					} else if(m2 >> n & 1) {
						m2 ^= (1 << j) ^ (1 << n);
						m2 |= (!is[j][i+1]) << j;
						m2 = m2 << 1 | (!is[0][i + 2]);
						dp[!c][1][m2] = 1;
					}
				}
			}
		}
	}
	
	if(dp[(m-1)&1][1][(1 << (n + 1)) - 1]) cout<<"YES\n";
	else cout<<"NO\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 8020 KB Output is correct
2 Correct 224 ms 8020 KB Output is correct
3 Correct 152 ms 8020 KB Output is correct
4 Correct 176 ms 8036 KB Output is correct
5 Correct 264 ms 8020 KB Output is correct
6 Correct 237 ms 8044 KB Output is correct
7 Correct 10 ms 8020 KB Output is correct
8 Correct 103 ms 8060 KB Output is correct
9 Correct 33 ms 8068 KB Output is correct
10 Correct 45 ms 8020 KB Output is correct
11 Correct 161 ms 8020 KB Output is correct
12 Correct 43 ms 8048 KB Output is correct
13 Correct 7 ms 8036 KB Output is correct
14 Correct 7 ms 8040 KB Output is correct
15 Correct 15 ms 8020 KB Output is correct
16 Correct 1287 ms 8112 KB Output is correct
17 Correct 326 ms 8084 KB Output is correct
18 Correct 729 ms 8096 KB Output is correct
19 Correct 267 ms 8064 KB Output is correct
20 Correct 1255 ms 8108 KB Output is correct
21 Correct 717 ms 8116 KB Output is correct
22 Correct 241 ms 8040 KB Output is correct
23 Correct 271 ms 8076 KB Output is correct
24 Correct 256 ms 8044 KB Output is correct
25 Correct 1429 ms 8104 KB Output is correct
26 Correct 1420 ms 8140 KB Output is correct
27 Correct 247 ms 8048 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 8008 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 3 ms 8020 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 8020 KB Output is correct
2 Correct 224 ms 8020 KB Output is correct
3 Correct 152 ms 8020 KB Output is correct
4 Correct 176 ms 8036 KB Output is correct
5 Correct 264 ms 8020 KB Output is correct
6 Correct 237 ms 8044 KB Output is correct
7 Correct 10 ms 8020 KB Output is correct
8 Correct 103 ms 8060 KB Output is correct
9 Correct 33 ms 8068 KB Output is correct
10 Correct 45 ms 8020 KB Output is correct
11 Correct 161 ms 8020 KB Output is correct
12 Correct 43 ms 8048 KB Output is correct
13 Correct 7 ms 8036 KB Output is correct
14 Correct 7 ms 8040 KB Output is correct
15 Correct 15 ms 8020 KB Output is correct
16 Correct 1287 ms 8112 KB Output is correct
17 Correct 326 ms 8084 KB Output is correct
18 Correct 729 ms 8096 KB Output is correct
19 Correct 267 ms 8064 KB Output is correct
20 Correct 1255 ms 8108 KB Output is correct
21 Correct 717 ms 8116 KB Output is correct
22 Correct 241 ms 8040 KB Output is correct
23 Correct 271 ms 8076 KB Output is correct
24 Correct 256 ms 8044 KB Output is correct
25 Correct 1429 ms 8104 KB Output is correct
26 Correct 1420 ms 8140 KB Output is correct
27 Correct 247 ms 8048 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 3 ms 8008 KB Output is correct
30 Correct 4 ms 8020 KB Output is correct
31 Correct 2 ms 4180 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 3 ms 8020 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Incorrect 0 ms 336 KB Output isn't correct
56 Halted 0 ms 0 KB -