oj.uz

Submission #249742

# Submission time Handle Problem Language Result Execution time Memory
249742 2020-07-15T16:26:37 Z stoyan_malinin Mechanical Doll (IOI18_doll) C++14
85.553 / 100
 375 ms 81168 KB 
#include "doll.h"
//#include "grader.cpp"

#include <iostream>
#include <map>
#include <set>

using namespace std;

const int MAXN = 5e5 + 5;

int usedSwitches = 0;

struct Switch
{
    static int switchCnt;

    int num;
    int state;

    int out[2];

    Switch()
    {
        this->num = switchCnt;
        switchCnt++;

        this->state = 0;
        this->out[0] = this->out[1] = MAXN;
    }
};
int Switch::switchCnt = 0;

Switch s[MAXN];
bool removed[MAXN];

struct RouterOutput
{
    int switchNum, outNum;

    RouterOutput(){}
    RouterOutput(int switchNum, int outNum)
    {
        this->outNum = outNum;
        this->switchNum = switchNum;
    }

    void assignDirection(int nxt)
    {
        s[switchNum].out[outNum] = nxt;
    }
};

struct Router
{
    int root, sz, useless;
    vector <RouterOutput> outs;

    int removedCnt = 0;

    Router(){}
    Router(int sz, int useless)
    {
        usedSwitches++;
        this->root = usedSwitches;

        this->sz = sz;
        this->useless = useless;
        build(root, 0, sz-1);

        optimize(root);
        initOuts();
    }

    void optimize(int sInd)
    {
        //cout << sInd << " -> " << s[sInd].out[0] << '\n';
        if(s[sInd].out[0]==MAXN)
        {
            if(useless>=2)
            {
                useless -= 2;
                removed[sInd] = 1;

                //cout << "remove*: " << sInd << '\n';

                removedCnt++;
            }
            return;
        }

        optimize(-s[sInd].out[0]);
        optimize(-s[sInd].out[1]);

        if(removed[ -s[sInd].out[0] ]==true && removed[ -s[sInd].out[1] ]==true)
        {
            //cout << "remove: " << sInd << '\n';

            removed[sInd] = 1;
            removedCnt++;
        }
        else if(removed[ -s[sInd].out[0] ]==true)
        {
            s[sInd].out[0] = -root;
        }
        else if(removed[ -s[sInd].out[1] ]==true)
        {
            s[sInd].out[1] = -root;
        }
    }

    void build(int sInd, int l, int r)
    {
        //cout << sInd << " || " << l << " " << r << '\n';

        if(l+1==r) return;
        if(l+2==r)
        {
            usedSwitches++;
            s[sInd].out[0] = -usedSwitches;

            return;
        }

        usedSwitches++;
        s[sInd].out[0] = -usedSwitches;

        usedSwitches++;
        s[sInd].out[1] = -usedSwitches;

        build(-s[sInd].out[0], l, (l+r)/2);
        build(-s[sInd].out[1], (l+r)/2+1, r);
    }

    void initOuts()
    {
        for(int i = 0;i<sz;i++)
        {
            int sInd = root;
            while(true)
            {
                if(s[sInd].out[ s[sInd].state ]==MAXN)
                {
                    outs.push_back(RouterOutput(sInd, s[sInd].state));
                    s[sInd].state ^= 1;

                    break;
                }

                s[sInd].state ^= 1;
                sInd = -s[sInd].out[ s[sInd].state^1 ];
            }
        }

        //if(outs.size()!=sz) answer({}, {}, {});
        //for(RouterOutput x: outs) cout << x.switchNum << " &&& " << x.outNum << '\n';
    }
};

Router r[MAXN];
vector <int> nxt[MAXN];

