oj.uz

Submission #66940

# Submission time Handle Problem Language Result Execution time Memory
66940 2018-08-12T20:04:29 Z ekrem Snake Escaping (JOI18_snake_escaping) C++
12 / 100
 1152 ms 32148 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1600005
using namespace std;

int n, m, a[(1<<20)+10], dp[N], prec[N], cvp[N], kaps[3000][200];
char c;
pair < int , int > q[1000002];
void hesapla(int);

// bool kapsar(int uc, int iki){
// 	// cout << uc << iki << endl;
// 	if(kaps[uc][iki] != -1)
// 		return kaps[uc][iki];
// 	int yuc = uc;
// 	int yiki = iki;
// 	for(int i = 1; i <= 7; i++){
// 		if(yuc%3 != 2 and yiki%2 != yuc%3)
// 			return kaps[uc][iki] = 0;
// 		yuc /= 3;
// 		yiki /= 3;
// 	}
// 	return kaps[uc][iki] = 1;
// }

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	for(int i = 0; i < 1594323; i++){
		int x = i, crp = 1, ckr = -1, say = 0, bit = 0;
		while(x){
			if(x%3 == 2){
				ckr = crp;
				break;
			}
			bit += (1<<say)*(x%3);
			say++;
			crp *= 3;
			x /= 3;
		}
		if(ckr == -1)
			prec[i] = -bit;
		else
			prec[i] = ckr;
	}
	memset(dp, -1, sizeof dp);
	memset(kaps, -1, sizeof kaps);
	scanf("%d %d",&n ,&m);
	for(int i = 0; i < (1<<n); i++){
		scanf(" %c",&c);
		a[i] = c - '0';
	}
	for(int i = 1; i <= m; i++){
		int bit = 0, say = 0, son = 0, crp = 1;
		for(int i = 1; i <= n; i++){
			scanf(" %c" ,&c);
			bit *= 3;
			bit += (c == '?') ? 2 : c - '0';
		}
		// cout << bit << endl;
		for(int say = 1; say <= 13; say++){
			son += crp*(bit%3);
			crp *= 3;
			bit/=3;
		}
		// cout << bit << " -> " << son << endl;
		q[i] = mp(bit, son);
		// printf("%d\n",bul(bit, son));
	}

	// for(int i = 0; i < 2187 ; i++)
	// 	for(int j = 0; j < (1<<7); j++){
	// 		int yuc = i;
	// 		int yiki = j;
	// 		bool f = 1;
	// 		for(int i = 1; i <= 7; i++){
	// 			if(yuc%3 != 2 and yiki%2 != yuc%3){
	// 				f = kaps[i][j] = 0;
	// 				break;
	// 			}
	// 			yuc /= 3;
	// 			yiki /= 3;
	// 		}
	// 		if(f)
	// 			return kaps[i][j] = 1;
	// 	}
	for(int i = 0; i < 2187; i++)
		for(int j = 0; j < (1<<7); j++){
			if(i%3 != 2 and i%3 != j%2)
				kaps[i][j] = 0;
			else
				kaps[i][j] = kaps[i/3][j/2];
		}

	for(int i = 0; i < (1<<7); i++){

		for(int j = 0; j < 159323; j++){
			if(prec[j] <= 0)
				dp[j] = a[i*(1<<13) - prec[j]];
			else
				dp[j] = dp[j - prec[j]] + dp[j - prec[j]*2];
		}

		for(int j = 1; j <= m; j++)
			if(kaps[q[j].st][i])
				cvp[j] += dp[q[j].nd];
	}
	for(int i = 1; i <= m; i++)
		printf("%d\n",cvp[i]);
	return 0;
}


void hesapla(int bit){
	int yed = bit, crp = 1, ckr = -1;
	while(yed){
		if(yed%3 == 2){
			ckr = crp;
			break;
		}
		crp *= 3;
		yed /= 3;
	}
	prec[bit] = ckr;
	if(ckr == -1){
		yed = bit;
		int say = 0, cvp = 0;
		while(yed){
			cvp += (1<<say)*(yed%3);
			say++;
			yed /= 3;
		}
		prec[bit] = -cvp;
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:57:16: warning: unused variable 'say' [-Wunused-variable]
   int bit = 0, say = 0, son = 0, crp = 1;
                ^~~
snake_escaping.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n ,&m);
  ~~~~~^~~~~~~~~~~~~~~~
snake_escaping.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&c);
   ~~~~~^~~~~~~~~~
