Submission #488419

#	Time	Username	Problem	Language	Result	Execution time	Memory
488419		alexander707070	Floppy (RMI20_floppy)	C++14	0 / 100	77 ms	14892 KiB

floppy

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

string s;
vector<int> vv;

struct node{
    int pos,sz;
    node *p;
    node *l,*r;

    node (int pos){
        this->pos=pos;
        this->sz=1;
        this->p=this->l=this->r=NULL;
    }
};

node *tree;

bool li[80007][20];
int dp[80007][20];
int power[20],lg[80007];

void calc(){
    power[0]=1;
    for(int i=1;i<20;i++)power[i]=power[i-1]*2;
    lg[1]=0;
    for(int i=2;i<=80000;i++)lg[i]=lg[i/2]+1;
}

int best(int x,int y){
    if(vv[x]>vv[y])return x;
    else return y;
}

int rmq(int i,int j){
    if(j==0)return i;

    if(li[i][j])return dp[i][j];
    li[i][j]=true;

    dp[i][j]=best(rmq(i,j-1),rmq(i+power[j-1],j-1));
    return dp[i][j];
}
int mins(int l,int r){
    return best( rmq(l,lg[r-l+1]) , rmq(r-power[lg[r-l+1]]+1,lg[r-l+1]) );
}

void build(node* &curr,int l,int r){
    if(l>r)return;
    if(l==r){
        curr=new node(l);
    }else{
        int id=mins(l,r);
        curr=new node(id);
        build(curr->l,l,id-1);
        build(curr->r,id+1,r);
    }
}
void dfs(node *curr){
    if(curr->l!=NULL)s.push_back('1');
    else s.push_back('0');

    if(curr->r!=NULL)s.push_back('1');
    else s.push_back('0');  

    if(curr->l!=NULL)dfs(curr->l);
    if(curr->r!=NULL)dfs(curr->r);
}

void read_array(int subtask_id,const vector<int> &v){
    for(int i=0;i<v.size();i++)vv.push_back(v[i]);
    calc();
    build(tree,0,int(v.size())-1);
    dfs(tree);
    save_to_floppy(s);
}

int c[80007];

void restore(node* &curr,int pos,int dep,int toadd){
    if(pos!=0)curr=new node(0);
    if(s[pos]=='1'){
        restore(curr->l,pos+2,dep-1,toadd);
        curr->sz+=curr->l->sz;
    }
    c[(curr->sz)-1+toadd]=dep;
    if(s[pos+1]=='1'){
        restore(curr->r,2*(curr->sz),dep-1,toadd+curr->sz);
        curr->sz+=curr->r->sz;
    }
}

vector<int> ans;
vector<int> solve_queries(int subtask_id,int N,const string &bits,const vector<int> &a,const vector<int> &b){
    tree->sz=1;
    restore(tree,0,N,0);

    calc();
    for(int i=0;i<N;i++)vv.push_back(c[i]);
    for(int i=0;i<a.size();i++){
        ans.push_back(mins(a[i],b[i]));
    }
    return ans;
}

/*
int main(){
    vector<int> w;
    read_array(0,{40, 20, 30, 10 } );

    w=solve_queries(0,4,s,{0, 0, 0, 0, 1, 1, 1, 2, 2, 3} , {0, 1, 2, 3, 1, 2, 3, 2, 3, 3 });
    for(int i=0;i<w.size();i++)cout<<w[i]<<" ";
}
*/

Compilation message (stderr)

floppy.cpp: In function 'void read_array(int, const std::vector<int>&)':
floppy.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int i=0;i<v.size();i++)vv.push_back(v[i]);
      |                 ~^~~~~~~~~
floppy.cpp: In function 'std::vector<int> solve_queries(int, int, const string&, const std::vector<int>&, const std::vector<int>&)':
floppy.cpp:103:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for(int i=0;i<a.size();i++){
      |                 ~^~~~~~~~~
stub.cpp: In function 'void run2()':
stub.cpp:101:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |     if (query_answers.size() != M) {
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 21
• Subtask 3: 0 / 72