void relabel(vector <int> &c, vector <int> &x, vector <int> &y)
{
    set <int> s;
    for(int i = 1;i<=usedSwitches;i++)
    {
        if(removed[i]==false) s.insert(i);
    }

    map <int, int> mp;

    //cout << x.size() << '\n';
    //for(int i = 0;i<x.size();i++) cout << x[i] << " " << y[i] << '\n';

    //cout << '\n' << '\n';

    int ind = 0;
    for(int a: s)
    {
        ind++;
        mp[-a] = -ind;

        //cout << a << " vs " << ind << '\n';

        swap(x[a-1], x[ind-1]);
        swap(y[a-1], y[ind-1]);
    }

    for(int &b: c)
    {
        if(b<0) b = mp[b];
    }
    for(int &b: x)
    {
        if(b<0) b = mp[b];
    }
    for(int &b: y)
    {
        if(b<0) b = mp[b];
    }

    while(x.size()!=ind) x.pop_back(), y.pop_back();

    //cout << x.size() << '\n';
    //for(int i = 0;i<x.size();i++) cout << x[i] << " " << y[i] << '\n';
}

void create_circuit(int M, vector <int> A)
{
    vector <int> C(M+1);

    A.push_back(0);
    for(int i = 0;i<A.size()-1;i++) nxt[ A[i] ].push_back(A[i+1]);

    C[0] = A[0];
    for(int i = 1;i<=M;i++)
    {
        if(nxt[i].size()>1)
        {
            int sz = 1;
            while(sz<nxt[i].size()) sz *= 2;

            r[i] = Router(sz, sz-nxt[i].size());
            C[i] = -r[i].root;
        }
        else
        {
            if(nxt[i].size()==1) C[i] = nxt[i][0];
            else C[i] = 0;
        }
    }

    for(int x = 1;x<=M;x++)
    {
        if(nxt[x].size()<=1) continue;

        int useLess = r[x].useless;
        for(int i = 0;i<useLess;i++) r[x].outs[i].assignDirection(-r[x].root);

        for(int i = 0;i<nxt[x].size();i++)
        {
            r[x].outs[useLess+i].assignDirection(nxt[x][i]);
        }
    }

    //cout << '\n';

    //for(int i = 0;i<=M;i++) cout << C[i] << '\n';

    vector <int> X(usedSwitches), Y(usedSwitches);
    for(int i = 1;i<=usedSwitches;i++)
    {
        X[i-1] = s[i].out[0];
        Y[i-1] = s[i].out[1];

        //cout << X[i-1] << " " << Y[i-1] << '\n';
    }

    if(usedSwitches>=2*(A.size()-1)) cout << 1/0 << '\n';

    relabel(C, X, Y);
    answer(C, X, Y);
}
/*
4 4
1 2 1 3

4 7
1 3 4 2 1 2 2

1 12
1 1 1 1 1 1 1 1 1 1 1 1

5 11
1 2 5 2 3 4 1 2 5 5 4

5 4
1 1 1 1
*/

Compilation message

doll.cpp: In function 'void relabel(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
doll.cpp:203:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  203 |     while(x.size()!=ind) x.pop_back(), y.pop_back();
      |           ~~~~~~~~^~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:214:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  214 |     for(int i = 0;i<A.size()-1;i++) nxt[ A[i] ].push_back(A[i+1]);
      |                   ~^~~~~~~~~~~
doll.cpp:222:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  222 |             while(sz<nxt[i].size()) sz *= 2;
      |                   ~~^~~~~~~~~~~~~~
doll.cpp:241:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  241 |         for(int i = 0;i<nxt[x].size();i++)
      |                       ~^~~~~~~~~~~~~~
doll.cpp:260:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  260 |     if(usedSwitches>=2*(A.size()-1)) cout << 1/0 << '\n';
      |        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
doll.cpp:260:47: warning: division by zero [-Wdiv-by-zero]
  260 |     if(usedSwitches>=2*(A.size()-1)) cout << 1/0 << '\n';
      |                                              ~^~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 43292 KB Output is correct
