제출 #565054

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

encoder

#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
#include "encoder.h"
 
void encode(int n,int h,int p,int a[],int b[]) {  
  int grid[n][n];
  for (int i=0;i<n;i++) {
    for (int j=0;j<n;j++) {
        grid[i][j]=1e9;
    }
    grid[i][i]=0;
  }
  for (int i=0;i<p;i++) {
    grid[a[i]][b[i]]=1;
    grid[b[i]][a[i]]=1;
    grid[i][i]=0;
  }
 
  for (int k=0;k<n;k++) 
    for (int i=0;i<n;i++) {
      for (int j=0;j<n;j++) {
        grid[i][j]=min(grid[i][j],grid[i][k]+grid[k][j]);
      }
    }
 
  for (int i=0;i<h;i++) {
    for (int j=0;j<n;j++) {
      int nm=grid[i][j];
      for (int pp=0;pp<10;pp++) {
        if (((1<<pp)&nm)==(1<<pp)) encode_bit(1);
        else encode_bit(0);
      }
    }
  }
}

decoder

#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
#include "encoder.h"
 
void decode(int n,int h) {
  for (int i=0;i<h;i++) {
    for (int j=0;j<n;j++) {
      int nm=0,t=0;
      while (t<10) {
      if (decode_bit()==1) nm+=(1<<t);
      t++;
      }
      hops(i,j,nm);
    }
  }
  
}

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