Submission #1369284

#TimeUsernameProblemLanguageResultExecution timeMemory
1369284eyadoozParrots (IOI11_parrots)C++20
34 / 100
2 ms1092 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 encode(int N, int M[]) {
    int freq[66666]={};
    for(int i = 0;i < N;i++) {
        for(int j=0;j<=i;j++) {
            send(M[i]+(freq[M[i]]*256));
        }   
        freq[M[i]]++;
    }
}
#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 decode(int N, int L, int X[]) {
    int freq[66666]={};
    for(int i = 0;i < L;i++) freq[X[i]]++;
    vector<int> ans(N);
    for(int i = 0;i < L;i++) ans[freq[X[i]]-1]=X[i]%256;
    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...