oj.uz

Submission #159657

# Submission time Handle Problem Language Result Execution time Memory
159657 2019-10-23T18:25:54 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
5 / 100
 2000 ms 5540 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

int n,q,C[1148576],M[20],dp[1794323],vs;
pair < int  , int > v[1794323];

main () { 
	ios::sync_with_stdio(false);
	cin>>n>>q;
	
	M[0]=1;
	for (int i=1; i<=n; i++) 
		M[i]=M[i-1]*3;
	
	for (int i=0; i<(1<<n); i++) {
		char c;
		cin>>c;
		C[i]=c-'0';
		
		int x=0;
		for (int j=0; j<n; j++) 
			if (i&(1<<j)) x+=M[j];
		dp[x]+=C[i];
	}
	
	for (int i=0; i<M[n]; i++) {
		int x=i,rs=0;
		for (int j=n-1; j>=0; j--) 
			if (x-2*M[j]>=0) x-=2*M[j],rs++; 
				else
			if (x-M[j]>=0) x-=M[j];
		
		v[++vs].F=rs;
		v[vs].S=i;
	}	
	
	sort(v+1,v+vs+1);
	
	for (int i=1; i<=vs; i++) {
		int x=v[i].S;	
		for (int j=n-1; j>=0; j--) {
			if (x-2*M[j]>=0) {
				x-=2*M[j];
				if (dp[v[i].S]<(dp[v[i].S-2*M[j]]+dp[v[i].S-M[j]])) 
					dp[v[i].S]=(dp[v[i].S-2*M[j]]+dp[v[i].S-M[j]]);	
			}
				else
			if (x-M[j]>=0) x-=M[j];
		}
	}
	
	for (int i=1; i<=q; i++) {
		string s;
		int x=0;
		cin>>s;	
				
		for (int j=0; j<s.size(); j++) {
			if (s[s.size()-j-1]=='?') x+=2*M[j];	
				else
			if (s[s.size()-j-1]=='1') x+=M[j];
		}
		
		cout<<dp[x]<<endl;
	}
}

Compilation message

snake_escaping.cpp:9:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () { 
       ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:59:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j=0; j<s.size(); j++) {
                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1020 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 12 ms 1016 KB Output is correct
4 Correct 12 ms 1016 KB Output is correct
5 Correct 13 ms 1016 KB Output is correct
6 Correct 13 ms 1144 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 13 ms 1016 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1020 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 12 ms 1016 KB Output is correct
4 Correct 12 ms 1016 KB Output is correct
5 Correct 13 ms 1016 KB Output is correct
6 Correct 13 ms 1144 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 13 ms 1016 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Execution timed out 2069 ms 5540 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1020 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 12 ms 1016 KB Output is correct
4 Correct 12 ms 1016 KB Output is correct
5 Correct 13 ms 1016 KB Output is correct
6 Correct 13 ms 1144 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 13 ms 1016 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Execution timed out 2069 ms 5540 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1020 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 12 ms 1016 KB Output is correct
4 Correct 12 ms 1016 KB Output is correct
5 Correct 13 ms 1016 KB Output is correct
6 Correct 13 ms 1144 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 13 ms 1016 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Runtime error 9 ms 2808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1020 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 12 ms 1016 KB Output is correct
4 Correct 12 ms 1016 KB Output is correct
5 Correct 13 ms 1016 KB Output is correct
6 Correct 13 ms 1144 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 13 ms 1016 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Execution timed out 2069 ms 5540 KB Time limit exceeded
12 Halted 0 ms 0 KB -