Submission #1369339

#TimeUsernameProblemLanguageResultExecution timeMemory
1369339eyadoozParrots (IOI11_parrots)C++20
81 / 100
1 ms836 KiB
#include<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'

// void send(int x) {
//   cout << x << " ";
// }
void encode(int N, int M[]) {
    for(int i = 0;i < N;i++) {
        int f=M[i];
        for(int j=0;j<=8;j++) {
            if((1ll<<j)&f) send(8*i+j);
        }
    }
}

// int main() {
//     int M[]={6, 6, 1, 8, 4};
//     encode(5, M); 
// }
#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'

// void output(int x) {
//     cout << x <<  " ";
// }
void decode(int N, int L, int X[]) {
    vector<int> ans(N, 0);
    for(int i = 0;i < L;i++) ans[X[i]/8]+=((1ll<<(X[i]%8)));
    for(auto i : ans) output(i);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...