oj.uz

Submission #330184

# Submission time Handle Problem Language Result Execution time Memory
330184 2020-11-24T06:11:03 Z Kevin_Zhang_TW Snake Escaping (JOI18_snake_escaping) C++17
12 / 100
 2000 ms 5612 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T>
bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
template<class T> 
bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U>
void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T>
void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 20;
int n, q;
char w[(1<<MAX_N) + 10], com[MAX_N << 1];
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> q >> w;
	for (int i = 0;i < q;++i) {
		cin >> com;
		int l = 0, r = (1<<n) - 1, sub = 0;
		reverse(com, com + n);
		for (int i = 0;i < n;++i) {
			if (com[i] == '0') r ^= 1<<i;
			if (com[i] == '1') l ^= 1<<i;
			if (com[i] == '?') sub |= 1<<i;
		} 
		int res = 0;
		for (int s = sub ; s ;(--s) &= sub) {
			res += w[l | s] - '0';
		}
		res += w[l] - '0';
		cout << res << '\n'; 
		DE(com, res);
	}
}

Compilation message

snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:18:17: warning: statement has no effect [-Wunused-value]
   18 | #define DE(...) 0
      |                 ^
snake_escaping.cpp:43:3: note: in expansion of macro 'DE'
   43 |   DE(com, res);
      |   ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 269 ms 4428 KB Output is correct
12 Correct 277 ms 4060 KB Output is correct
13 Correct 227 ms 3436 KB Output is correct
14 Correct 225 ms 3436 KB Output is correct
15 Correct 304 ms 4332 KB Output is correct
16 Correct 251 ms 3680 KB Output is correct
17 Correct 254 ms 3564 KB Output is correct
18 Correct 1374 ms 5612 KB Output is correct
19 Correct 229 ms 2412 KB Output is correct
20 Correct 320 ms 4332 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 269 ms 4428 KB Output is correct
12 Correct 277 ms 4060 KB Output is correct
13 Correct 227 ms 3436 KB Output is correct
14 Correct 225 ms 3436 KB Output is correct
15 Correct 304 ms 4332 KB Output is correct
16 Correct 251 ms 3680 KB Output is correct
17 Correct 254 ms 3564 KB Output is correct
18 Correct 1374 ms 5612 KB Output is correct
19 Correct 229 ms 2412 KB Output is correct
20 Correct 320 ms 4332 KB Output is correct
21 Correct 420 ms 4460 KB Output is correct
22 Correct 443 ms 4716 KB Output is correct
23 Correct 273 ms 3692 KB Output is correct
24 Correct 260 ms 3564 KB Output is correct
25 Correct 535 ms 5484 KB Output is correct
26 Correct 312 ms 4076 KB Output is correct
27 Correct 318 ms 4076 KB Output is correct
28 Execution timed out 2081 ms 2524 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 89 ms 2412 KB Output is correct
12 Correct 220 ms 2284 KB Output is correct
13 Correct 24 ms 2156 KB Output is correct
14 Correct 28 ms 2156 KB Output is correct
15 Correct 532 ms 2412 KB Output is correct
16 Correct 41 ms 2156 KB Output is correct
17 Correct 41 ms 2156 KB Output is correct
18 Execution timed out 2086 ms 2064 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 269 ms 4428 KB Output is correct
12 Correct 277 ms 4060 KB Output is correct
13 Correct 227 ms 3436 KB Output is correct
14 Correct 225 ms 3436 KB Output is correct
15 Correct 304 ms 4332 KB Output is correct
16 Correct 251 ms 3680 KB Output is correct
17 Correct 254 ms 3564 KB Output is correct
18 Correct 1374 ms 5612 KB Output is correct
19 Correct 229 ms 2412 KB Output is correct
20 Correct 320 ms 4332 KB Output is correct
21 Correct 420 ms 4460 KB Output is correct
22 Correct 443 ms 4716 KB Output is correct
23 Correct 273 ms 3692 KB Output is correct
24 Correct 260 ms 3564 KB Output is correct
25 Correct 535 ms 5484 KB Output is correct
26 Correct 312 ms 4076 KB Output is correct
27 Correct 318 ms 4076 KB Output is correct
28 Execution timed out 2081 ms 2524 KB Time limit exceeded
29 Halted 0 ms 0 KB -