oj.uz

답안 #419850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419850 2021-06-07T14:02:39 Z Kevin_Zhang_TW Broken Device (JOI17_broken_device) C++17
65 / 100
 52 ms 2476 KB 
#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 = 300010;
#include "Annalib.h"

// 11 means 1
// 10 means 0
void Anna( int N, long long X, int K, int P[] ){
	vector<int> bad(N);
	for (int i = 0;i < K;++i)
		bad[ P[i] ] = true;

	auto try_gen = [&](ll X, bool flip) {

		vector<int> res(N);

		int cnt = 0;
		for (int i = 0;i < N;++i) {
			if (bad[i]) continue;
			if (flip ^ ((i&1) == (X&1))) {
				if (++cnt > 60) break;
				res[i] = true;
				X>>=1;
			}
		}

		return res;
	};


	auto a = try_gen(X, false);
	auto b = try_gen(X, true);

	vector<int> res;

	DE(count(AI(a), 1), count(AI(b), 1));

	if (count(AI(a), 1) >= count(AI(b), 1)) {
		res = a;
	}
	else {
		res = b;
		for (int i = N-1;i >= 0;--i) if (!bad[i]) {
			res[i] = true;
			break;
		}
	}
for (int i = 0;i < N;++i)
		Set(i, res[i]);
}

#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)
namespace {
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 = 300010;
#include "Brunolib.h"

// 11 means 1
// 10 means 0
long long Bruno( int N, int A[] ){

	vector<int> bit;

	for (int i = 0, j = 0;i < N;++i) {
		if (A[i] == 1) {
			if (i&1) bit.pb(1);
			else bit.pb(0);
			++j;
		}
	}

	if (bit.size() > 60) {
		bit.resize(60);
		for (int &i : bit) i ^= 1;
	}

	reverse(AI(bit));

	ll X = 0;

	for (int i = 0;i < 60;++i)
		X = (X<<1) + bit[i];

	return X;
}

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Anna.cpp:51:2: note: in expansion of macro 'DE'
   51 |  DE(count(AI(a), 1), count(AI(b), 1));
      |  ^~

Subtask #1
65.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 46 ms 2200 KB Output is partially correct - L* = 31
2 Partially correct 47 ms 2476 KB Output is partially correct - L* = 30
3 Partially correct 41 ms 2420 KB Output is partially correct - L* = 27
4 Partially correct 39 ms 2204 KB Output is partially correct - L* = 29
5 Partially correct 40 ms 2228 KB Output is partially correct - L* = 30
6 Partially correct 40 ms 2220 KB Output is partially correct - L* = 30
7 Partially correct 47 ms 2400 KB Output is partially correct - L* = 31
8 Partially correct 41 ms 2256 KB Output is partially correct - L* = 29
9 Partially correct 41 ms 2196 KB Output is partially correct - L* = 29
10 Partially correct 42 ms 2324 KB Output is partially correct - L* = 30
11 Partially correct 41 ms 2384 KB Output is partially correct - L* = 27
12 Partially correct 40 ms 2196 KB Output is partially correct - L* = 30
13 Partially correct 40 ms 2280 KB Output is partially correct - L* = 31
14 Partially correct 40 ms 2312 KB Output is partially correct - L* = 30
15 Partially correct 41 ms 2212 KB Output is partially correct - L* = 30
16 Partially correct 40 ms 2232 KB Output is partially correct - L* = 30
17 Partially correct 40 ms 2308 KB Output is partially correct - L* = 29
18 Partially correct 40 ms 2304 KB Output is partially correct - L* = 31
19 Partially correct 40 ms 2244 KB Output is partially correct - L* = 31
20 Partially correct 40 ms 2228 KB Output is partially correct - L* = 29
21 Partially correct 41 ms 2260 KB Output is partially correct - L* = 30
22 Partially correct 40 ms 2248 KB Output is partially correct - L* = 30
23 Partially correct 41 ms 2300 KB Output is partially correct - L* = 30
24 Partially correct 40 ms 2244 KB Output is partially correct - L* = 30
25 Partially correct 40 ms 2416 KB Output is partially correct - L* = 29
26 Partially correct 40 ms 2252 KB Output is partially correct - L* = 30
27 Partially correct 41 ms 2192 KB Output is partially correct - L* = 29
28 Partially correct 39 ms 2204 KB Output is partially correct - L* = 31
29 Partially correct 41 ms 2160 KB Output is partially correct - L* = 30
30 Partially correct 52 ms 2196 KB Output is partially correct - L* = 30
31 Partially correct 39 ms 2204 KB Output is partially correct - L* = 32
32 Partially correct 41 ms 2280 KB Output is partially correct - L* = 29
33 Partially correct 40 ms 2228 KB Output is partially correct - L* = 30
34 Partially correct 40 ms 2224 KB Output is partially correct - L* = 30
35 Partially correct 40 ms 2300 KB Output is partially correct - L* = 30
36 Partially correct 47 ms 2200 KB Output is partially correct - L* = 31
37 Partially correct 47 ms 2308 KB Output is partially correct - L* = 31
38 Partially correct 40 ms 2356 KB Output is partially correct - L* = 30
39 Partially correct 40 ms 2260 KB Output is partially correct - L* = 30
40 Partially correct 41 ms 2156 KB Output is partially correct - L* = 31