제출 #115898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115898		aminra	Broken Device (JOI17_broken_device)	C++14	0 / 100	77 ms	3128 KiB

Anna

#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)153;
const int infint = (int)1e9 + 3;
const ll inf = (ll)1e18;
void Anna(int N, ll X, int K, int P[])
{
	vector<int> bad(N, 0), ans(N, 0);
	for (int i = 0; i < K; i++)
		bad[P[i]] = 1;
	
	for (int i = 0; i < N; i += 3)
	{
		if(bad[i] + bad[i + 1] + bad[i + 2] > 1)
			continue;
		if(bad[i] + bad[i + 1] + bad[i + 2] == 0)
		{
			if(X % 4 == 0)
				ans[i] = 1;
			else
			if(X % 4 == 1)
				ans[i + 1] = ans[i + 2] = 1;
			else
			if(X % 4 == 2)
				ans[i] = ans[i + 2] = 1;
			else
			if(X % 4 == 3)
				ans[i] = ans[i + 1] = ans[i + 2] = 1;
			X /= 4;
			continue;
		}
		else
		if(bad[i + 1] == 0)
		{
			if(X % 2 == 0)
				ans[i + 1] = 1;
			else
			if(bad[i + 2] == 0)
				ans[i + 2] = 1;
			else
				ans[i] = ans[i + 1] = 1;
			X /= 2;
			continue;
		}
		else
		{
			if(X % 2 == 0)
				ans[i + 2] = 1, X /= 2;
			else
			if(X % 4 == 0)
				ans[i] = 1, X /= 4;
			else
				ans[i] = ans[i + 2] = 1, X /= 4;
		}
	}
	for (int i = 0; i < N; i++)
		Set(i, ans[i]);
}
/*int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
}*/

Bruno

#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)153;
const int infint = (int)1e9 + 3;
const ll inf = (ll)1e18;
ll Bruno(int N, int A[])
{
	ll ans = 0;
	for (int i = N - 3; i >= 0; i -= 3)
		if(A[i] == 0 && A[i + 1] == 0 && A[i + 2] == 0)
			continue;
		else
		if(A[i] == 1 && A[i + 1] == 0 && A[i + 2] == 0)
			ans = 1LL * ans * 4;
		else
		if(A[i] == 0 && A[i + 1] == 1 && A[i + 2] == 1)
			ans = 1LL * ans * 4 + 1;
		else
		if(A[i] == 1 && A[i + 1] == 0 && A[i + 2] == 1)
			ans = 1LL * ans * 4 + 2;
		else
		if(A[i] == 1 && A[i + 1] == 1 && A[i + 2] == 1)
			ans = 1LL * ans * 4 + 3;
		else
		if(A[i] == 0 && A[i + 1] == 0 && A[i + 2] == 1)
			ans = 1LL * ans * 2 + 1;
		else
		if(A[i] == 0 && A[i + 1] == 1 && A[i + 2] == 0)
			ans = 1LL * ans * 2;
		else
			ans = 1LL * ans * 2 + 1;
	return ans;
}
/*int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
}*/

• Subtask 1: 0 / 100