Submission #1140274

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140274		leo_2727	Parrots (IOI11_parrots)	C++20	34 / 100	0 ms	840 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

void encode(int n, int m[]){
    for(int i=0;i<n;i++){
        int num=i;
        for(int j=0;j<=8;j++)
            if(1<<j & m[i])    num|=(1<<(j+5));
        send(num);
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

void decode(int n, int l, int x[]){
    vi ans(n, 0);
    for(int i=0;i<l;i++){
        int pos=0, val=0;
        for(int j=0;j<=4;j++)
            if(1<<j & x[i]) pos |= 1<<j;
        for(int j=0;j<=8;j++)
            if(1<<(j+5) & x[i])    val |= 1<<j;
        ans[pos]=val;
    }
    for(int i=0;i<n;i++)    output(ans[i]);
}

• Subtask 1: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 29
• Subtask 5: 0 / 19