#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%I64d",&x)
#define SF2(x,y) scanf("%I64d%I64d",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()
using namespace std;
const long long INF = 1e9+5e8;
const int MX=1500005;
void encode(int N, int M[])
{
for(int i=0;i<N;i++){
for(int j=0;j<8;j++){
if(M[i]&(1<<j)){
send((8*i)+j);
}
}
}
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%I64d",&x)
#define SF2(x,y) scanf("%I64d%I64d",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()
using namespace std;
const long long INF = 1e9+5e8;
const int MX=1500005;
int res[33];
void decode(int N, int L, int X[])
{
MEM(res,0);
for(int i=0;i<L;i++){
res[X[i]/8]+=(1<<(X[i]%8));
}
for(int i=0;i<N;i++)
output(res[i]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
1736 KB |
Output is correct |
2 |
Correct |
5 ms |
1920 KB |
Output is correct |
3 |
Correct |
5 ms |
2024 KB |
Output is correct |
4 |
Correct |
5 ms |
2024 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
2024 KB |
Output is correct |
2 |
Correct |
6 ms |
2312 KB |
Output is correct |
3 |
Correct |
5 ms |
2312 KB |
Output is correct |
4 |
Correct |
5 ms |
2312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
2312 KB |
Output is correct |
2 |
Correct |
5 ms |
2312 KB |
Output is correct |
3 |
Correct |
6 ms |
2312 KB |
Output is correct |
4 |
Correct |
7 ms |
2312 KB |
Output is correct |
5 |
Correct |
7 ms |
2312 KB |
Output is correct |
6 |
Correct |
7 ms |
2312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
6 ms |
2312 KB |
Output is partially correct - P = 8.000000 |
2 |
Partially correct |
7 ms |
2312 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
4 ms |
2312 KB |
Error : Bad encoded integer |
4 |
Incorrect |
5 ms |
2312 KB |
Error : Bad encoded integer |
5 |
Incorrect |
4 ms |
2312 KB |
Error : Bad encoded integer |
6 |
Incorrect |
4 ms |
2312 KB |
Error : Bad encoded integer |
7 |
Incorrect |
4 ms |
2312 KB |
Error : Bad encoded integer |