oj.uz

답안 #668182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
668182 2022-12-03T08:11:56 Z mdubaisi Zalmoxis (BOI18_zalmoxis) C++14
0 / 100
 78 ms 40172 KB 
#include <bits/stdc++.h>
#include <array>
#include <unordered_set>
#define ll long long
#define all(v) (v.begin()), (v.end())
#define setall(a, val) for(auto& x : a) x = val
clock_t start_time;
double get_time() { return (double)(clock() - start_time) / CLOCKS_PER_SEC; }
void init() {
#ifndef ONLINE_JUDGE
	FILE* _ = freopen("in.txt", "r", stdin);
	start_time = clock();
#endif
}
const ll MOD = 1e9 + 7;
const ll N = 1e6 + 7;
const ll M = 5e1 + 7;
using namespace std;
//####################################################################################

int n, k;
int a[N], pos;
vector< pair<bool, bool> > v; // {go to childeren, new node}
void create_tree(int x, int node) {
	if (x == a[pos]) {
		v[node] = { 0, 0 };
		pos++;
		return;
	}
	if (pos < n && a[pos] < x) {
		create_tree(x - 1, node * 2);
		create_tree(x - 1, node * 2 + 1);
		v[node] = { 1, 0 };
	}
	else
		v[node] = { 0, 1 }, k--;
}

void print(int x, int t) {
	if (t == 0) {
		cout << x << ' ';
		return;
	}
	print(x - 1, 0);
	print(x - 1, t - 1);
}

void solve(int x, int node) {
	if (!v[node].first) {
		print(x, k * v[node].second);
		return;
	}
	solve(x - 1, node * 2);
	solve(x - 1, node * 2 + 1);
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);// init(); srand(time(0));

	cin >> n >> k;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	v.resize(8 * N);
	create_tree(30, 1);
	solve(30, 1);
	cout << endl;

	//cerr << get_time() << "s" << endl;
}

Compilation message

zalmoxis.cpp: In function 'void init()':
zalmoxis.cpp:11:8: warning: unused variable '_' [-Wunused-variable]
   11 |  FILE* _ = freopen("in.txt", "r", stdin);
      |        ^

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 74 ms 40052 KB Execution killed with signal 11
2 Runtime error 78 ms 40060 KB Execution killed with signal 11
3 Runtime error 76 ms 40084 KB Execution killed with signal 11
4 Runtime error 74 ms 40116 KB Execution killed with signal 11
5 Runtime error 75 ms 40136 KB Execution killed with signal 11
6 Runtime error 73 ms 40060 KB Execution killed with signal 11

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 73 ms 40108 KB Execution killed with signal 11
2 Runtime error 76 ms 40104 KB Execution killed with signal 11
3 Runtime error 77 ms 40172 KB Execution killed with signal 11
4 Runtime error 77 ms 40084 KB Execution killed with signal 11
5 Runtime error 74 ms 40140 KB Execution killed with signal 11
6 Runtime error 74 ms 40052 KB Execution killed with signal 11
7 Runtime error 73 ms 40132 KB Execution killed with signal 11
8 Runtime error 73 ms 40132 KB Execution killed with signal 11
9 Runtime error 63 ms 38568 KB Execution killed with signal 11
10 Runtime error 43 ms 34608 KB Execution killed with signal 11
11 Runtime error 49 ms 36132 KB Execution killed with signal 11
12 Runtime error 25 ms 32156 KB Execution killed with signal 11
13 Runtime error 29 ms 32192 KB Execution killed with signal 11
14 Runtime error 28 ms 32204 KB Execution killed with signal 11