oj.uz

Submission #896501

# Submission time Handle Problem Language Result Execution time Memory
896501 2024-01-01T15:00:04 Z anton Parrots (IOI11_parrots) C++17
96 / 100
 7 ms 1824 KB 
#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>

using namespace std;
#define ll long long


void encode(int N, int M[])
{
    if(N>32){
        vector<int> mes(N);

        vector<int> tb;
        for(int i = 0; i<256; i++){
            if(bitset<8>(i).count() ==4){
                tb.push_back(i);
            }
        }
        for(int i =0; i<N; i++){
            mes[i] = M[i]^(tb[i%tb.size()]);
        }
        
        int id = 0;
        for(int i=0; i<N; i++){
            for(int j = 0; j<8; j+=2){
                int oc = (mes[i] & (3<<j))>>j;
                for(int k = 0; k<oc; k++){
                    send(id);
                }
                id++;
            }
        }
    }
    else{
        int id = 0;
        for(int i=0; i<N; i++){
            for(int j = 0; j<8; j++){
                if((M[i] & (1<<j))!=0){
                    send(id);
                }
                id++;
            }

        }
    }

}

#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>

using namespace std;

void decode(int N, int L, int X[])
{
    if(N<=32){
                vector<int> v(L);

        for(int i = 0; i<L; i++){
            v[i] = X[i];
        }
        sort(v.begin(), v.end());
        vector<int> res(N);
        bool swaping = false;
        for(int i = 0; i<L; i++){
            if(i>0 && v[i]==v[i-1]){
            swaping = true;
            }
            res[v[i]/8]^=(1<<(v[i]%8));
        }
        for(auto e: res){
            //cout<<bitset<8>(e)<<endl;
        }

        if(swaping){
            //cout<<"swapping"<<endl;
            for(int i = 0; i<N; i++){
            res[i] ^= (1<<8)-1;
            }
        }

        for(auto e: res){
            //cout<<e<<endl;
        }

        for(auto e: res){
            output(e);
        }
    }
    else{
        ////cout<<"L "<<L<<endl;
        vector<int> v(L);

        for(int i = 0; i<L; i++){
            v[i] = X[i];
        }
        sort(v.begin(), v.end());
        reverse(v.begin(), v.end());
        vector<int> res(N);
        for(int pos = 0; pos<N*4; pos++){
            int oc= 0;
            while(v.size()>0 && v.back() == pos){
                oc++;
                v.pop_back();
            }
            //cout<<bitset<8>(oc<<((2*pos)%8));
            res[pos/4] ^= (oc<<((2*pos)%8));
        }

        vector<int> tb;
        for(int i = 0; i<256; i++){
            if(bitset<8>(i).count() ==4){
                tb.push_back(i);
            }
        }

        for(int i = 0; i<N; i++){
            res[i] = res[i]^tb[i%tb.size()];
        }

        for(auto e: res){
            output(e);
        }
    }
}

Compilation message

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:24:18: warning: unused variable 'e' [-Wunused-variable]
   24 |         for(auto e: res){
      |                  ^
decoder.cpp:35:18: warning: unused variable 'e' [-Wunused-variable]
   35 |         for(auto e: res){
      |                  ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 796 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 1 ms 1316 KB Output is correct
4 Correct 1 ms 1320 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1316 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 1 ms 1320 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1824 KB Output is correct
3 Correct 2 ms 1572 KB Output is correct
4 Correct 3 ms 1324 KB Output is correct
5 Correct 3 ms 1320 KB Output is correct
6 Correct 3 ms 1336 KB Output is correct

Subtask #5
15.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 1312 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1328 KB Output is partially correct - P = 8.000000
3 Partially correct 3 ms 1344 KB Output is partially correct - P = 7.424242
4 Partially correct 6 ms 1460 KB Output is partially correct - P = 6.540000
5 Partially correct 7 ms 1372 KB Output is partially correct - P = 6.716667
6 Partially correct 6 ms 1384 KB Output is partially correct - P = 6.380952
7 Partially correct 7 ms 1424 KB Output is partially correct - P = 6.437500