Submission #685249

#	Time	Username	Problem	Language	Result	Execution time	Memory
685249		Khizri	Parrots (IOI11_parrots)	C++17	81 / 100	4 ms	1164 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
void encode(int n, int arr[])
{
    int x=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<8;j++){
            if(arr[i]&(1<<j)){
                send(x);
            }
            x++;
        }
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
void decode(int n, int l, int arr[])
{
    vector<vector<int>>vt(n,vector<int>(8));
    for(int i=0;i<l;i++){
        int idx=0;
        for(int j=0;j<8;j++){
            if(arr[i]&(1<<j)){
                idx+=(1<<j);
            }
        }
        int id=idx/8;
        int id2=idx-(idx/8)*8;
        vt[id][id2]=1;
    }
    for(int i=0;i<n;i++){
        int ans=0;
        for(int j=0;j<vt[i].size();j++){
            if(vt[i][j]){
                ans+=(1<<j);
            }
        }
        output(ans);
    }

}

Compilation message (stderr)

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int j=0;j<vt[i].size();j++){
      |                     ~^~~~~~~~~~~~~

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