2 Correct 67 ms 47068 KB Output is correct
3 Correct 56 ms 46616 KB Output is correct
4 Correct 32 ms 43336 KB Output is correct
5 Correct 45 ms 44484 KB Output is correct
6 Correct 64 ms 48316 KB Output is correct
7 Correct 29 ms 43260 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 43292 KB Output is correct
2 Correct 67 ms 47068 KB Output is correct
3 Correct 56 ms 46616 KB Output is correct
4 Correct 32 ms 43336 KB Output is correct
5 Correct 45 ms 44484 KB Output is correct
6 Correct 64 ms 48316 KB Output is correct
7 Correct 29 ms 43260 KB Output is correct
8 Correct 118 ms 55488 KB Output is correct
9 Correct 126 ms 53128 KB Output is correct
10 Correct 229 ms 61712 KB Output is correct
11 Correct 31 ms 43316 KB Output is correct
12 Correct 38 ms 43332 KB Output is correct
13 Correct 30 ms 43352 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 43292 KB Output is correct
2 Correct 67 ms 47068 KB Output is correct
3 Correct 56 ms 46616 KB Output is correct
4 Correct 32 ms 43336 KB Output is correct
5 Correct 45 ms 44484 KB Output is correct
6 Correct 64 ms 48316 KB Output is correct
7 Correct 29 ms 43260 KB Output is correct
8 Correct 118 ms 55488 KB Output is correct
9 Correct 126 ms 53128 KB Output is correct
10 Correct 229 ms 61712 KB Output is correct
11 Correct 31 ms 43316 KB Output is correct
12 Correct 38 ms 43332 KB Output is correct
13 Correct 30 ms 43352 KB Output is correct
14 Correct 317 ms 70696 KB Output is correct
15 Correct 141 ms 57024 KB Output is correct
16 Correct 219 ms 64216 KB Output is correct
17 Correct 34 ms 43340 KB Output is correct
18 Correct 28 ms 43352 KB Output is correct
19 Correct 34 ms 43244 KB Output is correct
20 Correct 236 ms 65776 KB Output is correct
21 Correct 28 ms 43304 KB Output is correct
22 Correct 24 ms 43356 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 43272 KB Output is correct
2 Correct 28 ms 43340 KB Output is correct
3 Correct 30 ms 43340 KB Output is correct
4 Correct 29 ms 43256 KB Output is correct
5 Correct 25 ms 43340 KB Output is correct
6 Correct 31 ms 43320 KB Output is correct
7 Correct 35 ms 43344 KB Output is correct
8 Correct 30 ms 43340 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 43328 KB Output is correct
2 Correct 182 ms 59248 KB Output is correct
3 Correct 259 ms 68180 KB Output is correct
4 Correct 333 ms 71452 KB Output is correct

Subtask #6
41.5530038336 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 43328 KB Output is correct
2 Correct 182 ms 59248 KB Output is correct
3 Correct 259 ms 68180 KB Output is correct
4 Correct 333 ms 71452 KB Output is correct
5 Partially correct 329 ms 75428 KB Output is partially correct
6 Partially correct 365 ms 78040 KB Output is partially correct
7 Partially correct 344 ms 77092 KB Output is partially correct
8 Partially correct 356 ms 79628 KB Output is partially correct
9 Partially correct 242 ms 67588 KB Output is partially correct
10 Partially correct 349 ms 79548 KB Output is partially correct
11 Partially correct 375 ms 81168 KB Output is partially correct
12 Partially correct 225 ms 68296 KB Output is partially correct
13 Partially correct 224 ms 65984 KB Output is partially correct
14 Partially correct 231 ms 65496 KB Output is partially correct
15 Partially correct 214 ms 64296 KB Output is partially correct
16 Partially correct 29 ms 43980 KB Output is partially correct
17 Partially correct 196 ms 64080 KB Output is partially correct
18 Partially correct 201 ms 64088 KB Output is partially correct
19 Partially correct 216 ms 65236 KB Output is partially correct
20 Partially correct 285 ms 72512 KB Output is partially correct
21 Partially correct 331 ms 77308 KB Output is partially correct
22 Partially correct 259 ms 71440 KB Output is partially correct