답안 #45519 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45519	2018-04-14T23:00:00 Z	reality	Snake Escaping (JOI18_snake_escaping)	C++17	100 / 100	1159 ms	65536 KB

snake_escaping

#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];
inline int readChar();
template <class T = int> inline T readInt();
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x );
inline void writeWord( const char *s );

/** Read */

static const int buf_size = 4096;

inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}

inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}

template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}

/** Write */

static int write_pos = 0;
static char write_buf[buf_size];

inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}

template <class T>
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;

    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}

inline void writeWord( const char *s ) {
    while (*s)
        writeChar(*s++);
}

struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
char s[64];
int main(void)
{
    int n,q;
    scanf("%d%d%s",&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 --) {
    	scanf("%s",s);
    	reverse(s,s + n);
    	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) {
    		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:107:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0;i < n;++i)
     ^~~
snake_escaping.cpp:113:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     while (q --) {
     ^~~~~
snake_escaping.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%s",&n,&q,str);
     ~~~~~^~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:114:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%s",s);
      ~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	3 ms	644 KB	Output is correct
5	Correct	2 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	2 ms	644 KB	Output is correct
8	Correct	2 ms	644 KB	Output is correct
9	Correct	2 ms	644 KB	Output is correct
10	Correct	2 ms	644 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	3 ms	644 KB	Output is correct
5	Correct	2 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	2 ms	644 KB	Output is correct
8	Correct	2 ms	644 KB	Output is correct
9	Correct	2 ms	644 KB	Output is correct
10	Correct	2 ms	644 KB	Output is correct
11	Correct	410 ms	4796 KB	Output is correct
12	Correct	550 ms	15140 KB	Output is correct
13	Correct	361 ms	25260 KB	Output is correct
14	Correct	436 ms	36036 KB	Output is correct
15	Correct	316 ms	47836 KB	Output is correct
16	Correct	356 ms	57800 KB	Output is correct
17	Correct	332 ms	65536 KB	Output is correct
18	Correct	251 ms	65536 KB	Output is correct
19	Correct	282 ms	65536 KB	Output is correct
20	Correct	327 ms	65536 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	3 ms	644 KB	Output is correct
5	Correct	2 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	2 ms	644 KB	Output is correct
8	Correct	2 ms	644 KB	Output is correct
9	Correct	2 ms	644 KB	Output is correct
10	Correct	2 ms	644 KB	Output is correct
11	Correct	410 ms	4796 KB	Output is correct
12	Correct	550 ms	15140 KB	Output is correct
13	Correct	361 ms	25260 KB	Output is correct
14	Correct	436 ms	36036 KB	Output is correct
15	Correct	316 ms	47836 KB	Output is correct
16	Correct	356 ms	57800 KB	Output is correct
17	Correct	332 ms	65536 KB	Output is correct
18	Correct	251 ms	65536 KB	Output is correct
19	Correct	282 ms	65536 KB	Output is correct
20	Correct	327 ms	65536 KB	Output is correct
21	Correct	377 ms	65536 KB	Output is correct
22	Correct	410 ms	65536 KB	Output is correct
23	Correct	409 ms	65536 KB	Output is correct
24	Correct	518 ms	65536 KB	Output is correct
25	Correct	359 ms	65536 KB	Output is correct
26	Correct	452 ms	65536 KB	Output is correct
27	Correct	441 ms	65536 KB	Output is correct
28	Correct	328 ms	65536 KB	Output is correct
29	Correct	373 ms	65536 KB	Output is correct
30	Correct	370 ms	65536 KB	Output is correct
31	Correct	392 ms	65536 KB	Output is correct
32	Correct	406 ms	65536 KB	Output is correct
33	Correct	373 ms	65536 KB	Output is correct
34	Correct	408 ms	65536 KB	Output is correct
35	Correct	419 ms	65536 KB	Output is correct
36	Correct	311 ms	65536 KB	Output is correct
37	Correct	382 ms	65536 KB	Output is correct
38	Correct	351 ms	65536 KB	Output is correct
39	Correct	400 ms	65536 KB	Output is correct
40	Correct	413 ms	65536 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	3 ms	644 KB	Output is correct
5	Correct	2 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	2 ms	644 KB	Output is correct
8	Correct	2 ms	644 KB	Output is correct
9	Correct	2 ms	644 KB	Output is correct
10	Correct	2 ms	644 KB	Output is correct
11	Correct	79 ms	65536 KB	Output is correct
12	Correct	76 ms	65536 KB	Output is correct
13	Correct	81 ms	65536 KB	Output is correct
14	Correct	93 ms	65536 KB	Output is correct
15	Correct	80 ms	65536 KB	Output is correct
16	Correct	93 ms	65536 KB	Output is correct
17	Correct	95 ms	65536 KB	Output is correct
18	Correct	65 ms	65536 KB	Output is correct
19	Correct	73 ms	65536 KB	Output is correct
20	Correct	77 ms	65536 KB	Output is correct
21	Correct	81 ms	65536 KB	Output is correct
22	Correct	92 ms	65536 KB	Output is correct
23	Correct	74 ms	65536 KB	Output is correct
24	Correct	91 ms	65536 KB	Output is correct
25	Correct	88 ms	65536 KB	Output is correct
26	Correct	73 ms	65536 KB	Output is correct
27	Correct	90 ms	65536 KB	Output is correct
28	Correct	71 ms	65536 KB	Output is correct
29	Correct	79 ms	65536 KB	Output is correct
30	Correct	80 ms	65536 KB	Output is correct
31	Correct	73 ms	65536 KB	Output is correct
32	Correct	96 ms	65536 KB	Output is correct
33	Correct	90 ms	65536 KB	Output is correct
34	Correct	66 ms	65536 KB	Output is correct
35	Correct	115 ms	65536 KB	Output is correct
36	Correct	95 ms	65536 KB	Output is correct
37	Correct	82 ms	65536 KB	Output is correct
38	Correct	90 ms	65536 KB	Output is correct
39	Correct	85 ms	65536 KB	Output is correct
40	Correct	85 ms	65536 KB	Output is correct

Subtask #5
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	3 ms	644 KB	Output is correct
5	Correct	2 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	2 ms	644 KB	Output is correct
8	Correct	2 ms	644 KB	Output is correct
9	Correct	2 ms	644 KB	Output is correct
10	Correct	2 ms	644 KB	Output is correct
11	Correct	410 ms	4796 KB	Output is correct
12	Correct	550 ms	15140 KB	Output is correct
13	Correct	361 ms	25260 KB	Output is correct
14	Correct	436 ms	36036 KB	Output is correct
15	Correct	316 ms	47836 KB	Output is correct
16	Correct	356 ms	57800 KB	Output is correct
17	Correct	332 ms	65536 KB	Output is correct
18	Correct	251 ms	65536 KB	Output is correct
19	Correct	282 ms	65536 KB	Output is correct
20	Correct	327 ms	65536 KB	Output is correct
21	Correct	377 ms	65536 KB	Output is correct
22	Correct	410 ms	65536 KB	Output is correct
23	Correct	409 ms	65536 KB	Output is correct
24	Correct	518 ms	65536 KB	Output is correct
25	Correct	359 ms	65536 KB	Output is correct
26	Correct	452 ms	65536 KB	Output is correct
27	Correct	441 ms	65536 KB	Output is correct
28	Correct	328 ms	65536 KB	Output is correct
29	Correct	373 ms	65536 KB	Output is correct
30	Correct	370 ms	65536 KB	Output is correct
31	Correct	392 ms	65536 KB	Output is correct
32	Correct	406 ms	65536 KB	Output is correct
33	Correct	373 ms	65536 KB	Output is correct
34	Correct	408 ms	65536 KB	Output is correct
35	Correct	419 ms	65536 KB	Output is correct
36	Correct	311 ms	65536 KB	Output is correct
37	Correct	382 ms	65536 KB	Output is correct
38	Correct	351 ms	65536 KB	Output is correct
39	Correct	400 ms	65536 KB	Output is correct
40	Correct	413 ms	65536 KB	Output is correct
41	Correct	79 ms	65536 KB	Output is correct
42	Correct	76 ms	65536 KB	Output is correct
43	Correct	81 ms	65536 KB	Output is correct
44	Correct	93 ms	65536 KB	Output is correct
45	Correct	80 ms	65536 KB	Output is correct
46	Correct	93 ms	65536 KB	Output is correct
47	Correct	95 ms	65536 KB	Output is correct
48	Correct	65 ms	65536 KB	Output is correct
49	Correct	73 ms	65536 KB	Output is correct
50	Correct	77 ms	65536 KB	Output is correct
51	Correct	81 ms	65536 KB	Output is correct
52	Correct	92 ms	65536 KB	Output is correct
53	Correct	74 ms	65536 KB	Output is correct
54	Correct	91 ms	65536 KB	Output is correct
55	Correct	88 ms	65536 KB	Output is correct
56	Correct	73 ms	65536 KB	Output is correct
57	Correct	90 ms	65536 KB	Output is correct
58	Correct	71 ms	65536 KB	Output is correct
59	Correct	79 ms	65536 KB	Output is correct
60	Correct	80 ms	65536 KB	Output is correct
61	Correct	73 ms	65536 KB	Output is correct
62	Correct	96 ms	65536 KB	Output is correct
63	Correct	90 ms	65536 KB	Output is correct
64	Correct	66 ms	65536 KB	Output is correct
65	Correct	115 ms	65536 KB	Output is correct
66	Correct	95 ms	65536 KB	Output is correct
67	Correct	82 ms	65536 KB	Output is correct
68	Correct	90 ms	65536 KB	Output is correct
69	Correct	85 ms	65536 KB	Output is correct
70	Correct	85 ms	65536 KB	Output is correct
71	Correct	608 ms	65536 KB	Output is correct
72	Correct	636 ms	65536 KB	Output is correct
73	Correct	701 ms	65536 KB	Output is correct
74	Correct	854 ms	65536 KB	Output is correct
75	Correct	573 ms	65536 KB	Output is correct
76	Correct	997 ms	65536 KB	Output is correct
77	Correct	873 ms	65536 KB	Output is correct
78	Correct	393 ms	65536 KB	Output is correct
79	Correct	508 ms	65536 KB	Output is correct
80	Correct	621 ms	65536 KB	Output is correct
81	Correct	673 ms	65536 KB	Output is correct
82	Correct	833 ms	65536 KB	Output is correct
83	Correct	554 ms	65536 KB	Output is correct
84	Correct	931 ms	65536 KB	Output is correct
85	Correct	898 ms	65536 KB	Output is correct
86	Correct	375 ms	65536 KB	Output is correct
87	Correct	552 ms	65536 KB	Output is correct
88	Correct	537 ms	65536 KB	Output is correct
89	Correct	643 ms	65536 KB	Output is correct
90	Correct	643 ms	65536 KB	Output is correct
91	Correct	565 ms	65536 KB	Output is correct
92	Correct	1159 ms	65536 KB	Output is correct
93	Correct	898 ms	65536 KB	Output is correct
94	Correct	362 ms	65536 KB	Output is correct
95	Correct	767 ms	65536 KB	Output is correct
96	Correct	747 ms	65536 KB	Output is correct
97	Correct	767 ms	65536 KB	Output is correct
98	Correct	791 ms	65536 KB	Output is correct
99	Correct	821 ms	65536 KB	Output is correct
100	Correct	839 ms	65536 KB	Output is correct

답안 #45519

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
25.0 / 25.0