oj.uz

답안 #741837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741837 2023-05-15T01:32:03 Z Joshua_Andersson 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 300 ms 13836 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())
    {
        ret += tov(dist[i][a] - dist[i][b]);
        if (i != dist.size() - 1)ret *= 3;
    }

    return ret;

}

void dfs(int u, int p, vi& vis, vvi& dist, vvi& edges)
{
    if (vis[u]) return;
    vis[u] = 1;

    if (p != -1)
    {
        send(1, 1);
        send(u, numbits);


        send(tov(dist, u, p), 58);
    }
    repe(e, edges[u])
    {
        dfs(e, u, vis, dist, edges);
    }


    send(0, 1);
}

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);
    }
    dfs(0, -1, vis, dist, edges);
}

#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)
{
    int 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 decode(int n, int h) {
    vi dist(h);
    rep(i, h)
    {
        dist[i] = readb(numbits);
        hops(i, 0, dist[i]);
    }

    stack<vi> diffs;
    while (1)
    {
        if (readb(1))
        {
            int u = readb(numbits);
            vi diff;
            ll v = readb(58);
            rep(i, h)
            {
                diff.push_back(getv(v % 3));
                v /= 3;
            }
            reverse(all(diff));
            diffs.push(diff);
            rep(i, h)
            {
                dist[i] += diff[i];
                hops(i, u, dist[i]);
            }
        }
        else
        {
            if (diffs.empty()) break;
            vi diff = diffs.top();
            diffs.pop();
            rep(i, h)
            {
                dist[i] -= diff[i];
            }
        }
    }
}

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++)
......
  185 |     rep(i, dist.size())
      |         ~~~~~~~~~~~~~~                  
encoder.cpp:185:5: note: in expansion of macro 'rep'
  185 |     rep(i, dist.size())
      |     ^~~
encoder.cpp:188:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  188 |         if (i != dist.size() - 1)ret *= 3;
      |             ~~^~~~~~~~~~~~~~~~~~
encoder.cpp: In function 'int tov(int)':
encoder.cpp:179:1: warning: control reaches end of non-void function [-Wreturn-type]
  179 | }
      | ^

