oj.uz

Submission #188627

# Submission time Handle Problem Language Result Execution time Memory
188627 2020-01-13T09:43:25 Z awlintqaa Parrots (IOI11_parrots) C++14
81 / 100
 15 ms 2032 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
#include "encoder.h"
#include "encoderlib.h"
map<pi,int>id12;
map<int,pi>id21;
void fill(){
        int num=0;
        for(int i=0;i<32;i++){
                for(int j=0;j<8;j++){
                        id12[{i,j}]=num;
                        id21[num]={i,j};
                        num++;
                }
        }
}
void encode(int N, int M[]){
        fill();
        for(int i=0;i<N;i++){
                int x=M[i];
                for(int j=0;j<8;j++){
                        if((x&(1<<j)))send(id12[{i,j}]);
                }
        }
}
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
#include "decoder.h"
#include "decoderlib.h"
map<pi,int>id12;
map<int,pi>id21;
void fill(){
        int num=0;
        for(int i=0;i<32;i++){
                for(int j=0;j<8;j++){
                        id12[{i,j}]=num;
                        id21[num]={i,j};
                        num++;
                }
        }
}
int ret[39];
void decode(int N, int L, int X[]){
        mem(ret,0);
  		fill();
        for(int i=0;i<L;i++){
                int x=X[i];
                pi ans=id21[x];
                ret[ans.fi]+=(1<<ans.se);
        }
        for(int i=0;i<N;i++){
                output(ret[i]);
        }
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1112 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1520 KB Output is correct
2 Correct 7 ms 1520 KB Output is correct
3 Correct 9 ms 1520 KB Output is correct
4 Correct 9 ms 1520 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1520 KB Output is correct
2 Correct 9 ms 1520 KB Output is correct
3 Correct 9 ms 1576 KB Output is correct
4 Correct 8 ms 1776 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1776 KB Output is correct
2 Correct 9 ms 1520 KB Output is correct
3 Correct 9 ms 1520 KB Output is correct
4 Correct 10 ms 1520 KB Output is correct
5 Correct 10 ms 1776 KB Output is correct
6 Correct 10 ms 1776 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 1520 KB Output is partially correct - P = 8.000000
2 Partially correct 15 ms 1776 KB Output is partially correct - P = 8.000000
3 Incorrect 9 ms 1776 KB Error : Output is wrong
4 Incorrect 10 ms 1776 KB Error : Output is wrong
5 Incorrect 7 ms 1520 KB Error : Output is wrong
6 Incorrect 12 ms 2032 KB Error : Output is wrong
7 Incorrect 12 ms 1776 KB Error : Output is wrong