oj.uz

답안 #122577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122577 2019-06-28T16:07:54 Z egorlifar Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 23832 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 - 8; i++) {
		t *= 3;
	}
	g[0] = 1;
	for (int i = 1; i <= 20; i++) {
		g[i] = g[i - 1] * 3;
	}
	if (l <= 8) {
		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 = 8; i < l; i++) {
			who[it] += (int)st[i] * cur;
			cur *= 3;
		}
		for (int i = 0; i < 8; i++) {
			prefs[it] += (int)st[i] * g[i];
		}
	}	
	for (int i = 0; i < l - 8; 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 - 8 - 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 - 8; j++) {
				int g = curi % 3;
				if (g) {
					nmask += 1 << j;
				}
				curi /= 3;
			}
			kt[i] = nmask;
		}
	}

	for (int mask = 0; mask < 256; mask++) {
		for (int i = 0; i < t; i++) {
			if (pos[i] == 0) {
				dp[i] = c[(kt[i] << 8) + mask];
			} else {
				int ft = g[pos[i] - 1];
				dp[i] = dp[i - ft] + dp[i - (ft << 1)];
			}
		}
		for (int j = 0; j < g[8]; j++) {
			bad[j] = false;
			int cur = j;
			for (int f = 0; f < 8; 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

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 512 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 57 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 21 ms 384 KB Output is correct
7 Correct 21 ms 512 KB Output is correct
8 Correct 21 ms 512 KB Output is correct
9 Correct 22 ms 504 KB Output is correct
10 Correct 22 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 512 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 57 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 21 ms 384 KB Output is correct
7 Correct 21 ms 512 KB Output is correct
8 Correct 21 ms 512 KB Output is correct
9 Correct 22 ms 504 KB Output is correct
10 Correct 22 ms 384 KB Output is correct
11 Correct 1066 ms 16120 KB Output is correct
12 Correct 1075 ms 15836 KB Output is correct
13 Correct 904 ms 15036 KB Output is correct
14 Correct 929 ms 15152 KB Output is correct
15 Correct 1132 ms 16120 KB Output is correct
16 Correct 995 ms 15376 KB Output is correct
17 Correct 907 ms 15352 KB Output is correct
18 Correct 647 ms 17144 KB Output is correct
19 Correct 662 ms 14196 KB Output is correct
20 Correct 1163 ms 15700 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 512 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 57 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 21 ms 384 KB Output is correct
7 Correct 21 ms 512 KB Output is correct
8 Correct 21 ms 512 KB Output is correct
9 Correct 22 ms 504 KB Output is correct
10 Correct 22 ms 384 KB Output is correct
11 Correct 1066 ms 16120 KB Output is correct
12 Correct 1075 ms 15836 KB Output is correct
13 Correct 904 ms 15036 KB Output is correct
14 Correct 929 ms 15152 KB Output is correct
15 Correct 1132 ms 16120 KB Output is correct
16 Correct 995 ms 15376 KB Output is correct
17 Correct 907 ms 15352 KB Output is correct
18 Correct 647 ms 17144 KB Output is correct
19 Correct 662 ms 14196 KB Output is correct
20 Correct 1163 ms 15700 KB Output is correct
21 Correct 1166 ms 16060 KB Output is correct
22 Correct 1190 ms 16376 KB Output is correct
23 Correct 987 ms 15352 KB Output is correct
24 Correct 1002 ms 15196 KB Output is correct
25 Correct 1286 ms 17168 KB Output is correct
26 Correct 888 ms 15608 KB Output is correct
27 Correct 904 ms 15608 KB Output is correct
28 Correct 658 ms 18128 KB Output is correct
29 Correct 688 ms 14332 KB Output is correct
30 Correct 1075 ms 16248 KB Output is correct
31 Correct 1059 ms 16120 KB Output is correct
32 Correct 1026 ms 16128 KB Output is correct
33 Correct 859 ms 15132 KB Output is correct
34 Correct 982 ms 15224 KB Output is correct
35 Correct 1034 ms 15608 KB Output is correct
36 Correct 619 ms 14192 KB Output is correct
37 Correct 1028 ms 16248 KB Output is correct
38 Correct 778 ms 14200 KB Output is correct
39 Correct 978 ms 15352 KB Output is correct
40 Correct 906 ms 15144 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 512 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 57 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 21 ms 384 KB Output is correct
7 Correct 21 ms 512 KB Output is correct
8 Correct 21 ms 512 KB Output is correct
9 Correct 22 ms 504 KB Output is correct
10 Correct 22 ms 384 KB Output is correct
11 Correct 354 ms 7836 KB Output is correct
12 Correct 370 ms 7832 KB Output is correct
13 Correct 370 ms 7828 KB Output is correct
14 Correct 382 ms 7832 KB Output is correct
15 Correct 394 ms 7960 KB Output is correct
16 Correct 400 ms 7832 KB Output is correct
17 Correct 374 ms 7832 KB Output is correct
18 Correct 392 ms 7964 KB Output is correct
19 Correct 351 ms 7704 KB Output is correct
20 Correct 425 ms 7832 KB Output is correct
21 Correct 372 ms 7832 KB Output is correct
22 Correct 358 ms 7836 KB Output is correct
23 Correct 336 ms 7836 KB Output is correct
24 Correct 346 ms 7836 KB Output is correct
25 Correct 352 ms 7832 KB Output is correct
26 Correct 325 ms 7704 KB Output is correct
27 Correct 344 ms 7832 KB Output is correct
28 Correct 331 ms 7704 KB Output is correct
29 Correct 363 ms 7832 KB Output is correct
30 Correct 356 ms 7772 KB Output is correct
31 Correct 350 ms 7704 KB Output is correct
32 Correct 393 ms 7832 KB Output is correct
33 Correct 430 ms 7832 KB Output is correct
34 Correct 372 ms 7704 KB Output is correct
35 Correct 397 ms 7832 KB Output is correct
36 Correct 360 ms 7824 KB Output is correct
37 Correct 363 ms 7808 KB Output is correct
38 Correct 348 ms 7836 KB Output is correct
39 Correct 354 ms 7924 KB Output is correct
40 Correct 354 ms 7832 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 512 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 57 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 21 ms 384 KB Output is correct
7 Correct 21 ms 512 KB Output is correct
8 Correct 21 ms 512 KB Output is correct
9 Correct 22 ms 504 KB Output is correct
10 Correct 22 ms 384 KB Output is correct
11 Correct 1066 ms 16120 KB Output is correct
12 Correct 1075 ms 15836 KB Output is correct
13 Correct 904 ms 15036 KB Output is correct
14 Correct 929 ms 15152 KB Output is correct
15 Correct 1132 ms 16120 KB Output is correct
16 Correct 995 ms 15376 KB Output is correct
17 Correct 907 ms 15352 KB Output is correct
18 Correct 647 ms 17144 KB Output is correct
19 Correct 662 ms 14196 KB Output is correct
20 Correct 1163 ms 15700 KB Output is correct
21 Correct 1166 ms 16060 KB Output is correct
22 Correct 1190 ms 16376 KB Output is correct
23 Correct 987 ms 15352 KB Output is correct
24 Correct 1002 ms 15196 KB Output is correct
25 Correct 1286 ms 17168 KB Output is correct
26 Correct 888 ms 15608 KB Output is correct
27 Correct 904 ms 15608 KB Output is correct
28 Correct 658 ms 18128 KB Output is correct
29 Correct 688 ms 14332 KB Output is correct
30 Correct 1075 ms 16248 KB Output is correct
31 Correct 1059 ms 16120 KB Output is correct
32 Correct 1026 ms 16128 KB Output is correct
33 Correct 859 ms 15132 KB Output is correct
34 Correct 982 ms 15224 KB Output is correct
35 Correct 1034 ms 15608 KB Output is correct
36 Correct 619 ms 14192 KB Output is correct
37 Correct 1028 ms 16248 KB Output is correct
38 Correct 778 ms 14200 KB Output is correct
39 Correct 978 ms 15352 KB Output is correct
40 Correct 906 ms 15144 KB Output is correct
41 Correct 354 ms 7836 KB Output is correct
42 Correct 370 ms 7832 KB Output is correct
43 Correct 370 ms 7828 KB Output is correct
44 Correct 382 ms 7832 KB Output is correct
45 Correct 394 ms 7960 KB Output is correct
46 Correct 400 ms 7832 KB Output is correct
47 Correct 374 ms 7832 KB Output is correct
48 Correct 392 ms 7964 KB Output is correct
49 Correct 351 ms 7704 KB Output is correct
50 Correct 425 ms 7832 KB Output is correct
51 Correct 372 ms 7832 KB Output is correct
52 Correct 358 ms 7836 KB Output is correct
53 Correct 336 ms 7836 KB Output is correct
54 Correct 346 ms 7836 KB Output is correct
55 Correct 352 ms 7832 KB Output is correct
56 Correct 325 ms 7704 KB Output is correct
57 Correct 344 ms 7832 KB Output is correct
58 Correct 331 ms 7704 KB Output is correct
59 Correct 363 ms 7832 KB Output is correct
60 Correct 356 ms 7772 KB Output is correct
61 Correct 350 ms 7704 KB Output is correct
62 Correct 393 ms 7832 KB Output is correct
63 Correct 430 ms 7832 KB Output is correct
64 Correct 372 ms 7704 KB Output is correct
65 Correct 397 ms 7832 KB Output is correct
66 Correct 360 ms 7824 KB Output is correct
67 Correct 363 ms 7808 KB Output is correct
68 Correct 348 ms 7836 KB Output is correct
69 Correct 354 ms 7924 KB Output is correct
70 Correct 354 ms 7832 KB Output is correct
71 Correct 1689 ms 23640 KB Output is correct
72 Correct 1702 ms 23832 KB Output is correct
73 Correct 1714 ms 22392 KB Output is correct
74 Execution timed out 2053 ms 20616 KB Time limit exceeded
75 Halted 0 ms 0 KB -