oj.uz

Submission #828100

# Submission time Handle Problem Language Result Execution time Memory
828100 2023-08-17T04:34:03 Z NhanBeoo Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1988 ms 65536 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
#pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

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

// #define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;

struct Trie{
	struct Node{
		int cnt, exist, sum;
		Node* child[2];
		Node(){
			cnt = exist = sum = 0;
			child[0] = child[1] = NULL;
		}
	};
	Node* root;
	Trie(){
		root = new Node();
	}
	int LG;
	void init(int n){
		LG = n-1;
	}
	void add(int n, int val){
		Node* p = root;
		for(int i=LG; i>=0; i--){
			bool c = n & (1<<i);
			if(p->child[c] == NULL) p->child[c] = new Node();
			p = p->child[c];
			p->cnt++;
		}
		p->exist++;
		p->sum += val;
	}
	int dequy(Node* p, string& s, int i){
		if(i == LG + 1) return p->sum;
		if(s[i] == '0') return dequy(p->child[0], s, i+1);
		else if(s[i] == '1') return dequy(p->child[1], s, i+1);
		else return dequy(p->child[0], s, i+1) + dequy(p->child[1], s, i+1);
	}
	int find(string s){
		return dequy(root, s, 0);
	}
} trie;

map<string, int> m;

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n, q; cin >> n >> q;
	string s; cin >> s;
	trie.init(n);
	for(int i=0; i<(1<<n); i++) trie.add(i, s[i] - '0');
	while(q--){
		string tmp; cin >> tmp;
		if(m[tmp] != 0) cout << m[tmp] << endl;
		else{
			int ans = trie.find(tmp);
			m[tmp] = ans;
			cout << ans << endl;
		}
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 251 ms 4472 KB Output is correct
12 Correct 365 ms 4156 KB Output is correct
13 Correct 453 ms 3964 KB Output is correct
14 Correct 401 ms 3700 KB Output is correct
15 Correct 411 ms 4772 KB Output is correct
16 Correct 485 ms 4724 KB Output is correct
17 Correct 595 ms 8076 KB Output is correct
18 Correct 144 ms 5300 KB Output is correct
19 Correct 250 ms 2320 KB Output is correct
20 Correct 347 ms 4172 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 251 ms 4472 KB Output is correct
12 Correct 365 ms 4156 KB Output is correct
13 Correct 453 ms 3964 KB Output is correct
14 Correct 401 ms 3700 KB Output is correct
15 Correct 411 ms 4772 KB Output is correct
16 Correct 485 ms 4724 KB Output is correct
17 Correct 595 ms 8076 KB Output is correct
18 Correct 144 ms 5300 KB Output is correct
19 Correct 250 ms 2320 KB Output is correct
20 Correct 347 ms 4172 KB Output is correct
21 Correct 381 ms 5192 KB Output is correct
22 Correct 470 ms 5836 KB Output is correct
23 Correct 972 ms 21272 KB Output is correct
24 Correct 686 ms 11160 KB Output is correct
25 Correct 673 ms 9240 KB Output is correct
26 Correct 1361 ms 31388 KB Output is correct
27 Correct 1950 ms 64456 KB Output is correct
28 Correct 157 ms 7296 KB Output is correct
29 Correct 378 ms 3368 KB Output is correct
30 Correct 495 ms 6108 KB Output is correct
31 Correct 1109 ms 22304 KB Output is correct
32 Correct 708 ms 12364 KB Output is correct
33 Correct 573 ms 7444 KB Output is correct
34 Correct 1247 ms 31080 KB Output is correct
35 Correct 1988 ms 65536 KB Output is correct
36 Correct 147 ms 3260 KB Output is correct
37 Correct 377 ms 5564 KB Output is correct
38 Correct 491 ms 3908 KB Output is correct
39 Correct 966 ms 21544 KB Output is correct
40 Correct 687 ms 11412 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Runtime error 78 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 251 ms 4472 KB Output is correct
12 Correct 365 ms 4156 KB Output is correct
13 Correct 453 ms 3964 KB Output is correct
14 Correct 401 ms 3700 KB Output is correct
15 Correct 411 ms 4772 KB Output is correct
16 Correct 485 ms 4724 KB Output is correct
17 Correct 595 ms 8076 KB Output is correct
18 Correct 144 ms 5300 KB Output is correct
19 Correct 250 ms 2320 KB Output is correct
20 Correct 347 ms 4172 KB Output is correct
21 Correct 381 ms 5192 KB Output is correct
22 Correct 470 ms 5836 KB Output is correct
23 Correct 972 ms 21272 KB Output is correct
24 Correct 686 ms 11160 KB Output is correct
25 Correct 673 ms 9240 KB Output is correct
26 Correct 1361 ms 31388 KB Output is correct
27 Correct 1950 ms 64456 KB Output is correct
28 Correct 157 ms 7296 KB Output is correct
29 Correct 378 ms 3368 KB Output is correct
30 Correct 495 ms 6108 KB Output is correct
31 Correct 1109 ms 22304 KB Output is correct
32 Correct 708 ms 12364 KB Output is correct
33 Correct 573 ms 7444 KB Output is correct
34 Correct 1247 ms 31080 KB Output is correct
35 Correct 1988 ms 65536 KB Output is correct
36 Correct 147 ms 3260 KB Output is correct
37 Correct 377 ms 5564 KB Output is correct
38 Correct 491 ms 3908 KB Output is correct
39 Correct 966 ms 21544 KB Output is correct
40 Correct 687 ms 11412 KB Output is correct
41 Runtime error 78 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -