oj.uz

Submission #329320

# Submission time Handle Problem Language Result Execution time Memory
329320 2020-11-20T14:52:14 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
12 / 100
 366 ms 9856 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int n, q;
int pw3[20];
int dp[1 << 20]; //3**13
int a[1 << 20];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    pw3[0] = 1;
    fi(1, 20) pw3[i] = pw3[i - 1] * 3;

    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
    	char c;
    	cin >> c;
    	a[i] = c - '0';
    }
    for (int mask = 0; mask < pw3[n]; ++mask) {
    	int cur = mask;
    	int mask2 = 0;
    	int pos3 = -1;
    	for (int it = 0; it < n; ++it) {
    		if (cur % 3 == 2) {
    			pos3 = it;
    		}  else if (cur % 3 == 1) {
    			mask2 += 1 << it;
    		}
    		cur /= 3;
    	}
    	if (pos3 == -1) {
    		dp[mask] = a[mask2];
    	} else {
    		dp[mask] = dp[mask - pw3[pos3]] + dp[mask - 2 * pw3[pos3]];
    	}
    }
    while (q--) {
    	int x = 0;
    	fi(0, n) {
    		char c;
    		cin >> c;
    		if (c == '1') x += pw3[n - i - 1];
    		if (c == '?') x += 2 * pw3[n - i - 1]; 
    	}
    	cout << dp[x] << '\n';
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 335 ms 5484 KB Output is correct
12 Correct 337 ms 5316 KB Output is correct
13 Correct 344 ms 4332 KB Output is correct
14 Correct 355 ms 4332 KB Output is correct
15 Correct 337 ms 5100 KB Output is correct
16 Correct 357 ms 4404 KB Output is correct
17 Correct 366 ms 4288 KB Output is correct
18 Correct 259 ms 6124 KB Output is correct
19 Correct 313 ms 2924 KB Output is correct
20 Correct 328 ms 4588 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 335 ms 5484 KB Output is correct
12 Correct 337 ms 5316 KB Output is correct
13 Correct 344 ms 4332 KB Output is correct
14 Correct 355 ms 4332 KB Output is correct
15 Correct 337 ms 5100 KB Output is correct
16 Correct 357 ms 4404 KB Output is correct
17 Correct 366 ms 4288 KB Output is correct
18 Correct 259 ms 6124 KB Output is correct
19 Correct 313 ms 2924 KB Output is correct
20 Correct 328 ms 4588 KB Output is correct
21 Runtime error 53 ms 9496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Runtime error 28 ms 9856 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 335 ms 5484 KB Output is correct
12 Correct 337 ms 5316 KB Output is correct
13 Correct 344 ms 4332 KB Output is correct
14 Correct 355 ms 4332 KB Output is correct
15 Correct 337 ms 5100 KB Output is correct
16 Correct 357 ms 4404 KB Output is correct
17 Correct 366 ms 4288 KB Output is correct
18 Correct 259 ms 6124 KB Output is correct
19 Correct 313 ms 2924 KB Output is correct
20 Correct 328 ms 4588 KB Output is correct
21 Runtime error 53 ms 9496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -