oj.uz

Submission #15954

# Submission time Handle Problem Language Result Execution time Memory
15954 2015-08-02T12:11:08 Z myungwoo Sequence (BOI14_sequence) C++14
0 / 100
 1000 ms 2588 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAXN 100005
#define pb push_back
typedef long long lld;

int N;
int A[MAXN];
lld ans = 12345678900000;

void dfs(lld n, lld v, vector<int> &arr)
{
	if (arr.empty()){ ans = v; return; }
	if (v+n >= ans) return;
	for (int i=9;i>=0;i--){
		lld m = v + n*i;
		if (m >= ans) continue;
		vector <int> nxt;
		for (int p: arr){
			lld now = m + p;
			bool sw = 0;
			for (lld tmp=now;tmp;tmp/=10) if (tmp%10 == A[p]){ sw = 1; break; }
			if (!sw) nxt.pb(p);
		}
		dfs(n*10, m, nxt);
	}
}

int main()
{
	scanf("%d", &N);
	for (int i=0;i<N;i++) scanf("%d", A+i);
	vector <int> tmp;
	for (int i=0;i<N;i++) tmp.pb(i);
	dfs(1, 0, tmp);
	printf("%lld\n", ans);
}

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2112 KB Output is correct
2 Execution timed out 1000 ms 2108 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2112 KB Output is correct
2 Execution timed out 1000 ms 2108 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2112 KB Output is correct
2 Execution timed out 1000 ms 2588 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2112 KB Output is correct
2 Execution timed out 1000 ms 2108 KB Program timed out
3 Halted 0 ms 0 KB -