Submission #419868

#TimeUsernameProblemLanguageResultExecution timeMemory
419868Kevin_Zhang_TWBroken Device (JOI17_broken_device)C++17
41 / 100
43 ms2472 KiB
#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 (flip ^ ((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 (stderr)

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);
      |  ^~
#Verdict Execution timeMemoryGrader output
Fetching results...