decoder.cpp: In function 'int getv(int)':
decoder.cpp:190:1: warning: control reaches end of non-void function [-Wreturn-type]
  190 | }
      | ^

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 13836 KB wrong parameter
2 Correct 2 ms 4604 KB Output is correct - 311 call(s) of encode_bit()
3 Incorrect 18 ms 5500 KB wrong parameter
4 Correct 2 ms 4616 KB Output is correct - 331 call(s) of encode_bit()
5 Incorrect 24 ms 5796 KB wrong parameter
6 Incorrect 22 ms 5808 KB wrong parameter
7 Incorrect 41 ms 6184 KB wrong parameter
8 Incorrect 19 ms 5476 KB wrong parameter
9 Incorrect 20 ms 5568 KB wrong parameter
10 Incorrect 23 ms 5500 KB wrong parameter
11 Incorrect 22 ms 5828 KB wrong parameter
12 Incorrect 17 ms 5408 KB wrong parameter
13 Incorrect 53 ms 6372 KB wrong parameter
14 Incorrect 18 ms 5596 KB wrong parameter
15 Incorrect 19 ms 5756 KB wrong parameter
16 Incorrect 46 ms 6280 KB wrong parameter
17 Incorrect 51 ms 6072 KB wrong parameter
18 Incorrect 57 ms 6624 KB wrong parameter
19 Incorrect 39 ms 5952 KB wrong parameter
20 Incorrect 72 ms 7068 KB wrong parameter
21 Incorrect 81 ms 7276 KB wrong parameter
22 Incorrect 53 ms 6356 KB wrong parameter
23 Incorrect 80 ms 7592 KB wrong parameter

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 13836 KB wrong parameter
2 Correct 2 ms 4604 KB Output is correct - 311 call(s) of encode_bit()
3 Incorrect 18 ms 5500 KB wrong parameter
4 Correct 2 ms 4616 KB Output is correct - 331 call(s) of encode_bit()
5 Incorrect 24 ms 5796 KB wrong parameter
6 Incorrect 22 ms 5808 KB wrong parameter
7 Incorrect 41 ms 6184 KB wrong parameter
8 Incorrect 19 ms 5476 KB wrong parameter
9 Incorrect 20 ms 5568 KB wrong parameter
10 Incorrect 23 ms 5500 KB wrong parameter
11 Incorrect 22 ms 5828 KB wrong parameter
12 Incorrect 17 ms 5408 KB wrong parameter
13 Incorrect 53 ms 6372 KB wrong parameter
14 Incorrect 18 ms 5596 KB wrong parameter
15 Incorrect 19 ms 5756 KB wrong parameter
16 Incorrect 46 ms 6280 KB wrong parameter
17 Incorrect 51 ms 6072 KB wrong parameter
18 Incorrect 57 ms 6624 KB wrong parameter
19 Incorrect 39 ms 5952 KB wrong parameter
20 Incorrect 72 ms 7068 KB wrong parameter
21 Incorrect 81 ms 7276 KB wrong parameter
22 Incorrect 53 ms 6356 KB wrong parameter
23 Incorrect 80 ms 7592 KB wrong parameter

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 13836 KB wrong parameter
2 Correct 2 ms 4604 KB Output is correct - 311 call(s) of encode_bit()
3 Incorrect 18 ms 5500 KB wrong parameter
4 Correct 2 ms 4616 KB Output is correct - 331 call(s) of encode_bit()
5 Incorrect 24 ms 5796 KB wrong parameter
6 Incorrect 22 ms 5808 KB wrong parameter
7 Incorrect 41 ms 6184 KB wrong parameter
8 Incorrect 19 ms 5476 KB wrong parameter
9 Incorrect 20 ms 5568 KB wrong parameter
10 Incorrect 23 ms 5500 KB wrong parameter
11 Incorrect 22 ms 5828 KB wrong parameter
12 Incorrect 17 ms 5408 KB wrong parameter
13 Incorrect 53 ms 6372 KB wrong parameter
14 Incorrect 18 ms 5596 KB wrong parameter
15 Incorrect 19 ms 5756 KB wrong parameter
16 Incorrect 46 ms 6280 KB wrong parameter
17 Incorrect 51 ms 6072 KB wrong parameter
18 Incorrect 57 ms 6624 KB wrong parameter
19 Incorrect 39 ms 5952 KB wrong parameter
20 Incorrect 72 ms 7068 KB wrong parameter
21 Incorrect 81 ms 7276 KB wrong parameter
22 Incorrect 53 ms 6356 KB wrong parameter
23 Incorrect 80 ms 7592 KB wrong parameter

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 13836 KB wrong parameter
2 Correct 2 ms 4604 KB Output is correct - 311 call(s) of encode_bit()
3 Incorrect 18 ms 5500 KB wrong parameter
4 Correct 2 ms 4616 KB Output is correct - 331 call(s) of encode_bit()
5 Incorrect 24 ms 5796 KB wrong parameter
6 Incorrect 22 ms 5808 KB wrong parameter
7 Incorrect 41 ms 6184 KB wrong parameter
8 Incorrect 19 ms 5476 KB wrong parameter
9 Incorrect 20 ms 5568 KB wrong parameter
10 Incorrect 23 ms 5500 KB wrong parameter
11 Incorrect 22 ms 5828 KB wrong parameter
12 Incorrect 17 ms 5408 KB wrong parameter
13 Incorrect 53 ms 6372 KB wrong parameter
14 Incorrect 18 ms 5596 KB wrong parameter
15 Incorrect 19 ms 5756 KB wrong parameter
16 Incorrect 46 ms 6280 KB wrong parameter
17 Incorrect 51 ms 6072 KB wrong parameter
18 Incorrect 57 ms 6624 KB wrong parameter
19 Incorrect 39 ms 5952 KB wrong parameter
20 Incorrect 72 ms 7068 KB wrong parameter
21 Incorrect 81 ms 7276 KB wrong parameter
22 Incorrect 53 ms 6356 KB wrong parameter
23 Incorrect 80 ms 7592 KB wrong parameter