oj.uz

답안 #419386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419386 2021-06-07T04:35:05 Z Kevin_Zhang_TW Broken Device (JOI17_broken_device) C++17
41 / 100
 56 ms 2668 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);

	for (int i = 0, j = 0;i < 60;++i) {
		if (X>>i&1) {
			while (bad[j] || bad[j+1]) ++j;
			if (j+1 >= N) break;
			res[j] = res[j+1] = 1;
			j += 2;
		}
		else {
			while (bad[j]) ++j;
			if (j >= N) break;
			res[j] = 1;
			j += 2;
		}
	}

	DE(X);


	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[] ){
	int lst = 0;
	vector<int> val;
	for (int i = 0;i < N;++i) {
		DE(i, A[i]);
		if (A[i] == 1) {
			if (lst == 0) lst = 1;
			else {
				val.pb(1);
				lst = 0;
			}
		}
		if (A[i] == 0) {
			if (lst == 1) {
				val.pb(0);
				lst = 0;
			}
		}
	}
	if (lst == 1) val.pb(0);

	debug(AI(val));

	val.resize(60);

	ll ret = 0;
	reverse(AI(val));
	for (int i : val)
		ret = (ret << 1) + i;

	DE(ret);
	return ret;
}

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:45:2: note: in expansion of macro 'DE'
   45 |  DE(X);
      |  ^~
Anna.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Anna.cpp:48:2: note: in expansion of macro 'debug'
   48 |  debug(begin(res), begin(res) + N);
      |  ^~~~~

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:29:3: note: in expansion of macro 'DE'
   29 |   DE(i, A[i]);
      |   ^~
Bruno.cpp:17:20: warning: statement has no effect [-Wunused-value]
   17 | #define debug(...) 0
      |                    ^
Bruno.cpp:46:2: note: in expansion of macro 'debug'
   46 |  debug(AI(val));
      |  ^~~~~
Bruno.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define DE(...) 0
      |                 ^
Bruno.cpp:55:2: note: in expansion of macro 'DE'
   55 |  DE(ret);
      |  ^~

Subtask #1
41.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 45 ms 2456 KB Output is partially correct - L* = 17
2 Partially correct 38 ms 2528 KB Output is partially correct - L* = 16
3 Partially correct 40 ms 2504 KB Output is partially correct - L* = 18
4 Partially correct 41 ms 2476 KB Output is partially correct - L* = 17
5 Partially correct 47 ms 2464 KB Output is partially correct - L* = 17
6 Partially correct 46 ms 2616 KB Output is partially correct - L* = 17
7 Partially correct 56 ms 2528 KB Output is partially correct - L* = 18
8 Partially correct 44 ms 2520 KB Output is partially correct - L* = 18
9 Partially correct 38 ms 2432 KB Output is partially correct - L* = 18
10 Partially correct 41 ms 2544 KB Output is partially correct - L* = 16
11 Partially correct 38 ms 2572 KB Output is partially correct - L* = 17
12 Partially correct 49 ms 2556 KB Output is partially correct - L* = 20
13 Partially correct 53 ms 2544 KB Output is partially correct - L* = 18
14 Partially correct 39 ms 2472 KB Output is partially correct - L* = 18
15 Partially correct 40 ms 2488 KB Output is partially correct - L* = 16
16 Partially correct 48 ms 2400 KB Output is partially correct - L* = 17
17 Partially correct 47 ms 2492 KB Output is partially correct - L* = 17
18 Partially correct 39 ms 2484 KB Output is partially correct - L* = 16
19 Partially correct 46 ms 2608 KB Output is partially correct - L* = 18
20 Partially correct 54 ms 2528 KB Output is partially correct - L* = 15
21 Partially correct 41 ms 2428 KB Output is partially correct - L* = 17
22 Partially correct 40 ms 2576 KB Output is partially correct - L* = 16
23 Partially correct 43 ms 2516 KB Output is partially correct - L* = 15
24 Partially correct 49 ms 2528 KB Output is partially correct - L* = 17
25 Partially correct 39 ms 2612 KB Output is partially correct - L* = 21
26 Partially correct 39 ms 2668 KB Output is partially correct - L* = 16
27 Partially correct 39 ms 2428 KB Output is partially correct - L* = 18
28 Partially correct 45 ms 2556 KB Output is partially correct - L* = 19
29 Partially correct 43 ms 2556 KB Output is partially correct - L* = 16
30 Partially correct 49 ms 2536 KB Output is partially correct - L* = 20
31 Partially correct 52 ms 2540 KB Output is partially correct - L* = 17
32 Partially correct 39 ms 2460 KB Output is partially correct - L* = 18
33 Partially correct 45 ms 2548 KB Output is partially correct - L* = 17
34 Partially correct 47 ms 2456 KB Output is partially correct - L* = 18
35 Partially correct 45 ms 2404 KB Output is partially correct - L* = 16
36 Partially correct 47 ms 2436 KB Output is partially correct - L* = 15
37 Partially correct 43 ms 2628 KB Output is partially correct - L* = 16
38 Partially correct 40 ms 2416 KB Output is partially correct - L* = 18
39 Partially correct 41 ms 2556 KB Output is partially correct - L* = 17
40 Partially correct 41 ms 2476 KB Output is partially correct - L* = 15