Submission #488395

# Submission time Handle Problem Language Result Execution time Memory
488395 2021-11-18T19:30:55 Z alexander707070 Floppy (RMI20_floppy) C++14
14.2926 / 100
48 ms 5564 KB
#include<bits/stdc++.h>
#include "floppy.h"
using namespace std;

string s;
int curr,lgn;
vector<long long> vv;
map<long long,int> mp;

/*
void save_to_floppy(string ss){

}
*/

void read_array(int subtask_id,const vector<int> &v){
    for(int i=0;i<v.size();i++){
        vv.push_back(v[i]);
    }
    sort(vv.begin(),vv.end());
    for(int i=0;i<vv.size();i++){
        mp[vv[i]]=i;
    }
    for(int i=1;i<int(v.size());i*=2){
        lgn++;
    }
    lgn++;

    for(int i=0;i<v.size();i++){
        curr=mp[v[i]];
        for(int f=0;f<lgn;f++){
            s.push_back(curr%2+'0');
            curr/=2;
        }
    }
    save_to_floppy(s);
}

int c[80007],p,st;

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(c[x]>c[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]) );
}

vector<int> ans;

vector<int> solve_queries(int subtask_id,int N,const string &bits,const vector<int> &a,const vector<int> &b){
    for(int i=1;i<N;i*=2){
        lgn++;
    }
    lgn++;
    for(int i=0;i<bits.size();i+=lgn){
        st=1;
        for(int f=i;f<=i+lgn-1;f++){
            c[p]+=st*(bits[f]-'0');
            st*=2;
        }
        p++;
    }
    calc();
    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

floppy.cpp: In function 'void read_array(int, const std::vector<int>&)':
floppy.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
floppy.cpp:21:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i=0;i<vv.size();i++){
      |                 ~^~~~~~~~~~
floppy.cpp:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
floppy.cpp: In function 'std::vector<int> solve_queries(int, int, const string&, const std::vector<int>&, const std::vector<int>&)':
floppy.cpp:77:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for(int i=0;i<bits.size();i+=lgn){
      |                 ~^~~~~~~~~~~~
floppy.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     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) {
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1152 KB Output is correct
2 Correct 2 ms 1152 KB Output is correct
3 Correct 2 ms 1024 KB Output is correct
4 Correct 2 ms 1024 KB Output is correct
5 Correct 2 ms 1024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 34 ms 5252 KB Partially correct
2 Partially correct 37 ms 5328 KB Partially correct
3 Partially correct 36 ms 5200 KB Partially correct
4 Partially correct 34 ms 5268 KB Partially correct
5 Partially correct 34 ms 5296 KB Partially correct
# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 5564 KB L is too large
2 Halted 0 ms 0 KB -