Submission #427268

#	Time	Username	Problem	Language	Result	Execution time	Memory
427268		tqbfjotld	City (JOI17_city)	C++14	18 / 100	1174 ms	59724 KiB

Encoder

#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;

int lch[500005];
int rch[500005];
int curnodes,n;
vector<int> adjl[250005];
double const1 = 0.9;
double const2 = 1.0;

double func(int node, int pa){
    set<pair<double,int> > stuff;
    for (auto x : adjl[node]){
        if (x==pa) continue;
        double res = func(x,node);
        stuff.insert({res,x});
    }
    while (stuff.size()>2){
        auto i1 = *stuff.begin();
        stuff.erase(stuff.begin());
        pair<double,int> thing = {-999.0,-1};
        auto it = stuff.lower_bound({i1.first+const1,-1});
        if (it!=stuff.end()){
            thing = (*it);
        }
        if (it!=stuff.begin()){
             it--;
             if (abs(thing.first-(i1.first+const1))>abs((*it).first-(i1.first+const1))){
                thing = *it;
             }
        }
        auto i2 = thing;
        stuff.erase(stuff.lower_bound(thing));
        int nw = curnodes++;
        lch[nw] = i2.second;
        rch[nw] = i1.second;
        stuff.insert({max(i2.first+const2,i1.first+const1+const2),nw});
    }
    if (stuff.size()==2){
        auto i1 = *stuff.begin();
        stuff.erase(stuff.begin());
        auto i2 = *stuff.begin();
        stuff.erase(stuff.begin());
        lch[node] = i2.second;
        rch[node] = i1.second;
        return max(i2.first+const2,i1.first+const1+const2);
    }
    if (stuff.size()==1){
        auto i1 = *stuff.begin();
        lch[node] = i1.second;
        return i1.first+const2;
    }
    return 0.0;
}

void dfs2(int node, long long curamt, int pos){
    //printf("ch of %d = %d %d\n",node,lch[node],rch[node]);
    if (node<n){
       // printf("code %d %lld\n",node,curamt+(1LL<<pos));
        Code(node,curamt+(1LL<<pos));
    }
    if (lch[node]!=-1){
       if (lch[node]<n) Code(lch[node],curamt+(5LL<<pos));
        if (lch[lch[node]]!=-1){
            dfs2(lch[lch[node]],curamt,pos+1);
        }
        if (rch[lch[node]]!=-1){
            dfs2(rch[lch[node]],curamt+(1LL<<pos),pos+3);
        }
    }
    if (rch[node]!=-1){
      if (rch[node]<n)  Code(rch[node],curamt+(7LL<<pos));
        if (lch[rch[node]]!=-1){
            dfs2(lch[rch[node]],curamt+(3LL<<pos),pos+3);
        }
        if (rch[rch[node]]!=-1){
            dfs2(rch[rch[node]],curamt+(7LL<<pos),pos+3);
        }
    }
}

void Encode(int N, int A[], int B[])
{
    n = N;
    memset(lch,-1,sizeof(lch));
    memset(rch,-1,sizeof(rch));
    curnodes = N;
    for (int x = 0; x<N-1; x++){
        adjl[A[x]].push_back(B[x]);
        adjl[B[x]].push_back(A[x]);
    }
    func(0,-1);
    dfs2(0,0,0);
}

Device

#include "Device.h"
#include <bits/stdc++.h>
using namespace std;

void InitDevice()
{
}

int Answer(long long S, long long T)
{
    string s1,s2;
    for (int x = 0; x<64; x++){
        if (S)s1.push_back((S&1)?'1':'0');
        S>>=1;
        if (T)s2.push_back((T&1)?'1':'0');
        T>>=1;
    }
    s1.pop_back();
    s2.pop_back();
    for (int x = 0; x<min(s1.size(),s2.size());){
        if (s1[x]=='0'){
            if (s2[x]=='0') {
                x++; continue;
            }
            if (s2[x+1]=='0'){
                if (s2.size()==x+2){
                    return 0;
                }
            }
            return 2;
        }
        else if (s2[x]=='0'){
            if (s1[x+1]=='0'){
                if (s1.size()==x+2){
                    return 1;
                }
            }
            return 2;
        }
        else if (min(s1.size(),s2.size())==x+2){
            if (s1[x]==s2[x] && s1[x+1]==s2[x+1]) {
                x+=2;
                continue;
            }
            else{
                return 2;
            }
        }
        else{
            if (s1[x]==s2[x] && s1[x+1]==s2[x+1] && s1[x+2]==s2[x+2]){
                x+=3;
                continue;
            }
            return 2;
        }
    }
    //printf("cmp %s %s\n",s1.c_str(),s2.c_str());
    return s1.size()<s2.size()?1:0;
    if (s1.size()<s2.size()){
        for (int x = 0; x<s1.size(); x++){
            if (s1[x]!=s2[x]) return 2;
        }
        return 1;
    }
    for (int x = 0; x<s2.size(); x++){
        if (s1[x]!=s2[x]) return 2;
    }
	return 0;
}

Compilation message (stderr)

Device.cpp: In function 'int Answer(long long int, long long int)':
Device.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   20 |     for (int x = 0; x<min(s1.size(),s2.size());){
      |                     ~^~~~~~~~~~~~~~~~~~~~~~~~~
Device.cpp:26:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |                 if (s2.size()==x+2){
      |                     ~~~~~~~~~^~~~~
Device.cpp:34:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |                 if (s1.size()==x+2){
      |                     ~~~~~~~~~^~~~~
Device.cpp:40:42: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   40 |         else if (min(s1.size(),s2.size())==x+2){
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
Device.cpp:60:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for (int x = 0; x<s1.size(); x++){
      |                         ~^~~~~~~~~~
Device.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int x = 0; x<s2.size(); x++){
      |                     ~^~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 10 / 92