# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
79843 |
2018-10-16T18:39:30 Z |
doowey |
Parrots (IOI11_parrots) |
C++14 |
|
6 ms |
1616 KB |
#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int n, int arr[])
{
vector<int> bits;
for(int i = 0; i < n; i ++ ){
for(int j = 0; j < 8 ; j ++ ){
if((arr[i] & (1 << j))){
bits.push_back(1);
}
else{
bits.push_back(0);
}
}
}
for(int i = 0; i < bits.size(); i ++ ){
if(bits[i] == 1)
send(i);
}
}
/*
void decode(int n, int k, int x[]){
vector<int> ret_bits(n * 8);
for(int i = 0; i < k ;i ++ )
ret_bits[x[i]] = 1;
int L, R;
int sum;
for(int i = 0; i < n; i ++ ){
L = i * 8;
R = L + 8;
vector<int> p;
for(int j = L; j < R; j ++ ){
p.push_back(ret_bits[j] % 2);
}
sum = 0;
for(int bit = 0; bit < 8; bit ++ )
sum += p[bit] * (1 << bit);
output(sum);
}
}
*/
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int n, int k, int x[]){
vector<int> ret_bits(n * 8);
for(int i = 0; i < k ;i ++ )
ret_bits[x[i]] = 1;
int L, R;
int sum;
for(int i = 0; i < n; i ++ ){
L = i * 8;
R = L + 8;
vector<int> p;
for(int j = L; j < R; j ++ ){
p.push_back(ret_bits[j] % 2);
}
sum = 0;
for(int bit = 0; bit < 8; bit ++ )
sum += p[bit] * (1 << bit);
output(sum);
}
}
Compilation message
encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < bits.size(); i ++ ){
~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1520 KB |
Output is correct |
2 |
Correct |
4 ms |
1520 KB |
Output is correct |
3 |
Correct |
5 ms |
1528 KB |
Output is correct |
4 |
Correct |
5 ms |
1520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1464 KB |
Output is correct |
2 |
Correct |
5 ms |
1520 KB |
Output is correct |
3 |
Correct |
5 ms |
1520 KB |
Output is correct |
4 |
Correct |
5 ms |
1520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1520 KB |
Output is correct |
2 |
Correct |
5 ms |
1520 KB |
Output is correct |
3 |
Correct |
5 ms |
1520 KB |
Output is correct |
4 |
Correct |
6 ms |
1520 KB |
Output is correct |
5 |
Correct |
6 ms |
1520 KB |
Output is correct |
6 |
Correct |
6 ms |
1616 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
5 ms |
1520 KB |
Output is partially correct - P = 8.000000 |
2 |
Partially correct |
6 ms |
1520 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
4 ms |
760 KB |
Error : Bad encoded integer |
4 |
Incorrect |
4 ms |
832 KB |
Error : Bad encoded integer |
5 |
Incorrect |
4 ms |
756 KB |
Error : Bad encoded integer |
6 |
Incorrect |
4 ms |
836 KB |
Error : Bad encoded integer |
7 |
Incorrect |
4 ms |
752 KB |
Error : Bad encoded integer |