oj.uz

답안 #389309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389309 2021-04-14T02:40:36 Z Kevin_Zhang_TW Binary Subsequences (info1cup17_binary) C++17
0 / 100
 900 ms 17072 KB 
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 1 << 24, MAX_W = 30, inf = MAX_N - 5;

int cal(int v, int wid) {

	int dp[2] {};

	for (int i = 0;i < wid;++i) {
		int a = v>>i&1;

		int tmp[2] {};

		tmp[a^1] = dp[a^1];
		tmp[a] = dp[0] + 1 + dp[1];

		swap(dp, tmp);

		chmin(dp[0], inf), chmin(dp[1], inf);

	}

	return min(inf, dp[0] + dp[1]);
}

int cnt[MAX_N];

int rec[MAX_N];

int solve(int K) {
	for (int wid = 1;;++wid) {
		for (int i = 0;i < 1<<wid;++i) {
			rec[i] = cal(i, wid);
			++cnt[ rec[i] ];
		}
		if (cnt[K]) {
			DE(wid);
			return wid;
			cout << cnt[K] << '\n';
			for (int i = 0;i < 1<<wid;++i) {
				if (rec[i] == K) {
					for (int j = 0;j < wid;++j)
						cout << (i>>j&1) << " \n"[j+1==wid];
					break;
				}
			}
		}
		bool ok = cnt[K];
		for (int i = 0;i < 1<<wid;++i)
			--cnt[ rec[i] ];
		if (ok) return wid;
	}
}


int way[MAX_N], need[MAX_N], one[MAX_N];

void precal() {

	for (int wid = 1;wid <= 18;++wid) {
		for (int i = 0;i < 1<<wid;++i) {
			int v = cal(i, wid);
			if (need[v] == 0 || need[v] == wid) {
				way[v]++;
				need[v] = wid;
				one[v] = i;
			}
		}
		DE(wid);
	}
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
//	int mxw = 0;
//	for (int i = 1;i <= 2000;++i) {
//		chmax(mxw, solve(i));
//	}
//	DE(mxw);

	int T;
	cin >> T;

	if (T == 2000) {
		precal();
		for (int k = 1;k <= 2000;++k) {
			cout << way[k] << '\n';
			int v = one[k];
			for (int i = 0 ;i < need[k];++i)
				cout << (v>>i&1) << " \n"[i+1==need[k]];
		}
		return 0;
	}

	while (T--) {
		int k;
		cin >> k;
		solve(k);
	}
}

Compilation message

binary.cpp: In function 'int solve(int)':
binary.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
binary.cpp:54:4: note: in expansion of macro 'DE'
   54 |    DE(wid);
      |    ^~
binary.cpp: In function 'void precal()':
binary.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
binary.cpp:86:3: note: in expansion of macro 'DE'
   86 |   DE(wid);
      |   ^~

Subtask #1
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 416 KB Output isn't correct

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1085 ms 8628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 17072 KB Time limit exceeded
2 Halted 0 ms 0 KB -