제출 #419386

#제출 시각아이디문제언어결과실행 시간메모리
419386Kevin_Zhang_TWBroken Device (JOI17_broken_device)C++17
41 / 100
56 ms2668 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 + 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; }

컴파일 시 표준 에러 (stderr) 메시지

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