oj.uz

Submission #959962

# Submission time Handle Problem Language Result Execution time Memory
959962 2024-04-09T11:19:34 Z GrindMachine Parrots (IOI11_parrots) C++17
24 / 100
 8 ms 1392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "encoder.h"
#include "encoderlib.h"

void encode(int n, int a[])
{
    rep(i,n){
        int x = a[i];
        rep(bit,4){
            int f1 = 1<<bit, f2 = 1<<(bit+4);
            int b1 = 0, b2 = 0;
            if(x&f1) b1 = 1;
            if(x&f2) b2 = 1;
            int times = b1|(b2<<1);
            int val = i*4+bit;
            rep(j,times){
                send(val);
            }
        }
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "decoder.h"
#include "decoderlib.h"

void decode(int n, int m, int X[])
{
    vector<int> cnt(n*4);
    rep(i,m){
        cnt[X[i]]++;
    }

    vector<int> a(n);
    rep(i,n*4){
        int c = cnt[i];
        if(!c) conts;
        int ind = i/4, bit = i%4;
        int f1 = 1<<bit, f2 = 1<<(bit+4);
        if(c&1){
            a[ind] |= f1;
        }
        if(c&2){
            a[ind] |= f2;
        }
    }

    rep(i,n){
        output(a[i]);
    }
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 784 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 784 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 796 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 1324 KB partially correct P=12.000000
2 Partially correct 3 ms 1340 KB partially correct P=12.000000
3 Partially correct 3 ms 1344 KB partially correct P=12.000000
4 Partially correct 6 ms 1364 KB partially correct P=12.000000
5 Partially correct 6 ms 1372 KB partially correct P=12.000000
6 Partially correct 6 ms 1372 KB partially correct P=12.000000
7 Partially correct 8 ms 1392 KB partially correct P=12.000000