oj.uz

Submission #1016344

# Submission time Handle Problem Language Result Execution time Memory
1016344 2024-07-07T20:47:50 Z Unforgettablepl Mechanical Doll (IOI18_doll) C++17
53 / 100
 89 ms 13644 KB 
#include <bits/stdc++.h>
using namespace std;

enum {
    EXIT = 20000000,
};

void answer(vector<int> C, vector<int> X, vector<int> Y);

void create_circuit(int M, vector<int> A) {    
    int N = A.size();
    vector<int> C(M + 1);
    vector<int> X(400001),Y(400001);
    vector<vector<int>> nextoccurences(M+1);
    A.emplace_back(EXIT);
    for(int i=0;i<N;i++)nextoccurences[A[i]].emplace_back(A[i+1]);
    int S = 0;
    for(int i=1;i<=M;i++){
        if(nextoccurences[i].empty())continue;
        int siz = 1;
        while(nextoccurences[i].size()>siz)siz<<=1;
        if(nextoccurences[i].size()==siz)continue;
        while(nextoccurences[i].size()<siz-1)nextoccurences[i].emplace_back(-i);
        nextoccurences[i].emplace_back(0);
    }
    int extraneeded = 0;
    int head = -1;
    pair<bool,int> exitnode;
    function<void(int,vector<int>)> calc = [&](int x,vector<int> targets){
        if(targets.size()==2){
            if(targets[0]==EXIT){
                exitnode = {false,-x};
            } else if(targets[0]==0){
                X[x] = extraneeded;
                extraneeded = head;
            } else if(targets[0]<0){
                X[x] = head;
            } else {
                X[x] = targets[0];
            }
            if(targets[1]==EXIT){
                exitnode = {true,-x};
            } else if(targets[1]==0){
                Y[x] = extraneeded;
                extraneeded = head;
            } else if(targets[1]<0){
                Y[x] = head;
            } else {
                Y[x] = targets[1];
            }
        } else {
            vector<int> odds;
            vector<int> evens;
            for(int i=0;i<targets.size();i++)
                if(i&1)odds.emplace_back(targets[i]);
                else evens.emplace_back(targets[i]);
            X[x] = -(++S);
            calc(S,evens);
            Y[x] = -(++S);
            calc(S,odds);
        }
    };
    for(int i=1;i<=M;i++){
        if(nextoccurences[i].empty())continue;
        if(nextoccurences[i].size()==1){
            if(nextoccurences[i][0]==EXIT){
                exitnode = {false,i};
            } else {
                C[i] = nextoccurences[i][0];
            }
            continue;
        } 
        head = -(++S);
        C[i]=head;
        calc(-head,nextoccurences[i]);
    }
    if(exitnode.second>0){
        C[exitnode.second]=extraneeded;
    } else {
        if(!exitnode.first)X[-exitnode.second]=extraneeded;
        else Y[-exitnode.second]=extraneeded;
    }
    C[0] = A[0];
    X.erase(X.begin());
    Y.erase(Y.begin());
    X.resize(S);
    Y.resize(S);
    answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:21:39: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |         while(nextoccurences[i].size()>siz)siz<<=1;
      |               ~~~~~~~~~~~~~~~~~~~~~~~~^~~~
doll.cpp:22:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         if(nextoccurences[i].size()==siz)continue;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
doll.cpp:23:39: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |         while(nextoccurences[i].size()<siz-1)nextoccurences[i].emplace_back(-i);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
doll.cpp: In lambda function:
doll.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             for(int i=0;i<targets.size();i++)
      |                         ~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 18 ms 9656 KB Output is correct
3 Correct 16 ms 8280 KB Output is correct
4 Correct 2 ms 3416 KB Output is correct
5 Correct 7 ms 7004 KB Output is correct
6 Correct 26 ms 10896 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 18 ms 9656 KB Output is correct
3 Correct 16 ms 8280 KB Output is correct
4 Correct 2 ms 3416 KB Output is correct
5 Correct 7 ms 7004 KB Output is correct
6 Correct 26 ms 10896 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 29 ms 9812 KB Output is correct
9 Correct 33 ms 11340 KB Output is correct
10 Correct 45 ms 13124 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 18 ms 9656 KB Output is correct
3 Correct 16 ms 8280 KB Output is correct
4 Correct 2 ms 3416 KB Output is correct
5 Correct 7 ms 7004 KB Output is correct
6 Correct 26 ms 10896 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 29 ms 9812 KB Output is correct
9 Correct 33 ms 11340 KB Output is correct
10 Correct 45 ms 13124 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 65 ms 12580 KB Output is correct
15 Correct 29 ms 8276 KB Output is correct
16 Correct 46 ms 10560 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3408 KB Output is correct
20 Correct 47 ms 12612 KB Output is correct
21 Correct 2 ms 3420 KB Output is correct
22 Correct 1 ms 3420 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3416 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 2 ms 3420 KB Output is partially correct
2 Correct 35 ms 7696 KB Output is correct
3 Partially correct 59 ms 10752 KB Output is partially correct
4 Partially correct 64 ms 11284 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 3420 KB Output is partially correct
2 Correct 35 ms 7696 KB Output is correct
3 Partially correct 59 ms 10752 KB Output is partially correct
4 Partially correct 64 ms 11284 KB Output is partially correct
5 Partially correct 64 ms 13132 KB Output is partially correct
6 Partially correct 89 ms 12980 KB Output is partially correct
7 Partially correct 74 ms 13124 KB Output is partially correct
8 Partially correct 76 ms 13120 KB Output is partially correct
9 Partially correct 53 ms 10748 KB Output is partially correct
10 Partially correct 89 ms 13644 KB Output is partially correct
11 Partially correct 87 ms 13116 KB Output is partially correct
12 Partially correct 57 ms 9804 KB Output is partially correct
13 Partially correct 45 ms 9816 KB Output is partially correct
14 Partially correct 50 ms 9804 KB Output is partially correct
15 Partially correct 52 ms 9844 KB Output is partially correct
16 Partially correct 4 ms 3672 KB Output is partially correct
17 Partially correct 42 ms 8596 KB Output is partially correct
18 Partially correct 46 ms 8532 KB Output is partially correct
19 Partially correct 49 ms 8780 KB Output is partially correct
20 Partially correct 57 ms 10672 KB Output is partially correct
21 Partially correct 70 ms 11812 KB Output is partially correct
22 Partially correct 71 ms 10144 KB Output is partially correct