답안 #66796 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66796	2018-08-12T10:22:36 Z	hamzqq9	Snake Escaping (JOI18_snake_escaping)	C++14	12 / 100	1181 ms	66560 KB

snake_escaping

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 100000000000000
#define MOD 1000000007
#define N 100005
#define MAX 10000006
#define L 14
#define R 6
#define LOG 22
using namespace std;

unsigned short int ans[pw(L)][730];
int val[pw(20)+3];
int po3[12];
int l,q,n;
int res,value;
char s[pw(20)+3];
int sz;
ii stck[pw(L)+5];

int get_pos_of_2(int value) {

	int cur=0;

	while(value) {

		if(value%3==2) return cur;

		value/=3;

		cur++;

	}

	return -1;

}

int get_val(int bas,int son) {

	int cur=0;

	for(int i=bas;i<=son;i++) {

		cur+=po3[son-i]*(s[i]=='?'?2:(s[i]-'0'));

	}

	return cur;

}

int get_2_rep(int val) {

	int res=0;

	int curpw=1;

	while(val) {

		res+=curpw*(val%3);

		curpw*=2;

		val/=3;

	}

	return res;

}

void back_track(int bit,int val) {

	stck[sz++]={bit,val};

	while(sz) {

		sz--;

		int bit=stck[sz].st;
		int val=stck[sz].nd;

		if(bit==-1) {

			res+=ans[val][value];

			continue ;

		}

		if(s[bit]!='?') {
		
			stck[sz++]={bit-1,val+pw(L-1-bit)*(s[bit]=='1')};
		}
		else {

			stck[sz++]={bit-1,val+pw(L-1-bit)};
			stck[sz++]={bit-1,val};

		}

	}

} 

void pre_calc() {

	for(int i=0;i<po3[R];i++) {

		int pos=get_pos_of_2(i);

		int temp=-1;

		if(pos==-1) temp=get_2_rep(i);

		for(int j=0;j<pw(L);j++) {

			if(pos==-1) {

				ans[j][i]=val[temp+pw(R)*j];

			}
			else {

				ans[j][i]=ans[j][i-po3[pos]]+ans[j][i-po3[pos]*2];

			}

		}

	}

}

int main() {

//	freopen("input.txt","r",stdin);

	scanf("%d %d",&l,&q);

	po3[0]=1;

	for(int i=1;i<=10;i++) po3[i]=po3[i-1]*3;

	n=pw(l);

	scanf("%s",s);

	for(int i=0;i<n;i++) {

		val[i]=s[i]-'0';

	}

	pre_calc();

	while(q--) {

		scanf("%s",s+20-l);

		for(int i=0;i<20-l;i++) s[i]='0';

		res=0;

		value=get_val(L,19);

		back_track(L-1,0);

		printf("%d\n",res);

	}

}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:154:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&l,&q);
  ~~~~~^~~~~~~~~~~~~~~
