Submission #539019

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
539019	2022-03-18T09:20:43 Z	amunduzbaev	L-triominoes (CEOI21_ltriominoes)	C++17	28 / 100	755 ms	524288 KB

ltrominoes

#include "bits/stdc++.h"
using namespace std;

#define ar array

struct mtx{
	vector<vector<int>> t;
	int n;
	
	mtx (int sz){
		n = sz;
		t.resize(n, vector<int>(n, 0));
	}
	
	mtx operator * (mtx& b){
		mtx c(n);
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				for(int k=0;k<n;k++){
					c.t[i][j] |= (t[i][k] & b.t[k][j]);
				}
			}
		} return c;
	}
};

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin>>n>>m>>k;
	vector<ar<int, 2>> a(k);
	for(int i=0;i<k;i++){
		cin>>a[i][0]>>a[i][1];
		a[i][0]--, a[i][1]--;
	}
	
	vector<mtx> pw(30, mtx(1 << n));
	{
		mtx dp(1 << n);
		for(int i=0;i < (1 << n);i++){
			for(int j=0;j < (1 << (n + n));j++){
				int mask = 0, mm = i;
				for(int l=0;l<n;l++){
					if(mm >> l & 1) continue;
					int v = (j >> (2 * l)) & 3;
					if(v == 0){
						if(l + 1 < n && !(mm >> (l + 1) & 1) && !(mask >> (l + 1) & 1)){
							mm |= (1 << l);
							mm |= (1 << (l + 1));
							mask |= (1 << (l + 1));
						}
					}
					if(v == 1){
						if(l + 1 < n && !(mm >> (l + 1) & 1) && !(mask >> l & 1)){
							mm |= (1 << l);
							mm |= (1 << (l + 1));
							mask |= (1 << l);
						}
					}
					if(v == 2){
						if(l && !(mask >> (l - 1) & 1) && !(mask >> l & 1)){
							mm |= (1 << l);
							mask |= (1 << l);
							mask |= (1 << (l - 1));
						}
					}
					if(v == 3){
						if(l + 1 < n && !(mask >> (l + 1) & 1) && !(mask >> l & 1)){
							mm |= (1 << l);
							mask |= (1 << l);
							mask |= (1 << (l + 1));
						}
					}
				}
				
				if(mm == (1 << n) - 1 && !dp.t[i][mask]){
					//~ for(int j=0;j<n;j++) cout<<(i >> j & 1);
					//~ cout<<endl;
					//~ for(int j=0;j<n;j++) cout<<(mask >> j & 1);
					//~ cout<<endl<<endl;
					dp.t[i][mask] = 1;
				}
			}
		}
		
		pw[0] = dp;
		for(int j=1;j<30;j++){
			pw[j] = pw[j-1] * pw[j-1];
		}
	}
	
	sort(a.begin(), a.end(), [&](auto& a, auto& b){
		return (a[1] < b[1]);
	});
	
	vector<int> dp(1 << n);
	dp[(1 << n) - 1] = 1;
	int last = -1;
	for(int i=0;i<k;){
		int j = i, rev = 0;
		while(j<k && a[j][1] == a[i][1]) rev |= (1 << a[j][0]), j++;
		
		int d = a[i][1] - last;
		//~ cout<<d<<endl;
		//~ for(int i=0;i<n;i++) cout<<(rev >> i & 1);
		//~ cout<<endl;
		for(int l=29;~l;l--){
			if(d >> l & 1){
				d ^= (1 << l);
				vector<int> tp(1 << n);
				for(int mask=0;mask < (1 << n);mask++){
					for(int j=0;j < (1 << n);j++){
						if(d){
							tp[j] |= (dp[mask] & pw[l].t[mask][j]);
						} else {
							if(j & rev) continue;
							//~ if(dp[mask] && pw[l].t[mask][j]){
								//~ for(int i=0;i<n;i++) cout<<(mask >> i & 1);
								//~ cout<<endl;
								//~ for(int i=0;i<n;i++) cout<<(j >> i & 1);
								//~ cout<<endl;
							//~ }
							tp[j | rev] |= (dp[mask] & pw[l].t[mask][j]);
						}
					}
				}
				swap(tp, dp);
			}
		} last = a[i][1], i = j;
	}
	
	int d = m - last - 1;
	for(int l=29;~l;l--){
		if(d >> l & 1){
			vector<int> tp(1 << n);
			for(int mask=0;mask < (1 << n);mask++){
				for(int j=0;j < (1 << n);j++){
					tp[j] |= dp[mask] & pw[l].t[mask][j];
				}
			}
			
			swap(tp, dp);
		}
	}
	
	if(dp[(1 << n) - 1]) cout<<"YES\n";
	else cout<<"NO\n";
}

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	468 KB	Output is correct
7	Correct	93 ms	2516 KB	Output is correct
8	Runtime error	241 ms	524288 KB	Execution killed with signal 9
9	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	89 ms	2456 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Runtime error	214 ms	524288 KB	Execution killed with signal 9
6	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	316 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	320 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	320 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	324 KB	Output is correct
30	Correct	1 ms	320 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	320 KB	Output is correct
39	Correct	1 ms	316 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	212 KB	Output is correct
45	Correct	1 ms	320 KB	Output is correct
46	Correct	1 ms	212 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	0 ms	316 KB	Output is correct

Subtask #4
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	5 ms	468 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	12 ms	852 KB	Output is correct
6	Correct	3 ms	468 KB	Output is correct
7	Correct	3 ms	468 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	3 ms	448 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	6 ms	448 KB	Output is correct
12	Correct	28 ms	828 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	320 KB	Output is correct
15	Correct	6 ms	448 KB	Output is correct
16	Correct	22 ms	896 KB	Output is correct
17	Correct	5 ms	500 KB	Output is correct
18	Correct	5 ms	468 KB	Output is correct
19	Correct	19 ms	852 KB	Output is correct
20	Correct	15 ms	852 KB	Output is correct
21	Correct	3 ms	468 KB	Output is correct
22	Correct	15 ms	832 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	5 ms	448 KB	Output is correct
25	Correct	21 ms	904 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	488 KB	Output is correct
28	Correct	3 ms	448 KB	Output is correct
29	Correct	4 ms	448 KB	Output is correct
30	Correct	4 ms	468 KB	Output is correct
31	Correct	7 ms	468 KB	Output is correct
32	Correct	20 ms	920 KB	Output is correct
33	Correct	20 ms	900 KB	Output is correct
34	Correct	13 ms	852 KB	Output is correct
35	Correct	15 ms	920 KB	Output is correct
36	Correct	3 ms	468 KB	Output is correct
37	Correct	14 ms	920 KB	Output is correct

Subtask #5
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	2456 KB	Output is correct
2	Correct	99 ms	2456 KB	Output is correct
3	Correct	755 ms	8780 KB	Output is correct
4	Runtime error	212 ms	524288 KB	Execution killed with signal 9
5	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	468 KB	Output is correct
7	Correct	93 ms	2516 KB	Output is correct
8	Runtime error	241 ms	524288 KB	Execution killed with signal 9
9	Halted	0 ms	0 KB	-

Submission #539019

Compilation message

Subtask #1 0 / 10.0

Subtask #2 0 / 7.0

Subtask #3 11.0 / 11.0

Subtask #4 17.0 / 17.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
0 / 10.0

Subtask #2
0 / 7.0

Subtask #3
11.0 / 11.0

Subtask #4
17.0 / 17.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0