oj.uz

답안 #741864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741864 2023-05-15T02:41:15 Z Joshua_Andersson 저장 (Saveit) (IOI10_saveit) C++14
100 / 100
 309 ms 14452 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("E:\\desktop\\code\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\Release\\in.txt");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && (!FILE_TC || !_LOCAL)
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0}, {0,0} };

#include "grader.h"
#include "encoder.h"

int numbits = 10;




void send(ll v, int padding)
{
    rep(i, padding)
    {
        encode_bit(v & 1);
        v >>= 1;
    }
}

int tov(int x)
{
    if (x == 0) return 0;
    if (x == 1) return 1;
    if (x == -1) return 2;
}

ll tov(vvi& dist, int a, int b)
{
    ll ret = 0;

    rep(i, dist.size())
    {
        //cout << a << " " << b << "[" << i << "] = " << dist[i][a] - dist[i][b] << "\n";
        ret += tov(dist[i][a] - dist[i][b]);
        if (i != dist.size() - 1)ret *= 3;
    }

    return ret;

}

vector<pair<int, ll>> tosendnode;
void dfs(int u, int p, vi& vis, vvi& dist, vvi& edges)
{
    if (vis[u]) return;
    vis[u] = 1;

    if (p != -1)
    {
        ll v = tov(dist, u, p);
        tosendnode[u] = { p, v };
    }
    repe(e, edges[u])
    {
        dfs(e, u, vis, dist, edges);
    }
}

void encode(int n, int h, int m, int* v1, int* v2)
{
    vvi edges(n);
    rep(i, m)
    {
        int a = v1[i];
        int b = v2[i];
        edges[a].push_back(b);
        edges[b].push_back(a);

    }

    vvi dist(h, vi(n, inf));
    rep(i, h)
    {
        queue<p2> q;
        vi vis(n);
        q.emplace(i, 0);

        while (q.size())
        {
            int u, d;
            tie(u, d) = q.front();
            q.pop();

            if (vis[u]) continue;
            vis[u] = 1;
            dist[i][u] = d;

            repe(e, edges[u])
            {
                q.emplace(e, d + 1);
            }
        }
    }

    vi vis(n);
    rep(i, h)
    {
        send(dist[0][i], numbits);
    }
    tosendnode.resize(n);
    dfs(0, -1, vis, dist, edges);
    repp(i, 1, n)
    {
        send(tosendnode[i].first, 10);
        send(tosendnode[i].second, 58);
    }
}
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("E:\\desktop\\code\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\Release\\in.txt");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && (!FILE_TC || !_LOCAL)
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0}, {0,0} };

#include "grader.h"
#include "decoder.h"

int numbits = 10;



ll readb(int cnt)
{
    ll ret = 0;

    vi x;
    rep(i, cnt)
    {
        x.push_back(decode_bit());
    }
    reverse(all(x));

    rep(i, cnt)
    {
        ret += x[i];
        if (i != cnt - 1) ret <<= 1;
    }

    return ret;
}

int getv(int x)
{
    if (x == 0) return 0;
    if (x == 1) return 1;
    if (x == 2) return -1;
}

void dfs2(int u, int p, vvi& diffs, vi& dist, vvi& edges)
{
    if (u != 0)
    {
        rep(i, dist.size())
        {
            dist[i] += diffs[u][i];
            hops(i, u, dist[i]);
        }
    }

    repe(e, edges[u])
    {
        if (e == p) continue;
        dfs2(e, u, diffs, dist, edges);
    }

    if (u != 0)
    {
        rep(i, dist.size())
        {
            dist[i] -= diffs[u][i];
        }
    }

}

void decode(int n, int h) {
    vi dist(h);
    rep(i, h)
    {
        dist[i] = readb(numbits);
        hops(i, 0, dist[i]);
    }

    vvi edges(n);
    vvi diffs(n);
    repp(i, 1, n)
    {
        int b = readb(numbits);
        edges[i].push_back(b);
        edges[b].push_back(i);
        vi diff;
        ll v = readb(58);
        rep(i, h)
        {
            diff.push_back(getv(v % 3));
            v /= 3;
        }
        reverse(all(diff));
        diffs[i] = diff;
    }

    dfs2(0, 0, diffs, dist, edges);

}

Compilation message

encoder.cpp: In function 'll tov(vvi&, int, int)':
encoder.cpp:122:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 | #define rep(i, high) for (int i = 0; i < high; i++)
......
  187 |     rep(i, dist.size())
      |         ~~~~~~~~~~~~~~                  
encoder.cpp:187:5: note: in expansion of macro 'rep'
  187 |     rep(i, dist.size())
      |     ^~~
