oj.uz

Submission #122523

# Submission time Handle Problem Language Result Execution time Memory
122523 2019-06-28T14:16:37 Z egorlifar Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1997 ms 56768 KB 
/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";


int l, q;
string s;
char c[1 << 20];
int ans[1594329];
int who[1000228];
int dp[1594329];
int pos[1594329];
long long g[30];
bool bad[1594329];
int prefs[1594329];
int kt[1594329];

long long get(string s) {
	int it = 0;
	long long res = 0;
	for (auto x: s) {

		if (x == '?') {
			res += g[it] * 2;
		} else {
			res += g[it] * (x - '0');
		}
		it++;
	}
	return res;
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> l >> q;
	cin >> s;
	for (int i = 0; i < (1 << l); i++) {
		c[i] = s[i] - '0';
	}
	int t = 1;
	for (int i = 0; i < l - 7; i++) {
		t *= 3;
	}
		g[0] = 1;
	for (int i = 1; i <= 20; i++) {
		g[i] = g[i - 1] * 3;
	}
	if (l <= 7) {
		t = 1;
		for (int i = 0; i < l; i++) {
			t *= 3;
		}
		for (int mask = 0; mask < t; mask++) {
	        int id = mask;
	        bool was = false;
	        int cur = 0;
	        int r = 0;
	        int cur1 = 0;
	        int g = 1;
	        for (int t = 0; t < l; t++) {
	            int s = id % 3;
	            if (was) {
	                cur += s * g;
	                cur1 += s * g;
	            } else {
	                if (s == 2) {
	                    was = true;
	                    cur += 0 * g;
	                    cur1 += 1 * g;
	                } else {
	                    cur += s * g;
	                    cur1 += s * g;
	                    if (s) {
	                        r += (1 << (l - t - 1));
	                    }
	                }
	            }
	            id /= 3;
	            g *= 3;
	        }
	        if (!was) {
	            ans[mask] = c[r];
	        } else {
	            ans[mask] = ans[cur] + ans[cur1];
	        }
	    }
	    for (int it = 0; it < q; it++) {
	    	string k;
	    	cin >> k;
	        int x = get(k);
	      //  cout << "opa" << endl;
	        cout << ans[x] << '\n';
	    }   
	    return 0;
	}
	
	for (int it = 0; it < q; it++) {
		string f;
		cin >> f;
		long long x;
		x = get(f);
		vector<char> st;
		for (int i = 0; i < l; i++) {
			st.pb(x % 3);
		//	cout << (int)st.back() << '\n';
			x /= 3;
		}
		reverse(all(st));
		int cur = 1;
		for (int i = 7; i < l; i++) {
			who[it] += (int)st[i] * cur;
			cur *= 3;
		}
		for (int i = 0; i < 7; i++) {
			prefs[it] += (int)st[i] * g[i];
		}
	}	
	for (int i = 0; i < l - 7; i++) {
		for (int pre = 0; pre < (1 << i); pre++) {
			int rpre = 0;
			for (int k = 0; k < i; k++) {
				if (pre & (1 << k)) {
					rpre += g[k];
				}
			}
			for (int suff = 0; suff < g[l - 7 - i - 1]; suff++) {
				pos[rpre + 2 * g[i] + suff * g[i + 1]] = i + 1;
			}
		}
	}
	for (int i = 0; i < t; i++) {
		if (pos[i] == 0) {
			int curi = i;
			int nmask = 0;
			for (int j = 0; j < l - 7; j++) {
				int g = curi % 3;
				if (g) {
					nmask += 1 << j;
				}
				curi /= 3;
			}
			kt[i] = nmask;
		}
	}

	for (int mask = 0; mask < 128; mask++) {
		for (int i = 0; i < t; i++) {
			if (pos[i] == 0) {
				dp[i] = c[(kt[i] << 7) + mask];
			} else {
				dp[i] =dp[i - g[pos[i] - 1]] + dp[i - (g[pos[i] - 1] << 1)];
			}
		}
		for (int j = 0; j < g[7]; j++) {
			bad[j] = false;
			int cur = j;
			for (int f = 0; f < 7; f++) {
				int a = cur % 3;
				if (a != 2) {
					bool fs = ((mask & (1 << f)) != 0);
					if (fs != a) {
						bad[j] = true;
						break;
					}
				}
				cur /= 3;
			}
		}
		for (int it = 0; it < q; it++) {
            if (!bad[prefs[it]]) {
                ans[it] += dp[who[it]];
            }
		}
	}
	for (int it = 0; it < q; it++) {
		cout << ans[it] << '\n';
	}
	return 0; 		
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 672 ms 17376 KB Output is correct
12 Correct 720 ms 17116 KB Output is correct
13 Correct 559 ms 16244 KB Output is correct
14 Correct 554 ms 16532 KB Output is correct
15 Correct 772 ms 17332 KB Output is correct
16 Correct 600 ms 16688 KB Output is correct
17 Correct 686 ms 16596 KB Output is correct
18 Correct 539 ms 18296 KB Output is correct
19 Correct 504 ms 15480 KB Output is correct
20 Correct 728 ms 16988 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 672 ms 17376 KB Output is correct
12 Correct 720 ms 17116 KB Output is correct
13 Correct 559 ms 16244 KB Output is correct
14 Correct 554 ms 16532 KB Output is correct
15 Correct 772 ms 17332 KB Output is correct
16 Correct 600 ms 16688 KB Output is correct
17 Correct 686 ms 16596 KB Output is correct
18 Correct 539 ms 18296 KB Output is correct
19 Correct 504 ms 15480 KB Output is correct
20 Correct 728 ms 16988 KB Output is correct
21 Correct 736 ms 17388 KB Output is correct
22 Correct 744 ms 17560 KB Output is correct
23 Correct 710 ms 16560 KB Output is correct
24 Correct 692 ms 16376 KB Output is correct
25 Correct 882 ms 18576 KB Output is correct
26 Correct 751 ms 16896 KB Output is correct
27 Correct 728 ms 16868 KB Output is correct
28 Correct 591 ms 19396 KB Output is correct
29 Correct 613 ms 15480 KB Output is correct
30 Correct 891 ms 17456 KB Output is correct
31 Correct 698 ms 17364 KB Output is correct
32 Correct 719 ms 17572 KB Output is correct
33 Correct 671 ms 16360 KB Output is correct
34 Correct 721 ms 16396 KB Output is correct
35 Correct 748 ms 17016 KB Output is correct
36 Correct 507 ms 15464 KB Output is correct
37 Correct 660 ms 17324 KB Output is correct
38 Correct 593 ms 15428 KB Output is correct
39 Correct 761 ms 16528 KB Output is correct
40 Correct 673 ms 16372 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 498 ms 17272 KB Output is correct
12 Correct 535 ms 17432 KB Output is correct
13 Correct 440 ms 17472 KB Output is correct
14 Correct 452 ms 17432 KB Output is correct
15 Correct 500 ms 17508 KB Output is correct
16 Correct 475 ms 17364 KB Output is correct
17 Correct 529 ms 17436 KB Output is correct
18 Correct 426 ms 17688 KB Output is correct
19 Correct 467 ms 17236 KB Output is correct
20 Correct 450 ms 17404 KB Output is correct
21 Correct 445 ms 17432 KB Output is correct
22 Correct 457 ms 17428 KB Output is correct
23 Correct 494 ms 17452 KB Output is correct
24 Correct 562 ms 17424 KB Output is correct
25 Correct 532 ms 17364 KB Output is correct
26 Correct 476 ms 17304 KB Output is correct
27 Correct 536 ms 17560 KB Output is correct
28 Correct 482 ms 17308 KB Output is correct
29 Correct 565 ms 17304 KB Output is correct
30 Correct 539 ms 17432 KB Output is correct
31 Correct 638 ms 17480 KB Output is correct
32 Correct 491 ms 17432 KB Output is correct
33 Correct 523 ms 17368 KB Output is correct
34 Correct 469 ms 17304 KB Output is correct
35 Correct 490 ms 17432 KB Output is correct
36 Correct 532 ms 17364 KB Output is correct
37 Correct 518 ms 17372 KB Output is correct
38 Correct 509 ms 17432 KB Output is correct
39 Correct 548 ms 17368 KB Output is correct
40 Correct 501 ms 17456 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 672 ms 17376 KB Output is correct
12 Correct 720 ms 17116 KB Output is correct
13 Correct 559 ms 16244 KB Output is correct
14 Correct 554 ms 16532 KB Output is correct
15 Correct 772 ms 17332 KB Output is correct
16 Correct 600 ms 16688 KB Output is correct
17 Correct 686 ms 16596 KB Output is correct
18 Correct 539 ms 18296 KB Output is correct
19 Correct 504 ms 15480 KB Output is correct
20 Correct 728 ms 16988 KB Output is correct
21 Correct 736 ms 17388 KB Output is correct
22 Correct 744 ms 17560 KB Output is correct
23 Correct 710 ms 16560 KB Output is correct
24 Correct 692 ms 16376 KB Output is correct
25 Correct 882 ms 18576 KB Output is correct
26 Correct 751 ms 16896 KB Output is correct
27 Correct 728 ms 16868 KB Output is correct
28 Correct 591 ms 19396 KB Output is correct
29 Correct 613 ms 15480 KB Output is correct
30 Correct 891 ms 17456 KB Output is correct
31 Correct 698 ms 17364 KB Output is correct
32 Correct 719 ms 17572 KB Output is correct
33 Correct 671 ms 16360 KB Output is correct
34 Correct 721 ms 16396 KB Output is correct
35 Correct 748 ms 17016 KB Output is correct
36 Correct 507 ms 15464 KB Output is correct
37 Correct 660 ms 17324 KB Output is correct
38 Correct 593 ms 15428 KB Output is correct
39 Correct 761 ms 16528 KB Output is correct
40 Correct 673 ms 16372 KB Output is correct
41 Correct 498 ms 17272 KB Output is correct
42 Correct 535 ms 17432 KB Output is correct
43 Correct 440 ms 17472 KB Output is correct
44 Correct 452 ms 17432 KB Output is correct
45 Correct 500 ms 17508 KB Output is correct
46 Correct 475 ms 17364 KB Output is correct
47 Correct 529 ms 17436 KB Output is correct
48 Correct 426 ms 17688 KB Output is correct
49 Correct 467 ms 17236 KB Output is correct
50 Correct 450 ms 17404 KB Output is correct
51 Correct 445 ms 17432 KB Output is correct
52 Correct 457 ms 17428 KB Output is correct
53 Correct 494 ms 17452 KB Output is correct
54 Correct 562 ms 17424 KB Output is correct
55 Correct 532 ms 17364 KB Output is correct
56 Correct 476 ms 17304 KB Output is correct
57 Correct 536 ms 17560 KB Output is correct
58 Correct 482 ms 17308 KB Output is correct
59 Correct 565 ms 17304 KB Output is correct
60 Correct 539 ms 17432 KB Output is correct
61 Correct 638 ms 17480 KB Output is correct
62 Correct 491 ms 17432 KB Output is correct
63 Correct 523 ms 17368 KB Output is correct
64 Correct 469 ms 17304 KB Output is correct
65 Correct 490 ms 17432 KB Output is correct
66 Correct 532 ms 17364 KB Output is correct
67 Correct 518 ms 17372 KB Output is correct
68 Correct 509 ms 17432 KB Output is correct
69 Correct 548 ms 17368 KB Output is correct
70 Correct 501 ms 17456 KB Output is correct
71 Correct 1580 ms 32272 KB Output is correct
72 Correct 1584 ms 32536 KB Output is correct
73 Correct 1537 ms 30992 KB Output is correct
74 Correct 1659 ms 31300 KB Output is correct
75 Correct 1860 ms 33288 KB Output is correct
76 Correct 1861 ms 53064 KB Output is correct
77 Correct 1850 ms 53148 KB Output is correct
78 Correct 1154 ms 56768 KB Output is correct
79 Correct 1319 ms 50944 KB Output is correct
80 Correct 1625 ms 53968 KB Output is correct
81 Correct 1997 ms 53852 KB Output is correct
82 Correct 1794 ms 52828 KB Output is correct
83 Correct 1413 ms 51976 KB Output is correct
84 Correct 1778 ms 52888 KB Output is correct
85 Correct 1744 ms 53084 KB Output is correct
86 Correct 999 ms 50796 KB Output is correct
87 Correct 1441 ms 53876 KB Output is correct
88 Correct 1233 ms 51096 KB Output is correct
89 Correct 1623 ms 52520 KB Output is correct
90 Correct 1769 ms 52816 KB Output is correct
91 Correct 1344 ms 51960 KB Output is correct
92 Correct 1763 ms 53272 KB Output is correct
93 Correct 1819 ms 53136 KB Output is correct
94 Correct 1139 ms 50972 KB Output is correct
95 Correct 1641 ms 52940 KB Output is correct
96 Correct 1699 ms 52988 KB Output is correct
97 Correct 1610 ms 52896 KB Output is correct
98 Correct 1707 ms 53132 KB Output is correct
99 Correct 1669 ms 53016 KB Output is correct
100 Correct 1577 ms 53032 KB Output is correct