제출 #718861

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

encoder

#include "grader.h"
#include "encoder.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n;
int par[maxn];
int d[36][maxn];
vector <int> adj[maxn];

void bfs(int rt, bool keep)
{
    queue<int> q;
    fill_n(d[rt],n,-1);
    d[rt][rt] = 0;
    q.push(rt);
    if (keep) par[rt] = rt;
    while (!q.empty())
    {
        int u=q.front(); q.pop();
        for (int v:adj[u])
            if (d[rt][v] == -1)
        {
            d[rt][v] = d[rt][u] + 1;
            if (keep) par[v] = u;
            q.push(v);
        }
    }
}

inline bool checkbit(int i, int j)
{
    return i>>j&1;
}

void encode(int nv, int nh, int ne, int *v1, int *v2){
    n=nv;
    for (int i=0; i<n; i++) adj[i].clear();
    for (int i=0; i<ne; i++)
    {
        int u=v1[i]; int v=v2[i];
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i=0; i<nh; i++) bfs(i,(i==0));
    for (int i=0; i<n; i++)
        for (int j=0; j<10; j++)
            encode_bit(checkbit(par[i],j));
    par[n]=par[n+1]=par[n+2]=0;
    for (int rt=1; rt<nh; rt++)
        for (int i=1; i<n; i+=3)
    {
        int u,v;
        u=i; v=par[i];
        int t1 = (d[rt][u]==d[rt][v])?0:((d[rt][u]>d[rt][v])?1:2);
        u=i+1; v=par[i+1];
        int t2 = (d[rt][u]==d[rt][v])?0:((d[rt][u]>d[rt][v])?1:2);
        u=i+2; v=par[i+2];
        int t3 = (d[rt][u]==d[rt][v])?0:((d[rt][u]>d[rt][v])?1:2);
        int T = t1+t2*3+t3*9;
        for (int z=0; z<=5; z++) encode_bit(checkbit(T,z));
    }
}

decoder

#include "grader.h"
#include "decoder.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n,rt;
vector <int> adj[maxn];
int par[maxn];
int d[maxn],t[maxn],ans[maxn];
void BFS()
{
    queue<int> q;
    fill_n(d,n,-1);
    d[0] = 0;
    q.push(0);
    while (!q.empty())
    {
        int u=q.front(); q.pop();
        for (int v:adj[u])
            if (d[v]==-1)
        {
            d[v]=d[u]+1;
            q.push(v);
        }
    }
}
void dfs(int x, int p)
{
    for (int i:adj[x])
        if (i!=p)
    {
        if (t[i]==0) ans[i]=ans[x];
        else if (t[i]==1) ans[i]=ans[x]+1;
        else ans[i]=ans[x]-1;
        dfs(i,x);
    }
}
void decode(int nv, int nh) {
    n=nv; rt = 0;
    for (int i=0; i<n; i++)
    {
        int x=0;
        for (int j=0; j<10; j++) if (decode_bit()) x|=(1<<j);
        par[i] = x;
        adj[par[i]].push_back(x);
    }
    for (int i=0; i<n; i++) hops(rt,i,d[i]);
    for (int st = 1; st<nh; st++)
    {
        for (int i=1; i<n; i+=3)
        {
            int T = 0;
            for (int z=0; z<5; z++) if (decode_bit()) T |= (1<<z);
            int t1 = T%3; T/=3;
            int t2 = T%3; T/=3;
            int t3 = T%3; T/=3;
            t[i]=t1; t[i+1]=t2; t[i+2]=t3;
        }
        ans[0] = d[st];
        dfs(0,0);
        for (int i=0; i<n; i++) hops(st,i,ans[i]);
    }
}

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