snake_escaping.cpp:162:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:174:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",s+20-l);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	167 ms	23672 KB	Output is correct
2	Correct	138 ms	23780 KB	Output is correct
3	Correct	173 ms	23912 KB	Output is correct
4	Correct	158 ms	23916 KB	Output is correct
5	Correct	171 ms	23924 KB	Output is correct
6	Correct	147 ms	24064 KB	Output is correct
7	Correct	142 ms	24076 KB	Output is correct
8	Correct	145 ms	24120 KB	Output is correct
9	Correct	135 ms	24132 KB	Output is correct
10	Correct	135 ms	24392 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	167 ms	23672 KB	Output is correct
2	Correct	138 ms	23780 KB	Output is correct
3	Correct	173 ms	23912 KB	Output is correct
4	Correct	158 ms	23916 KB	Output is correct
5	Correct	171 ms	23924 KB	Output is correct
6	Correct	147 ms	24064 KB	Output is correct
7	Correct	142 ms	24076 KB	Output is correct
8	Correct	145 ms	24120 KB	Output is correct
9	Correct	135 ms	24132 KB	Output is correct
10	Correct	135 ms	24392 KB	Output is correct
11	Correct	632 ms	28260 KB	Output is correct
12	Correct	679 ms	28260 KB	Output is correct
13	Correct	625 ms	28260 KB	Output is correct
14	Correct	575 ms	31624 KB	Output is correct
15	Correct	682 ms	32504 KB	Output is correct
16	Correct	537 ms	32504 KB	Output is correct
17	Correct	522 ms	32504 KB	Output is correct
18	Correct	1062 ms	33424 KB	Output is correct
19	Correct	469 ms	33424 KB	Output is correct
20	Correct	703 ms	33424 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	167 ms	23672 KB	Output is correct
2	Correct	138 ms	23780 KB	Output is correct
3	Correct	173 ms	23912 KB	Output is correct
4	Correct	158 ms	23916 KB	Output is correct
5	Correct	171 ms	23924 KB	Output is correct
6	Correct	147 ms	24064 KB	Output is correct
7	Correct	142 ms	24076 KB	Output is correct
8	Correct	145 ms	24120 KB	Output is correct
9	Correct	135 ms	24132 KB	Output is correct
10	Correct	135 ms	24392 KB	Output is correct
11	Correct	632 ms	28260 KB	Output is correct
12	Correct	679 ms	28260 KB	Output is correct
13	Correct	625 ms	28260 KB	Output is correct
14	Correct	575 ms	31624 KB	Output is correct
15	Correct	682 ms	32504 KB	Output is correct
16	Correct	537 ms	32504 KB	Output is correct
17	Correct	522 ms	32504 KB	Output is correct
18	Correct	1062 ms	33424 KB	Output is correct
19	Correct	469 ms	33424 KB	Output is correct
20	Correct	703 ms	33424 KB	Output is correct
21	Correct	1181 ms	33424 KB	Output is correct
22	Correct	1144 ms	46644 KB	Output is correct
23	Correct	696 ms	59160 KB	Output is correct
24	Runtime error	685 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.
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	167 ms	23672 KB	Output is correct
2	Correct	138 ms	23780 KB	Output is correct
3	Correct	173 ms	23912 KB	Output is correct
4	Correct	158 ms	23916 KB	Output is correct
5	Correct	171 ms	23924 KB	Output is correct
6	Correct	147 ms	24064 KB	Output is correct
7	Correct	142 ms	24076 KB	Output is correct
8	Correct	145 ms	24120 KB	Output is correct
9	Correct	135 ms	24132 KB	Output is correct
10	Correct	135 ms	24392 KB	Output is correct
11	Runtime error	460 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	167 ms	23672 KB	Output is correct
2	Correct	138 ms	23780 KB	Output is correct
3	Correct	173 ms	23912 KB	Output is correct
4	Correct	158 ms	23916 KB	Output is correct
5	Correct	171 ms	23924 KB	Output is correct
6	Correct	147 ms	24064 KB	Output is correct
7	Correct	142 ms	24076 KB	Output is correct
8	Correct	145 ms	24120 KB	Output is correct
9	Correct	135 ms	24132 KB	Output is correct
10	Correct	135 ms	24392 KB	Output is correct
11	Correct	632 ms	28260 KB	Output is correct
12	Correct	679 ms	28260 KB	Output is correct
13	Correct	625 ms	28260 KB	Output is correct
14	Correct	575 ms	31624 KB	Output is correct
15	Correct	682 ms	32504 KB	Output is correct
16	Correct	537 ms	32504 KB	Output is correct
17	Correct	522 ms	32504 KB	Output is correct
18	Correct	1062 ms	33424 KB	Output is correct
19	Correct	469 ms	33424 KB	Output is correct
20	Correct	703 ms	33424 KB	Output is correct
21	Correct	1181 ms	33424 KB	Output is correct
22	Correct	1144 ms	46644 KB	Output is correct
23	Correct	696 ms	59160 KB	Output is correct
24	Runtime error	685 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.
25	Halted	0 ms	0 KB	-

답안 #66796

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0