oj.uz

답안 #389323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389323 2021-04-14T02:59:39 Z Kevin_Zhang_TW Binary Subsequences (info1cup17_binary) C++17
0 / 100
 83 ms 16088 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 = 2010, MAX_W = 30, inf = MAX_N - 5, p = 1e9 + 7;

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 way[MAX_N], need[MAX_N], one[MAX_N];

void add(int &a, int b) {
	a += b - p, a += (a>>31) & p;
}

int dp[MAX_N][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) {
				need[v] = wid;
				one[v] = i;
			}
		}
		DE(wid);
	}

	dp[0][0] = 1;

	for (int i = 0;i < MAX_N;++i)
		for (int j = 0;i + j < MAX_N;++j) {
			if (i + j + 1 < MAX_N) {
				add(dp[i + j + 1][j], dp[i][j]);
				add(dp[i][i + j + 1], dp[i][j]);
			}
			add(way[i + j], dp[i][j]);
		}

	for (int i = 1;i <= 2000;++i)
		DE(i, way[i]);

}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int T;
	cin >> T;

	if (T == 2000) {
		precal();
		return 0;
		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]];

			assert(way[k] && need[k]);
		}
		return 0;
	}

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

Compilation message

binary.cpp: In function 'void precal()':
binary.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
binary.cpp:59:3: note: in expansion of macro 'DE'
   59 |   DE(wid);
      |   ^~
binary.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
binary.cpp:74:3: note: in expansion of macro 'DE'
   74 |   DE(i, way[i]);
      |   ^~

Subtask #1
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 83 ms 16088 KB Unexpected end of file - int32 expected

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -