제출 #565043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565043		AbdullahMW	저장 (Saveit) (IOI10_saveit)	C++14	0 / 100	1387 ms	262144 KiB

encoder

#include <bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
#define ll int
#define pb push_back
#define f first
#define s second

using namespace std;


vector <ll> gr[1005];
vector <pair <ll, ll>> bfs(ll xx)
{
    ll cnt = 0;
    vector <pair <ll, ll>> ret;
    queue <ll> q;
    unordered_map <ll, bool> vis;
    
    q.push(xx);
    ret.pb({xx, 0});
    vis[xx] = true;
    while (q.size())
    {
        ll x = q.front();
        q.pop();
        
        vis[x] = true;
        cnt++;
        for (auto v : gr[x])
        {
            if (!vis[v])
            {
                q.push(v);
                ret.pb({v, cnt});
            }
        }
    }
    
    return ret;
}

/*ll encode_bit(ll b)
{
    return b;
}*/

void encode(ll n, ll h, ll p, ll a[], ll b[])
{
    for (ll i = 0; i < p; i++)
    {
        gr[a[i]].pb(b[i]);
        gr[b[i]].pb(a[i]);
    }
    
    for (ll i = 0; i < h; i++)
    {
        vector <pair <ll, ll>> vec = bfs(i);
        sort(vec.begin(), vec.end());
        for (auto v : vec)
        {
            for (ll b = 0; b < 10; b++)
            {
                encode_bit((1 << b) & v.s);
            }
        }
    }
}

    

decoder

#include <bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
#define ll int
#define pb push_back
#define f first
#define s second

using namespace std;

/*ll decode_bit()
{
    return
}*/

/*ll hops(ll h, ll c, ll d)
{
    return d;
}*/

void decode(ll n, ll h)
{
    for (ll i = 0; i < h; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            ll d = 0;
            ll b = decode_bit();
            d += (1 << b);
            hops(i, j, d);
        }
    }
}


    

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25