제출 #520221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520221		new_acc	Saveit (IOI10_saveit)	C++14	100 / 100	205 ms	13368 KiB

encoder

#include<bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
#define fi first
#define se second
#define rep(a, b) for(int a = 0; a < (b); a++)
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=1e3+10;
vi graf[N];
int odl[N],oj[N];
int s[40][N];
bool vis[N];
ll pot[40];
void dfs(int v,int o){
	vis[v]=1;
	oj[v]=o;
	for(auto u:graf[v]){
		if(vis[u]) continue;
		dfs(u,v);	
	}
}
void bfs(int x,int n){
	rep(i,n) odl[i]=-1;
	deque<int> deq;
	odl[x]=0;
	deq.push_back(x);
	while(!deq.empty()){
		int v=deq.front();
		deq.pop_front();
		for(auto u:graf[v]) if(odl[u]==-1) deq.push_back(u),odl[u]=odl[v]+1;
	}
}
void encode(int n,int h,int p,int a[],int b[]){
	rep(i,p) graf[a[i]].push_back(b[i]),graf[b[i]].push_back(a[i]);
	dfs(0,0);
	rep(i,n){
		rep(j,10){
			if(oj[i]&(1<<j)) encode_bit(1);
			else encode_bit(0);
		}
	}
	rep(i,h){
		bfs(i,n);
		rep(j,n){
			if(odl[j]==odl[oj[j]]+1) s[i][j]=2;
			if(odl[j]==odl[oj[j]]) s[i][j]=1;
			if(odl[j]+1==odl[oj[j]]) s[i][j]=0;
		}
	}
	pot[0]=1;
	for(int i=1;i<36;i++) pot[i]=pot[i-1]*3;
	rep(i,n){
		ll ans=0;
		rep(j,h) ans+=pot[j]*s[j][i];
		rep(j,60){
			if((1LL<<j)&ans) encode_bit(1);
			else encode_bit(0);
		}
	}
}

decoder

#include<bits/stdc++.h>
#include "grader.h"
#include "decoder.h"
#define fi first
#define se second
#define rep(a, b) for(int a = 0; a < (b); a++)
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=1e3+10;
vi graf[N];
int odl[N],oj[N];
int s[40][N];
bool vis[N];
ll pot[40];
void decode(int n,int h){
	rep(i,n) graf[i].clear();
	rep(i,n){
		int x=0;
		rep(j,10){
			int xd=decode_bit();
			if(xd==1) x+=(1<<j);
		}
		graf[i].push_back(x),graf[x].push_back(i);
		oj[i]=x;
	}
	rep(i,n){
		ll ans=0;
		rep(j,60){
			int x=decode_bit();
			if(x==1) ans+=(1LL<<j);
		}
		rep(j,h){
			s[j][i]=ans%3;
			ans/=3;
		}
	}
	rep(i,h){
		deque<int> deq;
		deq.push_back(i);
		rep(j,n) vis[j]=0;
		odl[i]=0,vis[i]=1;
		while(!deq.empty()){
			int v=deq.front();
			deq.pop_front();
			if(vis[oj[v]]){
				if(s[i][v]==2) odl[v]=odl[oj[v]]+1;
				if(s[i][v]==1) odl[v]=odl[oj[v]];
				if(s[i][v]==0) odl[v]=odl[oj[v]]-1;
			}else{
				if(s[i][v]==2) odl[oj[v]]=odl[v]-1;
				if(s[i][v]==1) odl[oj[v]]=odl[v];
				if(s[i][v]==0) odl[oj[v]]=odl[v]+1;
			}
			for(auto u:graf[v]) if(!vis[u]) deq.push_back(u),vis[u]=1;
		}
		rep(j,n) hops(i,j,odl[j]);
	}
}

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