oj.uz

답안 #419849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419849 2021-06-07T14:01:51 Z Kevin_Zhang_TW Broken Device (JOI17_broken_device) C++17
45 / 100
 54 ms 2360 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 + 1000);
	for (int i = 0;i < K;++i)
		bad[ P[i] ] = true;
 
	vector<int> res(N + 100);
 
	int cnt = 0;
	for (int i = 0;i < N;++i) {
		if (bad[i]) continue;
 
		if ((i&1) == (X&1)) {
			if (++cnt > 60) break;
			res[i] = true;
			X>>=1;
		}
	}
 
	debug(begin(res), begin(res) + N);
	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(60);
 
	for (int i = 0, j = 0;i < N;++i) {
		if (A[i] == 1) {
			if (i&1) bit[j] = 1;
			++j;
		}
	}
 
	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:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Anna.cpp:41:2: note: in expansion of macro 'debug'
   41 |  debug(begin(res), begin(res) + N);
      |  ^~~~~

Subtask #1
45.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 38 ms 2196 KB Output is partially correct - L* = 31
2 Partially correct 38 ms 2196 KB Output is partially correct - L* = 17
3 Partially correct 46 ms 2216 KB Output is partially correct - L* = 24
4 Partially correct 41 ms 2244 KB Output is partially correct - L* = 18
5 Partially correct 40 ms 2292 KB Output is partially correct - L* = 25
6 Partially correct 41 ms 2288 KB Output is partially correct - L* = 17
7 Partially correct 40 ms 2208 KB Output is partially correct - L* = 23
8 Partially correct 39 ms 2244 KB Output is partially correct - L* = 29
9 Partially correct 45 ms 2168 KB Output is partially correct - L* = 29
10 Partially correct 40 ms 2304 KB Output is partially correct - L* = 31
11 Partially correct 40 ms 2196 KB Output is partially correct - L* = 20
12 Partially correct 39 ms 2264 KB Output is partially correct - L* = 21
13 Partially correct 40 ms 2340 KB Output is partially correct - L* = 28
14 Partially correct 38 ms 2316 KB Output is partially correct - L* = 19
15 Partially correct 46 ms 2280 KB Output is partially correct - L* = 34
16 Partially correct 44 ms 2300 KB Output is partially correct - L* = 18
17 Partially correct 39 ms 2192 KB Output is partially correct - L* = 17
18 Partially correct 38 ms 2260 KB Output is partially correct - L* = 30
19 Partially correct 38 ms 2320 KB Output is partially correct - L* = 29
20 Partially correct 41 ms 2280 KB Output is partially correct - L* = 21
21 Partially correct 40 ms 2152 KB Output is partially correct - L* = 31
22 Partially correct 41 ms 2288 KB Output is partially correct - L* = 29
23 Partially correct 45 ms 2308 KB Output is partially correct - L* = 26
24 Partially correct 40 ms 2204 KB Output is partially correct - L* = 22
25 Partially correct 41 ms 2300 KB Output is partially correct - L* = 29
26 Partially correct 47 ms 2204 KB Output is partially correct - L* = 23
27 Partially correct 47 ms 2248 KB Output is partially correct - L* = 31
28 Partially correct 40 ms 2260 KB Output is partially correct - L* = 23
29 Partially correct 38 ms 2332 KB Output is partially correct - L* = 27
30 Partially correct 41 ms 2356 KB Output is partially correct - L* = 28
31 Partially correct 47 ms 2240 KB Output is partially correct - L* = 32
32 Partially correct 49 ms 2172 KB Output is partially correct - L* = 34
33 Partially correct 41 ms 2256 KB Output is partially correct - L* = 18
34 Partially correct 38 ms 2232 KB Output is partially correct - L* = 35
35 Partially correct 38 ms 2196 KB Output is partially correct - L* = 26
36 Partially correct 41 ms 2224 KB Output is partially correct - L* = 20
37 Partially correct 39 ms 2360 KB Output is partially correct - L* = 20
38 Partially correct 54 ms 2236 KB Output is partially correct - L* = 30
39 Partially correct 40 ms 2156 KB Output is partially correct - L* = 26
40 Partially correct 40 ms 2336 KB Output is partially correct - L* = 29