oj.uz

Submission #66948

# Submission time Handle Problem Language Result Execution time Memory
66948 2018-08-12T20:24:41 Z ekrem Snake Escaping (JOI18_snake_escaping) C++
12 / 100
 1368 ms 44152 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[2000002];
void hesapla(int);

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;
	}

	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';
		}
		for(int say = 1; say <= 13; say++){
			son += crp*(bit%3);
			crp *= 3;
			bit/=3;
		}
		q[i] = mp(bit, son);
	}

	for(int i = 0; i < 2187; i++)
		for(int j = 0; j < (1<<7); j++){
			if(i == 0 and j == 0)
				kaps[i][j] = 1;
			else 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;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:43:16: warning: unused variable 'say' [-Wunused-variable]
   int bit = 0, say = 0, son = 0, crp = 1;
                ^~~
snake_escaping.cpp:36: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:39:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&c);
   ~~~~~^~~~~~~~~~
snake_escaping.cpp:45: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 58 ms 8952 KB Output is correct
2 Correct 64 ms 9064 KB Output is correct
3 Correct 70 ms 9128 KB Output is correct
4 Correct 68 ms 9224 KB Output is correct
5 Correct 66 ms 9224 KB Output is correct
6 Correct 65 ms 9224 KB Output is correct
7 Correct 57 ms 9224 KB Output is correct
8 Correct 62 ms 9224 KB Output is correct
9 Correct 64 ms 9304 KB Output is correct
10 Correct 79 ms 9364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8952 KB Output is correct
2 Correct 64 ms 9064 KB Output is correct
3 Correct 70 ms 9128 KB Output is correct
4 Correct 68 ms 9224 KB Output is correct
5 Correct 66 ms 9224 KB Output is correct
6 Correct 65 ms 9224 KB Output is correct
7 Correct 57 ms 9224 KB Output is correct
8 Correct 62 ms 9224 KB Output is correct
9 Correct 64 ms 9304 KB Output is correct
10 Correct 79 ms 9364 KB Output is correct
11 Correct 1109 ms 32188 KB Output is correct
12 Correct 1101 ms 32188 KB Output is correct
13 Correct 949 ms 32188 KB Output is correct
14 Correct 1022 ms 32188 KB Output is correct
15 Correct 992 ms 43136 KB Output is correct
16 Correct 1026 ms 43136 KB Output is correct
17 Correct 1028 ms 43136 KB Output is correct
18 Correct 913 ms 44152 KB Output is correct
19 Correct 909 ms 44152 KB Output is correct
20 Correct 1022 ms 44152 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8952 KB Output is correct
2 Correct 64 ms 9064 KB Output is correct
3 Correct 70 ms 9128 KB Output is correct
4 Correct 68 ms 9224 KB Output is correct
5 Correct 66 ms 9224 KB Output is correct
6 Correct 65 ms 9224 KB Output is correct
7 Correct 57 ms 9224 KB Output is correct
8 Correct 62 ms 9224 KB Output is correct
9 Correct 64 ms 9304 KB Output is correct
10 Correct 79 ms 9364 KB Output is correct
11 Correct 1109 ms 32188 KB Output is correct
12 Correct 1101 ms 32188 KB Output is correct
13 Correct 949 ms 32188 KB Output is correct
14 Correct 1022 ms 32188 KB Output is correct
15 Correct 992 ms 43136 KB Output is correct
16 Correct 1026 ms 43136 KB Output is correct
17 Correct 1028 ms 43136 KB Output is correct
18 Correct 913 ms 44152 KB Output is correct
19 Correct 909 ms 44152 KB Output is correct
20 Correct 1022 ms 44152 KB Output is correct
21 Incorrect 1368 ms 44152 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8952 KB Output is correct
2 Correct 64 ms 9064 KB Output is correct
3 Correct 70 ms 9128 KB Output is correct
4 Correct 68 ms 9224 KB Output is correct
5 Correct 66 ms 9224 KB Output is correct
6 Correct 65 ms 9224 KB Output is correct
7 Correct 57 ms 9224 KB Output is correct
8 Correct 62 ms 9224 KB Output is correct
9 Correct 64 ms 9304 KB Output is correct
10 Correct 79 ms 9364 KB Output is correct
11 Incorrect 213 ms 44152 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8952 KB Output is correct
2 Correct 64 ms 9064 KB Output is correct
3 Correct 70 ms 9128 KB Output is correct
4 Correct 68 ms 9224 KB Output is correct
5 Correct 66 ms 9224 KB Output is correct
6 Correct 65 ms 9224 KB Output is correct
7 Correct 57 ms 9224 KB Output is correct
8 Correct 62 ms 9224 KB Output is correct
9 Correct 64 ms 9304 KB Output is correct
10 Correct 79 ms 9364 KB Output is correct
11 Correct 1109 ms 32188 KB Output is correct
12 Correct 1101 ms 32188 KB Output is correct
13 Correct 949 ms 32188 KB Output is correct
14 Correct 1022 ms 32188 KB Output is correct
15 Correct 992 ms 43136 KB Output is correct
16 Correct 1026 ms 43136 KB Output is correct
17 Correct 1028 ms 43136 KB Output is correct
18 Correct 913 ms 44152 KB Output is correct
19 Correct 909 ms 44152 KB Output is correct
20 Correct 1022 ms 44152 KB Output is correct
21 Incorrect 1368 ms 44152 KB Output isn't correct
22 Halted 0 ms 0 KB -