snake_escaping.cpp:59:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c" ,&c);
    ~~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15228 KB Output is correct
2 Correct 65 ms 15404 KB Output is correct
3 Correct 68 ms 15404 KB Output is correct
4 Correct 66 ms 15428 KB Output is correct
5 Correct 59 ms 15428 KB Output is correct
6 Correct 64 ms 15428 KB Output is correct
7 Correct 64 ms 15568 KB Output is correct
8 Correct 86 ms 15568 KB Output is correct
9 Correct 63 ms 15568 KB Output is correct
10 Correct 64 ms 15568 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15228 KB Output is correct
2 Correct 65 ms 15404 KB Output is correct
3 Correct 68 ms 15404 KB Output is correct
4 Correct 66 ms 15428 KB Output is correct
5 Correct 59 ms 15428 KB Output is correct
6 Correct 64 ms 15428 KB Output is correct
7 Correct 64 ms 15568 KB Output is correct
8 Correct 86 ms 15568 KB Output is correct
9 Correct 63 ms 15568 KB Output is correct
10 Correct 64 ms 15568 KB Output is correct
11 Correct 1077 ms 31344 KB Output is correct
12 Correct 971 ms 31344 KB Output is correct
13 Correct 967 ms 31344 KB Output is correct
14 Correct 985 ms 31344 KB Output is correct
15 Correct 1002 ms 31344 KB Output is correct
16 Correct 1000 ms 31344 KB Output is correct
17 Correct 993 ms 31344 KB Output is correct
18 Correct 927 ms 32148 KB Output is correct
19 Correct 919 ms 32148 KB Output is correct
20 Correct 1055 ms 32148 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15228 KB Output is correct
2 Correct 65 ms 15404 KB Output is correct
3 Correct 68 ms 15404 KB Output is correct
4 Correct 66 ms 15428 KB Output is correct
5 Correct 59 ms 15428 KB Output is correct
6 Correct 64 ms 15428 KB Output is correct
7 Correct 64 ms 15568 KB Output is correct
8 Correct 86 ms 15568 KB Output is correct
9 Correct 63 ms 15568 KB Output is correct
10 Correct 64 ms 15568 KB Output is correct
11 Correct 1077 ms 31344 KB Output is correct
12 Correct 971 ms 31344 KB Output is correct
13 Correct 967 ms 31344 KB Output is correct
14 Correct 985 ms 31344 KB Output is correct
15 Correct 1002 ms 31344 KB Output is correct
16 Correct 1000 ms 31344 KB Output is correct
17 Correct 993 ms 31344 KB Output is correct
18 Correct 927 ms 32148 KB Output is correct
19 Correct 919 ms 32148 KB Output is correct
20 Correct 1055 ms 32148 KB Output is correct
21 Incorrect 1152 ms 32148 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15228 KB Output is correct
2 Correct 65 ms 15404 KB Output is correct
3 Correct 68 ms 15404 KB Output is correct
4 Correct 66 ms 15428 KB Output is correct
5 Correct 59 ms 15428 KB Output is correct
6 Correct 64 ms 15428 KB Output is correct
7 Correct 64 ms 15568 KB Output is correct
8 Correct 86 ms 15568 KB Output is correct
9 Correct 63 ms 15568 KB Output is correct
10 Correct 64 ms 15568 KB Output is correct
11 Incorrect 205 ms 32148 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15228 KB Output is correct
2 Correct 65 ms 15404 KB Output is correct
3 Correct 68 ms 15404 KB Output is correct
4 Correct 66 ms 15428 KB Output is correct
5 Correct 59 ms 15428 KB Output is correct
6 Correct 64 ms 15428 KB Output is correct
7 Correct 64 ms 15568 KB Output is correct
8 Correct 86 ms 15568 KB Output is correct
9 Correct 63 ms 15568 KB Output is correct
10 Correct 64 ms 15568 KB Output is correct
11 Correct 1077 ms 31344 KB Output is correct
12 Correct 971 ms 31344 KB Output is correct
13 Correct 967 ms 31344 KB Output is correct
14 Correct 985 ms 31344 KB Output is correct
15 Correct 1002 ms 31344 KB Output is correct
16 Correct 1000 ms 31344 KB Output is correct
17 Correct 993 ms 31344 KB Output is correct
18 Correct 927 ms 32148 KB Output is correct
19 Correct 919 ms 32148 KB Output is correct
20 Correct 1055 ms 32148 KB Output is correct
21 Incorrect 1152 ms 32148 KB Output isn't correct
22 Halted 0 ms 0 KB -