oj.uz

Submission #96144

# Submission time Handle Problem Language Result Execution time Memory
96144 2019-02-06T13:01:02 Z bogdan10bos Mechanical Doll (IOI18_doll) C++14
53 / 100
 153 ms 14716 KB 
#include <bits/stdc++.h>
#include "doll.h"

using namespace std;

int S;
vector<int> X, Y;
vector<int> newv;

int make_switch(int st, int dr, int idd = -1)
{
    bool ok = true;
    for(int i = st + 1; i <= dr; i++)
        if(newv[i] != newv[st])
        {
            ok = false;
            break;
        }
    if(ok)  return newv[st];
    if(st + 1 == dr)
    {
        if(idd == -1)
        {
            S++;
            X.push_back(newv[st]);
            Y.push_back(newv[dr]);
            return -S;
        }
        else
        {
            X[idd - 1] = newv[st];
            Y[idd - 1] = newv[dr];
            return -idd;
        }
    }

    int id = -1;
    if(idd == -1)
    {
        S++;
        id = S;
        X.push_back(0);
        Y.push_back(0);
    }
    else
        id = idd;

    int mij = st + (dr - st) / 2;
    int sl = make_switch(st, mij);
    int sr = make_switch(mij + 1, dr);

    X[id - 1] = sl;
    Y[id - 1] = sr;
    return -id;
}

int make_switch(vector<int> v)
{
    if(v.empty())   return 0;
    if(v.size() == 1)
        return v[0];

    S++;
    X.push_back(0);
    Y.push_back(0);

    int l = v.size();
    int lst = v.back();
    v.pop_back();

    while( (l & (l - 1)) != 0 )
    {
        v.push_back(-S);
        l++;
    }
    v.push_back(lst);

    newv.clear();
    newv.resize(v.size());
    int lg = 0;
    for(lg = 0; (1 << lg) < v.size(); lg++);
    for(int i = 0; i < v.size(); i++)
    {
        int msk = i;
        int rmsk = 0;
        for(int j = 0; j < lg; j++)
            if((msk >> j) & 1)
                rmsk |= (1 << (lg - j - 1));
        newv[rmsk] = v[i];
    }

    return make_switch(0, l - 1, S);
}

void create_circuit(int M, vector<int> A)
{
    vector< vector<int> > v;
    v.resize(M + 2);
    int lst = 0;
    for(int i = 0; i < A.size(); i++)
    {
        v[lst].push_back(A[i]);
        lst = A[i];
    }
    v[lst].push_back(0);

    vector<int> ex;
    ex.resize(M + 1);
    X.clear(), Y.clear();

    S = 0;
    for(int i = 0; i <= M; i++)
    {
        int l = v[i].size();
        ex[i] = make_switch(v[i]);
    }

    answer(ex, X, Y);
}

Compilation message

doll.cpp: In function 'int make_switch(std::vector<int>)':
doll.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(lg = 0; (1 << lg) < v.size(); lg++);
      |                 ~~~~~~~~~~^~~~~~~~~~
doll.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i = 0; i < v.size(); i++)
      |                    ~~^~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:100:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for(int i = 0; i < A.size(); i++)
      |                    ~~^~~~~~~~~~
doll.cpp:114:13: warning: unused variable 'l' [-Wunused-variable]
  114 |         int l = v[i].size();
      |             ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 6284 KB Output is correct
3 Correct 30 ms 5188 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 17 ms 3788 KB Output is correct
6 Correct 68 ms 7632 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 6284 KB Output is correct
3 Correct 30 ms 5188 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 17 ms 3788 KB Output is correct
6 Correct 68 ms 7632 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 62 ms 7232 KB Output is correct
9 Correct 91 ms 8608 KB Output is correct
10 Correct 114 ms 11008 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 6284 KB Output is correct
3 Correct 30 ms 5188 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 17 ms 3788 KB Output is correct
6 Correct 68 ms 7632 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 62 ms 7232 KB Output is correct
9 Correct 91 ms 8608 KB Output is correct
10 Correct 114 ms 11008 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 122 ms 10976 KB Output is correct
15 Correct 55 ms 5796 KB Output is correct
16 Correct 114 ms 8612 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 109 ms 10652 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 29 ms 2980 KB Output is correct
3 Partially correct 127 ms 11152 KB Output is partially correct
4 Correct 85 ms 8348 KB Output is correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 29 ms 2980 KB Output is correct
3 Partially correct 127 ms 11152 KB Output is partially correct
4 Correct 85 ms 8348 KB Output is correct
5 Partially correct 120 ms 12188 KB Output is partially correct
6 Partially correct 133 ms 13388 KB Output is partially correct
7 Partially correct 122 ms 13004 KB Output is partially correct
8 Partially correct 135 ms 14136 KB Output is partially correct
9 Partially correct 97 ms 8568 KB Output is partially correct
10 Partially correct 141 ms 14276 KB Output is partially correct
11 Partially correct 146 ms 14716 KB Output is partially correct
12 Partially correct 94 ms 9628 KB Output is partially correct
13 Partially correct 85 ms 8916 KB Output is partially correct
14 Partially correct 121 ms 8624 KB Output is partially correct
15 Partially correct 105 ms 8140 KB Output is partially correct
16 Partially correct 3 ms 460 KB Output is partially correct
17 Partially correct 70 ms 7592 KB Output is partially correct
18 Partially correct 106 ms 7516 KB Output is partially correct
19 Partially correct 116 ms 8196 KB Output is partially correct
20 Partially correct 123 ms 10396 KB Output is partially correct
21 Partially correct 153 ms 12500 KB Output is partially correct
22 Partially correct 111 ms 9540 KB Output is partially correct