제출 #565091

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565091		Uzouf	저장 (Saveit) (IOI10_saveit)	C++14	50 / 100	1266 ms	13412 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[1005][1005];
  for (int i=0;i<n;i++) {
    for (int j=0;j<n;j++) {
        grid[i][j]=2000;
    }
    grid[i][i]=0;
  }
  for (int i=0;i<p;i++) {
    grid[a[i]][b[i]]=1;
    grid[b[i]][a[i]]=1;
  }
 
  for (int k=0;k<n;k++) 
    for (int i=0;i<n;i++) {
      for (int j=0;j<n;j++) {
        int tmp=grid[i][k]+grid[k][j];
        if (i!=j && grid[i][j]>tmp) grid[i][j]=tmp;
      }
    }
 
  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)==0) encode_bit(0);
        else encode_bit(1);
      }
    }
  }
}

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;
      for (int p=0;p<10;p++) {
        nm+=((1<<p)*decode_bit());
      }
      hops(i,j,nm);
    }
  }
  
}

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