답안 #419873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
419873	2021-06-07T14:52:00 Z	Kevin_Zhang_TW	Broken Device (JOI17_broken_device)	C++17	71 / 100	54 ms	2480 KB

Anna
Bruno

#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);
		vector<int> val(60);
		for (int i = 0;i < 60;++i)
			val[i] = X&1, X>>=1;

		if (flip)
			for (int i = 0;i < 60;i += 2)
				val[i] ^= 1;

		int cnt = 0;
		for (int i = 0, j = 0;i < N && j < 60;++i) {
			if (bad[i]) continue;
			if (((i&1) == (val[j]&1))) {
				res[i] = true;
				++j;
			}
		}

		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]);

	debug(AI(res));
	DE("Send", X);
}

#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"

long long Bruno( int N, int A[] ){

	vector<int> bit;

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

	if (bit.size() > 60) {
		DE(bit.size());
		bit.resize(60);
		for (int i = 0;i < 60;i += 2)
			bit[i] ^= 1;
	}

	reverse(AI(bit));

	ll X = 0;

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

	DE(X);

	return X;
}

Compilation message

Anna.cpp: In lambda function:
Anna.cpp:39:7: warning: unused variable 'cnt' [-Wunused-variable]
   39 |   int cnt = 0;
      |       ^~~
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:57:2: note: in expansion of macro 'DE'
   57 |  DE(count(AI(a), 1), count(AI(b), 1));
      |  ^~
Anna.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Anna.cpp:72:2: note: in expansion of macro 'debug'
   72 |  debug(AI(res));
      |  ^~~~~
Anna.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Anna.cpp:73:2: note: in expansion of macro 'DE'
   73 |  DE("Send", X);
      |  ^~

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
Bruno.cpp:35:3: note: in expansion of macro 'DE'
   35 |   DE(bit.size());
      |   ^~
Bruno.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
Bruno.cpp:48:2: note: in expansion of macro 'DE'
   48 |  DE(X);
      |  ^~

Subtask #1
71.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	40 ms	2220 KB	Output is partially correct - L* = 31
2	Partially correct	40 ms	2312 KB	Output is partially correct - L* = 30
3	Partially correct	46 ms	2332 KB	Output is partially correct - L* = 33
4	Partially correct	39 ms	2280 KB	Output is partially correct - L* = 32
5	Partially correct	41 ms	2204 KB	Output is partially correct - L* = 31
6	Partially correct	47 ms	2136 KB	Output is partially correct - L* = 34
7	Partially correct	41 ms	2312 KB	Output is partially correct - L* = 33
8	Partially correct	40 ms	2260 KB	Output is partially correct - L* = 31
9	Partially correct	41 ms	2392 KB	Output is partially correct - L* = 34
10	Partially correct	40 ms	2292 KB	Output is partially correct - L* = 31
11	Partially correct	40 ms	2288 KB	Output is partially correct - L* = 33
12	Partially correct	46 ms	2300 KB	Output is partially correct - L* = 34
13	Partially correct	40 ms	2204 KB	Output is partially correct - L* = 31
14	Partially correct	41 ms	2272 KB	Output is partially correct - L* = 30
15	Partially correct	41 ms	2316 KB	Output is partially correct - L* = 36
16	Partially correct	39 ms	2384 KB	Output is partially correct - L* = 32
17	Partially correct	40 ms	2296 KB	Output is partially correct - L* = 31
18	Partially correct	45 ms	2360 KB	Output is partially correct - L* = 33
19	Partially correct	41 ms	2268 KB	Output is partially correct - L* = 35
20	Partially correct	40 ms	2152 KB	Output is partially correct - L* = 36
21	Partially correct	40 ms	2480 KB	Output is partially correct - L* = 33
22	Partially correct	39 ms	2324 KB	Output is partially correct - L* = 36
23	Partially correct	45 ms	2380 KB	Output is partially correct - L* = 31
24	Partially correct	50 ms	2240 KB	Output is partially correct - L* = 31
25	Partially correct	48 ms	2292 KB	Output is partially correct - L* = 34
26	Partially correct	40 ms	2296 KB	Output is partially correct - L* = 34
27	Partially correct	41 ms	2176 KB	Output is partially correct - L* = 33
28	Partially correct	39 ms	2284 KB	Output is partially correct - L* = 33
29	Partially correct	41 ms	2420 KB	Output is partially correct - L* = 33
30	Partially correct	41 ms	2324 KB	Output is partially correct - L* = 34
31	Partially correct	40 ms	2320 KB	Output is partially correct - L* = 32
32	Partially correct	41 ms	2288 KB	Output is partially correct - L* = 35
33	Partially correct	41 ms	2376 KB	Output is partially correct - L* = 35
34	Partially correct	47 ms	2228 KB	Output is partially correct - L* = 35
35	Partially correct	40 ms	2292 KB	Output is partially correct - L* = 35
36	Partially correct	41 ms	2260 KB	Output is partially correct - L* = 35
37	Partially correct	40 ms	2224 KB	Output is partially correct - L* = 31
38	Partially correct	54 ms	2316 KB	Output is partially correct - L* = 33
39	Partially correct	39 ms	2328 KB	Output is partially correct - L* = 34
40	Partially correct	39 ms	2228 KB	Output is partially correct - L* = 32

답안 #419873

Compilation message

Subtask #1 71.0 / 100.0

Subtask #1
71.0 / 100.0