oj.uz

Submission #66928

# Submission time Handle Problem Language Result Execution time Memory
66928 2018-08-12T19:30:50 Z ekrem Snake Escaping (JOI18_snake_escaping) C++
12 / 100
 1427 ms 32168 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[N], dp[N], prec[N], cvp[N], kaps[3000][200];
char c;
pair < int , int > q[N];
void hesapla(int);


// bas bitinin ikilik bitde 7 uzunlugunda ? isaretsiz oldugunu varsay bit 13 uzun.
// int f(int bas, int bit){
// 	if(dp[bit] != -1)
// 		return dp[bit];
// 	int x = prec[bit];
// 	if(x <= 0){
// 		x = -x;
// 		// cout << x << endl;
// 		int sorg = bas*(1<<13) + x;
// 		// cout << sorg<< " -> " << a[sorg] << endl;
// 		return dp[bit] = a[sorg];
// 	}
// 	return dp[bit] = f(bas, bit - x) + f(bas, bit - x - x);
// }

//bu sefer bas'da soru isareti olabilir.
// int bul(int bas, int son){
// 	int x = prec[bas];
// 	if(x <= 0)
// 		return dp[-prec[bas]][ son];
// 	return bul(bas - x, son) + bul(bas - x - x, son);
// }

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 < N; i++)
		hesapla(i);
	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++)
			kapsar(i, j);

	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(kapsar(q[j].st, i)){
				// cout << i << " - > " << q[j].nd << endl;
				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 'bool kapsar(int, int)':
snake_escaping.cpp:46:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    return kaps[uc][iki] = 0;
           ~~~~~~~~~~~~~~^~~
snake_escaping.cpp:50:23: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  return kaps[uc][iki] = 1;
         ~~~~~~~~~~~~~~^~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:66:16: warning: unused variable 'say' [-Wunused-variable]
   int bit = 0, say = 0, son = 0, crp = 1;
                ^~~
snake_escaping.cpp:60: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:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&c);
   ~~~~~^~~~~~~~~~
snake_escaping.cpp:68: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 71 ms 15224 KB Output is correct
2 Correct 78 ms 15412 KB Output is correct
3 Correct 71 ms 15412 KB Output is correct
4 Correct 73 ms 15476 KB Output is correct
5 Correct 77 ms 15476 KB Output is correct
6 Correct 72 ms 15536 KB Output is correct
7 Correct 72 ms 15536 KB Output is correct
8 Correct 70 ms 15536 KB Output is correct
9 Correct 77 ms 15536 KB Output is correct
10 Correct 80 ms 15536 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 15224 KB Output is correct
2 Correct 78 ms 15412 KB Output is correct
3 Correct 71 ms 15412 KB Output is correct
4 Correct 73 ms 15476 KB Output is correct
5 Correct 77 ms 15476 KB Output is correct
6 Correct 72 ms 15536 KB Output is correct
7 Correct 72 ms 15536 KB Output is correct
8 Correct 70 ms 15536 KB Output is correct
9 Correct 77 ms 15536 KB Output is correct
10 Correct 80 ms 15536 KB Output is correct
11 Correct 1168 ms 31152 KB Output is correct
12 Correct 1212 ms 31152 KB Output is correct
13 Correct 1185 ms 31152 KB Output is correct
14 Correct 1276 ms 31152 KB Output is correct
15 Correct 1119 ms 31248 KB Output is correct
16 Correct 1222 ms 31248 KB Output is correct
17 Correct 1270 ms 31248 KB Output is correct
18 Correct 1096 ms 32168 KB Output is correct
19 Correct 1056 ms 32168 KB Output is correct
20 Correct 1234 ms 32168 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 15224 KB Output is correct
2 Correct 78 ms 15412 KB Output is correct
3 Correct 71 ms 15412 KB Output is correct
4 Correct 73 ms 15476 KB Output is correct
5 Correct 77 ms 15476 KB Output is correct
6 Correct 72 ms 15536 KB Output is correct
7 Correct 72 ms 15536 KB Output is correct
8 Correct 70 ms 15536 KB Output is correct
9 Correct 77 ms 15536 KB Output is correct
10 Correct 80 ms 15536 KB Output is correct
11 Correct 1168 ms 31152 KB Output is correct
12 Correct 1212 ms 31152 KB Output is correct
13 Correct 1185 ms 31152 KB Output is correct
14 Correct 1276 ms 31152 KB Output is correct
15 Correct 1119 ms 31248 KB Output is correct
16 Correct 1222 ms 31248 KB Output is correct
17 Correct 1270 ms 31248 KB Output is correct
18 Correct 1096 ms 32168 KB Output is correct
19 Correct 1056 ms 32168 KB Output is correct
20 Correct 1234 ms 32168 KB Output is correct
21 Incorrect 1427 ms 32168 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 15224 KB Output is correct
2 Correct 78 ms 15412 KB Output is correct
3 Correct 71 ms 15412 KB Output is correct
4 Correct 73 ms 15476 KB Output is correct
5 Correct 77 ms 15476 KB Output is correct
6 Correct 72 ms 15536 KB Output is correct
7 Correct 72 ms 15536 KB Output is correct
8 Correct 70 ms 15536 KB Output is correct
9 Correct 77 ms 15536 KB Output is correct
10 Correct 80 ms 15536 KB Output is correct
11 Incorrect 266 ms 32168 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 15224 KB Output is correct
2 Correct 78 ms 15412 KB Output is correct
3 Correct 71 ms 15412 KB Output is correct
4 Correct 73 ms 15476 KB Output is correct
5 Correct 77 ms 15476 KB Output is correct
6 Correct 72 ms 15536 KB Output is correct
7 Correct 72 ms 15536 KB Output is correct
8 Correct 70 ms 15536 KB Output is correct
9 Correct 77 ms 15536 KB Output is correct
10 Correct 80 ms 15536 KB Output is correct
11 Correct 1168 ms 31152 KB Output is correct
12 Correct 1212 ms 31152 KB Output is correct
13 Correct 1185 ms 31152 KB Output is correct
14 Correct 1276 ms 31152 KB Output is correct
15 Correct 1119 ms 31248 KB Output is correct
16 Correct 1222 ms 31248 KB Output is correct
17 Correct 1270 ms 31248 KB Output is correct
18 Correct 1096 ms 32168 KB Output is correct
19 Correct 1056 ms 32168 KB Output is correct
20 Correct 1234 ms 32168 KB Output is correct
21 Incorrect 1427 ms 32168 KB Output isn't correct
22 Halted 0 ms 0 KB -