oj.uz

답안 #68734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68734 2018-08-18T10:05:59 Z tmwilliamlin168 Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 330 ms 66560 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxL=20, mxQ=1e6;
int l, q, dp[2][1<<mxL];
string s;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> l >> q >> s;
	for(int j=0; j<2; ++j) {
		for(int i=0; i<1<<l; ++i)
			dp[j][i]=s[i]-'0';
		for(int k=0; k<l; ++k)
			for(int i=0; i<1<<l; ++i)
				if(i>>k&1^j)
					dp[j][i]+=dp[j][i^1<<k];
	}
	while(q--) {
		string t;
		cin >> t;
		int na=0, nb=0, nc=0, ma=0, mb=0, mc=0, ans=0;
		for(int i=0; i<l; ++i) {
			if(t[i]=='0') {
				++na;
				ma|=1<<(l-1-i);
			} else if(t[i]=='1') {
				++nb;
				mb|=1<<(l-1-i);
			} else {
				++nc;
				mc|=1<<(l-1-i);
			}
		}
		if(na<nc||nb<nc) {
			bool sw=0;
			if(nb>na) {
				swap(nb, na);
				swap(mb, ma);
				sw=1;
			}
			for(int i=mb; ; i=(i-1)&mb) {
//				cout << sw << " " << i << endl;
				ans+=dp[sw][(sw?(1<<l)-1:0)^i^mb^mc]*(__builtin_popcount(i)&1?-1:1);
				if(!i)
					break;
			}
		} else {
			for(int i=mc; ; i=(i-1)&mc) {
				ans+=s[i|mb]-'0';
				if(!i)
					break;
			}
		}
		cout << ans << "\n";
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:18:12: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
     if(i>>k&1^j)
        ~~~~^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 684 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 247 ms 15344 KB Output is correct
12 Correct 257 ms 17332 KB Output is correct
13 Correct 289 ms 17332 KB Output is correct
14 Correct 273 ms 17332 KB Output is correct
15 Correct 270 ms 18000 KB Output is correct
16 Correct 308 ms 18000 KB Output is correct
17 Correct 330 ms 28132 KB Output is correct
18 Correct 218 ms 40548 KB Output is correct
19 Correct 251 ms 48516 KB Output is correct
20 Correct 270 ms 60796 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 247 ms 15344 KB Output is correct
12 Correct 257 ms 17332 KB Output is correct
13 Correct 289 ms 17332 KB Output is correct
14 Correct 273 ms 17332 KB Output is correct
15 Correct 270 ms 18000 KB Output is correct
16 Correct 308 ms 18000 KB Output is correct
17 Correct 330 ms 28132 KB Output is correct
18 Correct 218 ms 40548 KB Output is correct
19 Correct 251 ms 48516 KB Output is correct
20 Correct 270 ms 60796 KB Output is correct
21 Runtime error 314 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Runtime error 134 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 247 ms 15344 KB Output is correct
12 Correct 257 ms 17332 KB Output is correct
13 Correct 289 ms 17332 KB Output is correct
14 Correct 273 ms 17332 KB Output is correct
15 Correct 270 ms 18000 KB Output is correct
16 Correct 308 ms 18000 KB Output is correct
17 Correct 330 ms 28132 KB Output is correct
18 Correct 218 ms 40548 KB Output is correct
19 Correct 251 ms 48516 KB Output is correct
20 Correct 270 ms 60796 KB Output is correct
21 Runtime error 314 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
22 Halted 0 ms 0 KB -