oj.uz

Submission #688469

# Submission time Handle Problem Language Result Execution time Memory
688469 2023-01-27T13:40:52 Z alexdd Permutation Recovery (info1cup17_permutation) C++17
43 / 100
 4000 ms 22196 KB 
#include<bits/stdc++.h>
using namespace std;
int bucket_size;
int update_timer;
int n;

struct bigInt
{
    vector<int> cif;
};
bigInt operator-(bigInt x, bigInt y)///return x-y
{
    bigInt sc;
    bigInt newx = x;
    for(int i=0;i<x.cif.size();i++)
    {
        if(i<y.cif.size() && x.cif[i] >= y.cif[i])
            sc.cif.push_back(x.cif[i] - y.cif[i]);
        else if(i>=y.cif.size())
            sc.cif.push_back(x.cif[i]);
        else
        {
            int j=i+1;
            while(x.cif[j]==0)
                x.cif[j++]=9;
            x.cif[j]--;
            sc.cif.push_back(10+x.cif[i]-y.cif[i]);
        }
    }
    while(!sc.cif.empty() && sc.cif[sc.cif.size()-1]==0)
        sc.cif.pop_back();
    x = newx;
    return sc;
}
bigInt operator+(bigInt x, bigInt y)
{
    bigInt ad;
    int r=0;
    for(int i=0;i<max(x.cif.size(), y.cif.size());i++)
    {
        if(i<x.cif.size())
            r+=x.cif[i];
        if(i<y.cif.size())
            r+=y.cif[i];
        ad.cif.push_back(r%10);
        r/=10;
    }
    while(r>0)
    {
        ad.cif.push_back(r%10);
        r/=10;
    }
    return ad;
}
bool operator==(bigInt x, bigInt y)
{
    return x.cif == y.cif;
}
bool operator<=(bigInt x, bigInt y)
{
    if(x.cif.size() < y.cif.size())
        return 1;
    if(x.cif.size() > y.cif.size())
        return 0;
    for(int i=x.cif.size()-1;i>=0;i--)
    {
        if(x.cif[i]<y.cif[i])
            return 1;
        if(x.cif[i]>y.cif[i])
            return 0;
    }
    return 1;
}
bigInt q[70001];
bigInt zer;
bigInt unu = {{1}};

struct bucket
{
    bigInt sum;
    vector<int> v;
};
bucket gol;

vector<bucket> buckets;
void balance_buckets()///O(n)
{
    vector<int> ramas;
    for(int i=0;i<buckets.size();i++)
        for(int j=0;j<buckets[i].v.size();j++)
            ramas.push_back(buckets[i].v[j]);
    buckets.clear();
    for(int i=0;i<ramas.size();i+=bucket_size)
    {
        buckets.push_back(gol);
        int limit = ramas.size()-1;
        limit = min(limit, i+bucket_size-1);
        for(int j=i;j<=limit;j++)
        {
            buckets[buckets.size()-1].v.push_back(ramas[j]);
            buckets[buckets.size()-1].sum = buckets[buckets.size()-1].sum + q[ramas[j]];
        }
    }
}

void insereaza(int b, int poz, bigInt ramas)///O(marimea bucketului in care inserez)
{
    buckets[b].sum = buckets[b].sum + q[poz];
    for(int i=0;i<buckets[b].v.size();i++)
    {
        if(ramas==zer)
        {
            buckets[b].v.insert(buckets[b].v.begin()+i, poz);
            return;
        }
        ramas = ramas - q[buckets[b].v[i]];
    }
    buckets[b].v.insert(buckets[b].v.end(), poz);
}

int rez[70001];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n;

    update_timer = 500;
    bucket_size = 100;

    buckets.push_back(gol);
    bigInt prec, ceva;

    prec = zer;
    string s;
    for(int i=1;i<=n;i++)
    {
        cin>>s;
        for(int j=s.size()-1;j>=0;j--)
            q[i].cif.push_back(s[j]-'0');
        ceva = q[i];
        q[i] = q[i] - prec;
        prec = ceva;

        bigInt aux = q[i] - unu;
        int unde = 0;
        bool bl=0;
        for(int j=0;j<buckets.size();j++)
        {
            unde = j;
            if(aux <= buckets[j].sum)
            {
                bl=1;
                break;
            }
            aux = aux - buckets[j].sum;
        }
        insereaza(unde, i, aux);

        if(i<n && i%update_timer==0)
        {
            balance_buckets();
        }
    }

    int cate=0;
    for(int i=0;i<buckets.size();i++)
    {
        for(int j=0;j<buckets[i].v.size();j++)
        {
            cate++;
            rez[buckets[i].v[j]]=cate;
        }
    }
    for(int i=1;i<=n;i++)
        cout<<rez[i]<<" ";
    return 0;
}

Compilation message

permutation.cpp: In function 'bigInt operator-(bigInt, bigInt)':
permutation.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=0;i<x.cif.size();i++)
      |                 ~^~~~~~~~~~~~~
permutation.cpp:17:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         if(i<y.cif.size() && x.cif[i] >= y.cif[i])
      |            ~^~~~~~~~~~~~~
permutation.cpp:19:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         else if(i>=y.cif.size())
      |                 ~^~~~~~~~~~~~~~
permutation.cpp: In function 'bigInt operator+(bigInt, bigInt)':
permutation.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   39 |     for(int i=0;i<max(x.cif.size(), y.cif.size());i++)
      |                 ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
permutation.cpp:41:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         if(i<x.cif.size())
      |            ~^~~~~~~~~~~~~
permutation.cpp:43:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         if(i<y.cif.size())
      |            ~^~~~~~~~~~~~~
permutation.cpp: In function 'void balance_buckets()':
permutation.cpp:89:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bucket>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for(int i=0;i<buckets.size();i++)
      |                 ~^~~~~~~~~~~~~~~
permutation.cpp:90:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |         for(int j=0;j<buckets[i].v.size();j++)
      |                     ~^~~~~~~~~~~~~~~~~~~~
permutation.cpp:93:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(int i=0;i<ramas.size();i+=bucket_size)
      |                 ~^~~~~~~~~~~~~
permutation.cpp: In function 'void insereaza(int, int, bigInt)':
permutation.cpp:109:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |     for(int i=0;i<buckets[b].v.size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~~
permutation.cpp: In function 'int main()':
permutation.cpp:147:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bucket>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |         for(int j=0;j<buckets.size();j++)
      |                     ~^~~~~~~~~~~~~~~
permutation.cpp:146:14: warning: variable 'bl' set but not used [-Wunused-but-set-variable]
  146 |         bool bl=0;
      |              ^~
permutation.cpp:166:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bucket>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |     for(int i=0;i<buckets.size();i++)
      |                 ~^~~~~~~~~~~~~~~
permutation.cpp:168:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         for(int j=0;j<buckets[i].v.size();j++)
      |                     ~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct
5 Execution timed out 4033 ms 22196 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct
5 Execution timed out 4033 ms 22196 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct
5 Execution timed out 4033 ms 22196 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct
5 Execution timed out 4033 ms 22196 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 13 ms 1980 KB Output is correct
3 Correct 77 ms 2288 KB Output is correct
4 Correct 119 ms 2220 KB Output is correct
5 Execution timed out 4033 ms 22196 KB Time limit exceeded
6 Halted 0 ms 0 KB -