Submission #788547

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788547	2023-07-20T10:41:12 Z	Andrey	Mechanical Doll (IOI18_doll)	C++14	6 / 100	1000 ms	21552 KB

doll

#include "doll.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> haha[200001];
vector<int> idk(500001);
int br = 1,yeah;
vector<int> x(0);
vector<int> y(0);

void dude(int a, int d) {
    x.push_back(0);
    y.push_back(0);
    int ind = br-1;
    br++;
    if(d < 0) {
        if(a == 2) {
            x[ind] = INT_MAX;
            y[ind] = INT_MAX;
        }
        else {
            x[ind] = yeah;
            y[ind] = INT_MAX;
        }
        return;
    }
    int z = (1 << d);
    if(a <= z) {
        x[ind] = yeah;
        y[ind] = -br;
        dude(a,d-1);
    }
    else {
        x[ind] = -br;
        dude(a-z,d-1);
        y[ind] = -br;
        dude(z,d-1);
    }
}

void create_circuit(int m, vector<int> bruh) {
    vector<int> c(m+1);
    c[0] = bruh[0];
    int n = bruh.size();
    bruh.push_back(0);
    int a,z = 0,b,p,d = 0,e = 1;
    for(int i = 0; i < n; i++) {
        haha[bruh[i]].push_back(bruh[i+1]);
    }
    for(int i = 0; i < 200001; i++) {
        if(haha[i].empty()) {
            continue;
        }
        if(haha[i].size() == 1) {
            c[i] = haha[i][0];
        }
        else {
            c[i] = -br;
            yeah = -br;
            d = -1;
            e = 1;
            while(e*2 < haha[i].size()) {
                e*=2;
                d++;
            }
            dude(haha[i].size(),d);
            p = 0;
            for(int j = 0; j < haha[i].size(); j++) {
                d = -c[i];
                if((++idk[d-1])%2) {
                    e = x[d-1];
                }
                else {
                    e = y[d-1];
                }
                while(e != INT_MAX) {
                    d = -e;
                    if((++idk[d-1])%2) {
                        e = x[d-1];
                    }
                    else {
                        e = y[d-1];
                    }
                }
                if(idk[d-1]%2 == 1) {
                    x[d-1] = haha[i][j];
                }
                else {
                    y[d-1] = haha[i][j];
                }
            }
        }
    }
    answer(c,x,y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             while(e*2 < haha[i].size()) {
      |                   ~~~~^~~~~~~~~~~~~~~~
doll.cpp:68:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j = 0; j < haha[i].size(); j++) {
      |                            ~~^~~~~~~~~~~~~~~~
doll.cpp:46:9: warning: unused variable 'a' [-Wunused-variable]
   46 |     int a,z = 0,b,p,d = 0,e = 1;
      |         ^
doll.cpp:46:11: warning: unused variable 'z' [-Wunused-variable]
   46 |     int a,z = 0,b,p,d = 0,e = 1;
      |           ^
doll.cpp:46:17: warning: unused variable 'b' [-Wunused-variable]
   46 |     int a,z = 0,b,p,d = 0,e = 1;
      |                 ^
doll.cpp:46:19: warning: variable 'p' set but not used [-Wunused-but-set-variable]
   46 |     int a,z = 0,b,p,d = 0,e = 1;
      |                   ^

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	6868 KB	Output is correct
2	Correct	24 ms	11096 KB	Output is correct
3	Correct	19 ms	10692 KB	Output is correct
4	Correct	5 ms	6972 KB	Output is correct
5	Correct	10 ms	8128 KB	Output is correct
6	Correct	25 ms	12716 KB	Output is correct
7	Correct	3 ms	6868 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	6868 KB	Output is correct
2	Correct	24 ms	11096 KB	Output is correct
3	Correct	19 ms	10692 KB	Output is correct
4	Correct	5 ms	6972 KB	Output is correct
5	Correct	10 ms	8128 KB	Output is correct
6	Correct	25 ms	12716 KB	Output is correct
7	Correct	3 ms	6868 KB	Output is correct
8	Correct	37 ms	13744 KB	Output is correct
9	Correct	36 ms	13952 KB	Output is correct
10	Correct	67 ms	17356 KB	Output is correct
11	Correct	4 ms	6868 KB	Output is correct
12	Correct	3 ms	6976 KB	Output is correct
13	Correct	3 ms	6868 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	6868 KB	Output is correct
2	Correct	24 ms	11096 KB	Output is correct
3	Correct	19 ms	10692 KB	Output is correct
4	Correct	5 ms	6972 KB	Output is correct
5	Correct	10 ms	8128 KB	Output is correct
6	Correct	25 ms	12716 KB	Output is correct
7	Correct	3 ms	6868 KB	Output is correct
8	Correct	37 ms	13744 KB	Output is correct
9	Correct	36 ms	13952 KB	Output is correct
10	Correct	67 ms	17356 KB	Output is correct
11	Correct	4 ms	6868 KB	Output is correct
12	Correct	3 ms	6976 KB	Output is correct
13	Correct	3 ms	6868 KB	Output is correct
14	Correct	69 ms	19152 KB	Output is correct
15	Execution timed out	1083 ms	10028 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-