제출 #913584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
913584		blackscreen1	Coreputer (IOI23_coreputer)	C++17	0 / 100	1 ms	500 KiB

coreputer

#include "coreputer.h"
#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (ll i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i != h; i += g)
#define jloop_(m, h, g) for (auto j = m; j != h; j += g)
#define kloop_(m, h, g) for (auto k = m; k != h; k += g)
#define lloop_(m, h, g) for (auto l = m; l != h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
vector<int> malfunctioning_cores(int N) {
	int lb = 0, ub = N-1, mid;
	bool is_even = 0;
	while (ub > lb) {
		mid = (lb + ub)>>1;
		vector<int> v;
		iloop(0, mid+1) v.push_back(i);
		int tm = run_diagnostic(v);
		if (tm == -1) lb = mid + 1;
		else {
			ub = mid;
			if (tm == 0) is_even = 1;
		}
	}
	bool is[N];
	memset(is, 0, sizeof(is));
	is[lb] = 1;
	if (is_even) {
		int cnt = 0;
		vector<int> v;
		iloop(0, lb+1) v.push_back(i);
		iloop(lb+1, N) {
			v.push_back(i);
			if (run_diagnostic(v) != 0) {is[i] = 1; cnt++;}
			v.pop_back();
		}
		v.clear();
		iloop(lb+1, N) v.push_back(i);
		iloop(lb-1, 0) {
			v.push_back(i);
			if (run_diagnostic(v) != 0) {is[i] = 1; cnt--;}
			v.pop_back();
		}
		if (cnt) is[0] = 1;
	}
	else {
		int cnt = 0;
		vector<int> v;
		iloop(0, lb) v.push_back(i);
		iloop(lb+1, N) {
			v.push_back(i);
			if (run_diagnostic(v) != -1) {is[i] = 1; cnt++;}
			v.pop_back();
		}
		v.clear();
		iloop(lb+1, N) v.push_back(i);
		iloop(lb-1, 0) {
			v.push_back(i);
			if (run_diagnostic(v) != -1) {is[i] = 1; cnt--;}
			v.pop_back();
		}
		if (cnt) is[0] = 1;
	}
	vector<int> ans;
	iloop(0, N) if (is[i]) ans.push_back(i);
	return ans;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40