oj.uz

답안 #329318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329318 2020-11-20T14:13:37 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
12 / 100
 2000 ms 44012 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 a[1 << 20];


str s;
int ans;

void gen(int i, int x = 0) {
	if (i == n) {
		ans += a[x];
		return;
	}
	if (s[i] != '1')
		gen(i + 1, x);
	if (s[i] != '0')
		gen(i + 1, x + (1 << i));
}

map<string, int> was;

int get() {
	if (!was.count(s)) {
		ans = 0;
		gen(0);
		was[s] = ans;
	}
	return was[s];
}

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

    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
    	char c;
    	cin >> c;
    	a[i] = c - '0';
    }
    while (q--) {
    	cin >> s;
    	reverse(all(s));
    	cout << get() << '\n';
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 466 ms 15212 KB Output is correct
12 Correct 590 ms 15212 KB Output is correct
13 Correct 763 ms 14900 KB Output is correct
14 Correct 690 ms 14540 KB Output is correct
15 Correct 659 ms 15724 KB Output is correct
16 Correct 812 ms 15724 KB Output is correct
17 Correct 1073 ms 19052 KB Output is correct
18 Correct 216 ms 16108 KB Output is correct
19 Correct 450 ms 13420 KB Output is correct
20 Correct 599 ms 14956 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 466 ms 15212 KB Output is correct
12 Correct 590 ms 15212 KB Output is correct
13 Correct 763 ms 14900 KB Output is correct
14 Correct 690 ms 14540 KB Output is correct
15 Correct 659 ms 15724 KB Output is correct
16 Correct 812 ms 15724 KB Output is correct
17 Correct 1073 ms 19052 KB Output is correct
18 Correct 216 ms 16108 KB Output is correct
19 Correct 450 ms 13420 KB Output is correct
20 Correct 599 ms 14956 KB Output is correct
21 Correct 648 ms 18284 KB Output is correct
22 Correct 824 ms 19052 KB Output is correct
23 Correct 1776 ms 34484 KB Output is correct
24 Correct 1333 ms 24428 KB Output is correct
25 Correct 1151 ms 22896 KB Output is correct
26 Execution timed out 2078 ms 44012 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 686 ms 11808 KB Output is correct
12 Execution timed out 2047 ms 10524 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 466 ms 15212 KB Output is correct
12 Correct 590 ms 15212 KB Output is correct
13 Correct 763 ms 14900 KB Output is correct
14 Correct 690 ms 14540 KB Output is correct
15 Correct 659 ms 15724 KB Output is correct
16 Correct 812 ms 15724 KB Output is correct
17 Correct 1073 ms 19052 KB Output is correct
18 Correct 216 ms 16108 KB Output is correct
19 Correct 450 ms 13420 KB Output is correct
20 Correct 599 ms 14956 KB Output is correct
21 Correct 648 ms 18284 KB Output is correct
22 Correct 824 ms 19052 KB Output is correct
23 Correct 1776 ms 34484 KB Output is correct
24 Correct 1333 ms 24428 KB Output is correct
25 Correct 1151 ms 22896 KB Output is correct
26 Execution timed out 2078 ms 44012 KB Time limit exceeded
27 Halted 0 ms 0 KB -