제출 #784395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
784395		irmuun	저장 (Saveit) (IOI10_saveit)	C++17	0 / 100	154 ms	4624 KiB

encoder

#include<bits/stdc++.h>
#include "grader.h"
#include "encoder.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

void encode(int H,int N,int P,int *A,int *B){
    vector<int>adj[N];
    for(int i=0;i<P;i++){
        adj[A[i]].pb(B[i]);
        adj[B[i]].pb(A[i]);
    }
    int d[N];
    for(int i=0;i<H;i++){
        fill(d,d+N,-1);
        queue<int>q;
        d[i]=0;
        q.push(i);
        while(!q.empty()){
            int x=q.front();
            q.pop();
            for(auto y:adj[x]){
                if(d[y]==-1){
                    d[y]=d[x]+1;
                    q.push(y);
                }
            }
        }
        for(int j=0;j<N;j++){
            for(int k=0;k<10;k++){
                encode_bit(d[j]%2);
                d[j]/=2;
            }
        }
    }
}

decoder

#include<bits/stdc++.h>
#include "grader.h"
#include "decoder.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

void decode(int H,int N){
    for(int i=0;i<H;i++){
        for(int j=0;j<N;j++){
            int ans=0;
            for(int k=0;k<10;k++){
                ans+=decode_bit()*(1<<k);
            }
            hops(i,j,ans);
        }
    }
}

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