Submission #1297963

#TimeUsernameProblemLanguageResultExecution timeMemory
1297963khoavn2008Parrots (IOI11_parrots)C++17
0 / 100
3 ms832 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
#define FORNG(i,r,l) for(int i = (r), _l = (l); i >= _l; i--)
#define REP(i,r) for(int i = 0, _r = (r); i < _r; i++)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define size(v) ((ll)(v).size())
#define all(v) (v).begin(),(v).end()
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
const ll MOD = 1e9 + 7, N = 1e5 + 10, M = 1e5, LOG = 18;
const ll INF = 1e18 + 10;
void encode(int n, int a[])
{
    REP(i,n){
        REP(j,8)if(BIT(a[i], j))send((i << 6) + j);
    }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
#define FORNG(i,r,l) for(int i = (r), _l = (l); i >= _l; i--)
#define REP(i,r) for(int i = 0, _r = (r); i < _r; i++)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define size(v) ((ll)(v).size())
#define all(v) (v).begin(),(v).end()
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
const ll MOD = 1e9 + 7, N = 1e5 + 10, M = 1e5, LOG = 18;
const ll INF = 1e18 + 10;
void decode(int n, int m, int a[])
{
    vector<int> ans(n);
    REP(i,m){
        int idx = (MASK(6) - 1) & (a[i] >> 3), b = (MASK(3) - 1) & a[i];
        ans[idx] += MASK(b);
    }
    REP(i,n)output(ans[i]);
}
#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...