oj.uz

Submission #881657

# Submission time Handle Problem Language Result Execution time Memory
881657 2023-12-01T17:00:44 Z karrigan Parrots (IOI11_parrots) C++14
81 / 100
 3 ms 1596 KB 
#include<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
//5 bit dau danh so vi tri 3 bit sau bieu dien bit bat trong gia tri
void encode(int n,int M[]){
for1(i,0,n-1){
int value=M[i];
int pos=(i)*(1<<3);
for1(j,0,7){
if ((value>>j&1)){
send(pos+j);
}
}
}
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    encode(3,{10,30,20});
}*/

#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
int b[32];
void decode(int n,int l,int x[]){
for1(i,0,n-1)b[i]=0;
for1(i,0,l-1){
int vl=x[i];
int pos=(vl>>3);
int last=vl%(1<<3);
b[pos]+=(1<<(last));
}
for1(i,0,n-1)output(b[i]);
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    encode(3,{10,30,20});
}*/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1308 KB Output is correct
2 Correct 2 ms 1312 KB Output is correct
3 Correct 2 ms 1320 KB Output is correct
4 Correct 1 ms 1320 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 1 ms 1320 KB Output is correct
4 Correct 1 ms 1324 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1300 KB Output is correct
2 Correct 1 ms 1316 KB Output is correct
3 Correct 1 ms 1320 KB Output is correct
4 Correct 3 ms 1336 KB Output is correct
5 Correct 2 ms 1180 KB Output is correct
6 Correct 2 ms 1596 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1316 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1344 KB Output is partially correct - P = 8.000000
3 Incorrect 1 ms 804 KB Error : Bad encoded integer
4 Incorrect 0 ms 808 KB Error : Bad encoded integer
5 Incorrect 0 ms 796 KB Error : Bad encoded integer
6 Incorrect 0 ms 808 KB Error : Bad encoded integer
7 Incorrect 1 ms 912 KB Error : Bad encoded integer