oj.uz

Submission #66789

# Submission time Handle Problem Language Result Execution time Memory
66789 2018-08-12T10:13:29 Z hamzqq9 Snake Escaping (JOI18_snake_escaping) C++14
5 / 100
 755 ms 66560 KB 
#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 LOG 22
using namespace std;

unsigned short int ans[pw(13)][2190];
int val[pw(20)+3];
int po3[12];
int l,q,n;
int res,value;
char s[pw(20)+3];

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) {

	if(bit==-1) {

		res+=ans[val][value];

		return ;

	}

	if(s[bit]!='?') back_track(bit-1,val+pw(12-bit)*(s[bit]=='1'));
	else {

		back_track(bit-1,val+pw(12-bit));
		back_track(bit-1,val);

	}

} 

void pre_calc() {

	for(int i=0;i<2187;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(13);j++) {

			if(pos==-1) {

				ans[j][i]=val[temp+pw(7)*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(13,19);

		back_track(12,0);

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

	}

}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:136: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:144:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:156: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

# Verdict Execution time Memory Grader output
1 Correct 289 ms 35448 KB Output is correct
2 Correct 274 ms 35456 KB Output is correct
3 Correct 287 ms 35648 KB Output is correct
4 Correct 297 ms 35716 KB Output is correct
5 Correct 286 ms 35716 KB Output is correct
6 Correct 322 ms 35808 KB Output is correct
7 Correct 297 ms 35864 KB Output is correct
8 Correct 311 ms 35892 KB Output is correct
9 Correct 309 ms 35920 KB Output is correct
10 Correct 301 ms 35920 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 35448 KB Output is correct
2 Correct 274 ms 35456 KB Output is correct
3 Correct 287 ms 35648 KB Output is correct
4 Correct 297 ms 35716 KB Output is correct
5 Correct 286 ms 35716 KB Output is correct
6 Correct 322 ms 35808 KB Output is correct
7 Correct 297 ms 35864 KB Output is correct
8 Correct 311 ms 35892 KB Output is correct
9 Correct 309 ms 35920 KB Output is correct
10 Correct 301 ms 35920 KB Output is correct
11 Correct 725 ms 50664 KB Output is correct
12 Correct 755 ms 61040 KB Output is correct
13 Runtime error 643 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.
14 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 35448 KB Output is correct
2 Correct 274 ms 35456 KB Output is correct
3 Correct 287 ms 35648 KB Output is correct
4 Correct 297 ms 35716 KB Output is correct
5 Correct 286 ms 35716 KB Output is correct
6 Correct 322 ms 35808 KB Output is correct
7 Correct 297 ms 35864 KB Output is correct
8 Correct 311 ms 35892 KB Output is correct
9 Correct 309 ms 35920 KB Output is correct
10 Correct 301 ms 35920 KB Output is correct
11 Correct 725 ms 50664 KB Output is correct
12 Correct 755 ms 61040 KB Output is correct
13 Runtime error 643 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.
14 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 35448 KB Output is correct
2 Correct 274 ms 35456 KB Output is correct
3 Correct 287 ms 35648 KB Output is correct
4 Correct 297 ms 35716 KB Output is correct
5 Correct 286 ms 35716 KB Output is correct
6 Correct 322 ms 35808 KB Output is correct
7 Correct 297 ms 35864 KB Output is correct
8 Correct 311 ms 35892 KB Output is correct
9 Correct 309 ms 35920 KB Output is correct
10 Correct 301 ms 35920 KB Output is correct
11 Runtime error 492 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

# Verdict Execution time Memory Grader output
1 Correct 289 ms 35448 KB Output is correct
2 Correct 274 ms 35456 KB Output is correct
3 Correct 287 ms 35648 KB Output is correct
4 Correct 297 ms 35716 KB Output is correct
5 Correct 286 ms 35716 KB Output is correct
6 Correct 322 ms 35808 KB Output is correct
7 Correct 297 ms 35864 KB Output is correct
8 Correct 311 ms 35892 KB Output is correct
9 Correct 309 ms 35920 KB Output is correct
10 Correct 301 ms 35920 KB Output is correct
11 Correct 725 ms 50664 KB Output is correct
12 Correct 755 ms 61040 KB Output is correct
13 Runtime error 643 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.
14 Halted 0 ms 0 KB -