oj.uz

Submission #45515

# Submission time Handle Problem Language Result Execution time Memory
45515 2018-04-14T22:56:41 Z reality Snake Escaping (JOI18_snake_escaping) C++17
58 / 100
 2000 ms 60468 KB 
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int D0[1 << 20];
int D1[1 << 20];
char str[1 << 20];
int coef[1 << 20];
int main(void)
{
    int n,q;
    cin>>n>>q>>str;
    const int N = 1 << n;
    for (int i = 0;i < N;++i)
    	str[i] -= '0';
    for (int i = 0;i < N;++i)
    	coef[i] = __builtin_popcount(i) & 1 ? -1 : 1;
    for (int i = 0;i < N;++i)
    	D0[i] = D1[i] = str[i];
    for (int i = 0;i < n;++i)
    	for (int mask = 0;mask < N;++mask)
    		if ((mask >> i) & 1)
    			D0[mask ^ (1 << i)] += D0[mask];
    		else
    			D1[mask ^ (1 << i)] += D1[mask];
   	while (q --) {
    	string s;
    	cin>>s;
    	reverse(all(s));
    	int a = 0,b = 0,c = 0;
    	int la = 0,lb = 0,lc = 0;
    	for (int i = 0;i < n;++i) {
    		if (s[i] == '0')
    			a |= 1 << i,++la;
    		else
    		if (s[i] == '1')
    			b |= 1 << i,++lb;
    		else
    			c |= 1 << i,++lc;
    	}
    	int ans = 0;
    	if (la <= lb && la <= lc && 0) {
    		for (int mask = a;mask >= 0;mask = !mask ? -1 : ((mask - 1) & a))
    			ans += coef[mask] * D0[(N - 1) ^ mask ^ c];
    	} else
    	if (lb <= la && lb <= lc) {
    		for (int mask = b;mask >= 0;mask = !mask ? -1 : ((mask - 1) & b))
    			ans += coef[mask] * D1[mask ^ c];
    	} else {
    		for (int mask = c;mask >= 0;mask = !mask ? -1 : ((mask - 1) & c))
    			ans += str[mask ^ b];
    	}
    	ans = abs(ans);
    	cout << ans << '\n';
    }
    return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:31:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0;i < n;++i)
     ^~~
snake_escaping.cpp:37:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     while (q --) {
     ^~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 564 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 612 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 564 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Execution timed out 2076 ms 4384 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 564 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Execution timed out 2076 ms 4384 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 564 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Correct 304 ms 14256 KB Output is correct
12 Correct 218 ms 14256 KB Output is correct
13 Correct 227 ms 14256 KB Output is correct
14 Correct 259 ms 14256 KB Output is correct
15 Correct 540 ms 14360 KB Output is correct
16 Correct 239 ms 14360 KB Output is correct
17 Correct 242 ms 14360 KB Output is correct
18 Correct 203 ms 15276 KB Output is correct
19 Correct 219 ms 16848 KB Output is correct
20 Correct 504 ms 19308 KB Output is correct
21 Correct 265 ms 21208 KB Output is correct
22 Correct 231 ms 23388 KB Output is correct
23 Correct 216 ms 25344 KB Output is correct
24 Correct 237 ms 27452 KB Output is correct
25 Correct 250 ms 29464 KB Output is correct
26 Correct 217 ms 31388 KB Output is correct
27 Correct 223 ms 33660 KB Output is correct
28 Correct 217 ms 35524 KB Output is correct
29 Correct 227 ms 37764 KB Output is correct
30 Correct 228 ms 39772 KB Output is correct
31 Correct 218 ms 41800 KB Output is correct
32 Correct 270 ms 43852 KB Output is correct
33 Correct 256 ms 45928 KB Output is correct
34 Correct 205 ms 47812 KB Output is correct
35 Correct 257 ms 50012 KB Output is correct
36 Correct 255 ms 51988 KB Output is correct
37 Correct 274 ms 54200 KB Output is correct
38 Correct 254 ms 56084 KB Output is correct
39 Correct 256 ms 58172 KB Output is correct
40 Correct 255 ms 60468 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 564 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Execution timed out 2076 ms 4384 KB Time limit exceeded
12 Halted 0 ms 0 KB -