oj.uz

답안 #389570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389570 2021-04-14T07:34:42 Z casperwang Binary Subsequences (info1cup17_binary) C++14
0 / 100
 900 ms 1620 KB 
#include <bits/stdc++.h>
#define int long long
#define pb emplace_back
using namespace std;
#define debug(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 pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 2000;
const int K = 12;
const int INF = 1e18;
int T, N;
vector <string> arr;
vector <string> tmp;
bool ans[MAXN+1];
string str[MAXN+1];

bool check(const string &a, const string &b) {
	int j = 0;
	for (int i = 0; i < a.size(); i++)
		if (j < b.size() && a[i] == b[j]) j++;
	return j == b.size();
}

void init() {
	for (int i = 1; i <= K; i++) {
		for (int j = 0; j < (1<<i); j++) {
			string now = "";
			for (int k = 0; k < i; k++)
				now += ((j & (1<<k)) ? '1' : '0');
			int cnt = 1;
			for (string s : arr) cnt += check(now, s);
			if (ans[cnt] == 0)
				ans[cnt] = 1, str[cnt] = now;
			tmp.pb(now);
		}
		for (string s: tmp) arr.pb(s);
		tmp.clear();
	}
}

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	init();
	cin >> T;
	while (T--) {
		cin >> N;
		cout << -1 << '\n';
		if (ans[N]) {
			for (int i = 0; i < str[N].size(); i++)
				cout << str[N][i] << " \n"[i==str[N].size()-1];
		} else {
			cout << -1 << '\n';
		}
	}
	return 0;
}

Compilation message

binary.cpp: In function 'bool check(const string&, const string&)':
binary.cpp:21:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for (int i = 0; i < a.size(); i++)
      |                  ~~^~~~~~~~~~
binary.cpp:22:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |   if (j < b.size() && a[i] == b[j]) j++;
      |       ~~^~~~~~~~~~
binary.cpp:23:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  return j == b.size();
      |         ~~^~~~~~~~~~~
binary.cpp: In function 'int main()':
binary.cpp:51:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    for (int i = 0; i < str[N].size(); i++)
      |                    ~~^~~~~~~~~~~~~~~
binary.cpp:52:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     cout << str[N][i] << " \n"[i==str[N].size()-1];
      |                                ~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1002 ms 900 KB Time limit exceeded

Subtask #2
0 / 39.0

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

Subtask #3
0 / 18.0

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