Submission #576296

#	Time	Username	Problem	Language	Result	Execution time	Memory
576296		zaneyu	저장 (Saveit) (IOI10_saveit)	C++14	25 / 100	258 ms	13360 KiB

encoder

#include "grader.h"
#include "encoder.h"

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
namespace {
vector<int> v[1005];
int dist[1005];
void send(int x){
    REP(i,10){
        encode_bit((x>>(9-i))&1);
    }
}
}
void encode(int nv, int nh, int ne, int *v1, int *v2){
    REP(i,ne){
        v[v1[i]].pb(v2[i]);
        v[v2[i]].pb(v1[i]);
    }
    vector<pii> eds;
    REP(i,nh){
        REP(j,nv) dist[j]=1e9;
        dist[i]=0;
        queue<int> q;
        q.push(i);
        while(sz(q)){
            int z=q.front();
            q.pop();
            for(int x:v[z]){
                if(dist[x]>dist[z]+1){
                    if(x>z) eds.pb({x,z});
                    else eds.pb({z,x});
                    dist[x]=dist[z]+1;
                    q.push(x);
                }
            }
        }
    }
    SORT_UNIQUE(eds);
    send(sz(eds)/1024),send(sz(eds)%1024);
    for(auto x:eds){
        send(x.f),send(x.s);
    }
}

decoder

#include "grader.h"
#include "decoder.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
namespace {
int get(){
    int x=0;
    REP(i,10){
        x=x*2+decode_bit();
    }
    return x;
}
vector<int> v[1005];
int dist[1005];
}
void decode(int nv, int nh) {
    int len=get()*1024+get();
    REP(i,len){
        int a=get(),b=get();
        v[a].pb(b);
        v[b].pb(a);
    }
    REP(i,nh){
        REP(j,nv) dist[j]=1e9;
        dist[i]=0;
        queue<int> q;
        q.push(i);
        while(sz(q)){
            int z=q.front();
            q.pop();
            for(int x:v[z]){
                if(dist[x]>dist[z]+1){
                    dist[x]=dist[z]+1;
                    q.push(x);
                }
            }
        }
        REP(j,nv) hops(i,j,dist[j]); 
    }
}

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