oj.uz

답안 #421586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421586 2021-06-09T09:42:26 Z Nicholas_Patrick 수열 (BOI14_sequence) C++17
25 / 100
 126 ms 716 KB 
#pragma GCC optimize("O3")
#include <cstdio>
#include <queue>
#include <random>
using namespace std;

int singleLookup[1024];
int single(int mask){
	long long ret=0, mult=1;
	if(mask==1)
		return 10;
	for(int i=10; --i;){
		if(mask>>i&1){
			ret+=mult*i;
			mult*=10;
		}
	}
	if(mask&1){
		mult/=10;
		ret+=ret/mult*mult*9;
	}
	return ret;
}
long long solve(vector<int>& masks, int depth=0, bool positive=true, bool ninezero=false){
	if(depth>=15)
		return 1;
	if(masks.size()==0)
		return positive;
	if(masks.size()==1){
		int ret=singleLookup[masks[0]];
		return ret?ret:positive;
	}
	long long ret=102345678888889;
	for(int fu=0; fu<10-ninezero; fu++){
		vector<int> newMasks((masks.size()-1+fu)/10+1, 0);
		bool reduced=false;
		for(int i=0; i<10; i++){
			int u=fu+i;
			bool additional=u>=10;
			if(additional)
				u-=10;
			for(int j=0; j*10+i<masks.size(); j++){
				int x=masks[j*10+i]&~(1<<u);
				if(x!=masks[j*10+i] and i==0)
					reduced=true;
				newMasks[j+additional]|=x;
			}
		}
		while(not newMasks.empty() and newMasks.back()==0)
			newMasks.pop_back();
		ret=min(ret, solve(newMasks, depth+1, fu==0 and reduced, ninezero or fu==9 and newMasks.size()==2)*10+fu);
	}
	return ret?ret:positive;
}
int main(){
	for(int i=0; i<1024; i++)
		singleLookup[i]=single(i);
	int k;
	scanf("%d", &k);
	vector<int> b(k);
	for(int& i : b)
		scanf("%d", &i), i=1<<i;
	printf("%lld\n", solve(b));
}

Compilation message

sequence.cpp: In function 'long long int solve(std::vector<int>&, int, bool, bool)':
sequence.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |    for(int j=0; j*10+i<masks.size(); j++){
      |                 ~~~~~~^~~~~~~~~~~~~
sequence.cpp:51:78: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   51 |   ret=min(ret, solve(newMasks, depth+1, fu==0 and reduced, ninezero or fu==9 and newMasks.size()==2)*10+fu);
      |                                                                        ~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |  scanf("%d", &k);
      |  ~~~~~^~~~~~~~~~
sequence.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |   scanf("%d", &i), i=1<<i;
      |   ~~~~~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 14 ms 204 KB Output is correct
3 Correct 14 ms 204 KB Output is correct
4 Correct 9 ms 332 KB Output is correct
5 Correct 8 ms 332 KB Output is correct
6 Correct 10 ms 312 KB Output is correct
7 Correct 88 ms 588 KB Output is correct
8 Correct 54 ms 460 KB Output is correct
9 Correct 126 ms 716 KB Output is correct
10 Correct 121 ms 680 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 55 ms 460 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -