제출 #1091930

#제출 시각아이디문제언어결과실행 시간메모리
1091930BarbarBrick앵무새 (IOI11_parrots)C++14
52 / 100
3 ms1336 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; void encode(int N, int M[]) { for (int i = 0; i < 8 * N; i++) { int message = (i << 1) + !!(M[i / 8] & (1 << (i % 8))); send(message); } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; void decode(int N, int L, int X[]) { vector<int> vec; int mask = (1 << 8) - 1; for (int i = 0; i < L; i++) { int b = X[i]; vec.push_back(b); } sort(vec.begin(), vec.end()); for (int i = 0; i < N; i++) { int sum = 0; for (int j = 0; j < 8; j++) { sum += (vec[i * 8 + j] & 1) << j; } output(sum); } }

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

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:9:9: warning: unused variable 'mask' [-Wunused-variable]
    9 |     int mask = (1 << 8) - 1;
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...