encoder.cpp:191:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  191 |         if (i != dist.size() - 1)ret *= 3;
      |             ~~^~~~~~~~~~~~~~~~~~
encoder.cpp: In function 'int tov(int)':
encoder.cpp:181:1: warning: control reaches end of non-void function [-Wreturn-type]
  181 | }
      | ^

decoder.cpp: In function 'void dfs2(int, int, vvi&, vi&, vvi&)':
decoder.cpp:122:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 | #define rep(i, high) for (int i = 0; i < high; i++)
......
  197 |         rep(i, dist.size())
      |             ~~~~~~~~~~~~~~              
decoder.cpp:197:9: note: in expansion of macro 'rep'
  197 |         rep(i, dist.size())
      |         ^~~
decoder.cpp:122:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 | #define rep(i, high) for (int i = 0; i < high; i++)
......
  212 |         rep(i, dist.size())
      |             ~~~~~~~~~~~~~~              
decoder.cpp:212:9: note: in expansion of macro 'rep'
  212 |         rep(i, dist.size())
      |         ^~~
decoder.cpp: In function 'int getv(int)':
decoder.cpp:191:1: warning: control reaches end of non-void function [-Wreturn-type]
  191 | }
      | ^

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 14452 KB Output is correct - 68292 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 302 call(s) of encode_bit()
3 Correct 22 ms 5736 KB Output is correct - 61492 call(s) of encode_bit()
4 Correct 3 ms 4608 KB Output is correct - 322 call(s) of encode_bit()
5 Correct 24 ms 5916 KB Output is correct - 61492 call(s) of encode_bit()
6 Correct 34 ms 6072 KB Output is correct - 68292 call(s) of encode_bit()
7 Correct 54 ms 6360 KB Output is correct - 68292 call(s) of encode_bit()
8 Correct 19 ms 5884 KB Output is correct - 65640 call(s) of encode_bit()
9 Correct 25 ms 5796 KB Output is correct - 68292 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is correct - 68292 call(s) of encode_bit()
11 Correct 30 ms 6168 KB Output is correct - 68292 call(s) of encode_bit()
12 Correct 24 ms 5844 KB Output is correct - 68292 call(s) of encode_bit()
13 Correct 63 ms 6760 KB Output is correct - 68292 call(s) of encode_bit()
14 Correct 26 ms 5864 KB Output is correct - 68292 call(s) of encode_bit()
15 Correct 24 ms 6056 KB Output is correct - 68292 call(s) of encode_bit()
16 Correct 71 ms 6680 KB Output is correct - 68292 call(s) of encode_bit()
17 Correct 49 ms 6468 KB Output is correct - 68292 call(s) of encode_bit()
18 Correct 71 ms 6900 KB Output is correct - 68292 call(s) of encode_bit()
19 Correct 37 ms 6428 KB Output is correct - 68292 call(s) of encode_bit()
20 Correct 72 ms 7320 KB Output is correct - 68292 call(s) of encode_bit()
21 Correct 71 ms 7652 KB Output is correct - 68292 call(s) of encode_bit()
22 Correct 49 ms 6820 KB Output is correct - 68292 call(s) of encode_bit()
23 Correct 93 ms 7920 KB Output is correct - 68292 call(s) of encode_bit()

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 14452 KB Output is correct - 68292 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 302 call(s) of encode_bit()
3 Correct 22 ms 5736 KB Output is correct - 61492 call(s) of encode_bit()
4 Correct 3 ms 4608 KB Output is correct - 322 call(s) of encode_bit()
5 Correct 24 ms 5916 KB Output is correct - 61492 call(s) of encode_bit()
6 Correct 34 ms 6072 KB Output is correct - 68292 call(s) of encode_bit()
7 Correct 54 ms 6360 KB Output is correct - 68292 call(s) of encode_bit()
8 Correct 19 ms 5884 KB Output is correct - 65640 call(s) of encode_bit()
9 Correct 25 ms 5796 KB Output is correct - 68292 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is correct - 68292 call(s) of encode_bit()
11 Correct 30 ms 6168 KB Output is correct - 68292 call(s) of encode_bit()
12 Correct 24 ms 5844 KB Output is correct - 68292 call(s) of encode_bit()
13 Correct 63 ms 6760 KB Output is correct - 68292 call(s) of encode_bit()
14 Correct 26 ms 5864 KB Output is correct - 68292 call(s) of encode_bit()
15 Correct 24 ms 6056 KB Output is correct - 68292 call(s) of encode_bit()
16 Correct 71 ms 6680 KB Output is correct - 68292 call(s) of encode_bit()
17 Correct 49 ms 6468 KB Output is correct - 68292 call(s) of encode_bit()
18 Correct 71 ms 6900 KB Output is correct - 68292 call(s) of encode_bit()
19 Correct 37 ms 6428 KB Output is correct - 68292 call(s) of encode_bit()
20 Correct 72 ms 7320 KB Output is correct - 68292 call(s) of encode_bit()
21 Correct 71 ms 7652 KB Output is correct - 68292 call(s) of encode_bit()
22 Correct 49 ms 6820 KB Output is correct - 68292 call(s) of encode_bit()
23 Correct 93 ms 7920 KB Output is correct - 68292 call(s) of encode_bit()

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 14452 KB Output is correct - 68292 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 302 call(s) of encode_bit()
3 Correct 22 ms 5736 KB Output is correct - 61492 call(s) of encode_bit()
4 Correct 3 ms 4608 KB Output is correct - 322 call(s) of encode_bit()
5 Correct 24 ms 5916 KB Output is correct - 61492 call(s) of encode_bit()
6 Correct 34 ms 6072 KB Output is correct - 68292 call(s) of encode_bit()
7 Correct 54 ms 6360 KB Output is correct - 68292 call(s) of encode_bit()
8 Correct 19 ms 5884 KB Output is correct - 65640 call(s) of encode_bit()
9 Correct 25 ms 5796 KB Output is correct - 68292 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is correct - 68292 call(s) of encode_bit()
11 Correct 30 ms 6168 KB Output is correct - 68292 call(s) of encode_bit()
12 Correct 24 ms 5844 KB Output is correct - 68292 call(s) of encode_bit()
13 Correct 63 ms 6760 KB Output is correct - 68292 call(s) of encode_bit()
14 Correct 26 ms 5864 KB Output is correct - 68292 call(s) of encode_bit()
15 Correct 24 ms 6056 KB Output is correct - 68292 call(s) of encode_bit()
16 Correct 71 ms 6680 KB Output is correct - 68292 call(s) of encode_bit()
17 Correct 49 ms 6468 KB Output is correct - 68292 call(s) of encode_bit()
18 Correct 71 ms 6900 KB Output is correct - 68292 call(s) of encode_bit()
19 Correct 37 ms 6428 KB Output is correct - 68292 call(s) of encode_bit()
20 Correct 72 ms 7320 KB Output is correct - 68292 call(s) of encode_bit()
21 Correct 71 ms 7652 KB Output is correct - 68292 call(s) of encode_bit()
22 Correct 49 ms 6820 KB Output is correct - 68292 call(s) of encode_bit()
23 Correct 93 ms 7920 KB Output is correct - 68292 call(s) of encode_bit()

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 14452 KB Output is correct - 68292 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 302 call(s) of encode_bit()
3 Correct 22 ms 5736 KB Output is correct - 61492 call(s) of encode_bit()
4 Correct 3 ms 4608 KB Output is correct - 322 call(s) of encode_bit()
5 Correct 24 ms 5916 KB Output is correct - 61492 call(s) of encode_bit()
6 Correct 34 ms 6072 KB Output is correct - 68292 call(s) of encode_bit()
7 Correct 54 ms 6360 KB Output is correct - 68292 call(s) of encode_bit()
8 Correct 19 ms 5884 KB Output is correct - 65640 call(s) of encode_bit()
9 Correct 25 ms 5796 KB Output is correct - 68292 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is correct - 68292 call(s) of encode_bit()
11 Correct 30 ms 6168 KB Output is correct - 68292 call(s) of encode_bit()
12 Correct 24 ms 5844 KB Output is correct - 68292 call(s) of encode_bit()
13 Correct 63 ms 6760 KB Output is correct - 68292 call(s) of encode_bit()
14 Correct 26 ms 5864 KB Output is correct - 68292 call(s) of encode_bit()
15 Correct 24 ms 6056 KB Output is correct - 68292 call(s) of encode_bit()
16 Correct 71 ms 6680 KB Output is correct - 68292 call(s) of encode_bit()
17 Correct 49 ms 6468 KB Output is correct - 68292 call(s) of encode_bit()
18 Correct 71 ms 6900 KB Output is correct - 68292 call(s) of encode_bit()
19 Correct 37 ms 6428 KB Output is correct - 68292 call(s) of encode_bit()
20 Correct 72 ms 7320 KB Output is correct - 68292 call(s) of encode_bit()
21 Correct 71 ms 7652 KB Output is correct - 68292 call(s) of encode_bit()
22 Correct 49 ms 6820 KB Output is correct - 68292 call(s) of encode_bit()
23 Correct 93 ms 7920 KB Output is correct - 68292 call(s) of encode_bit()