oj.uz

답안 #788555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788555 2023-07-20T10:58:22 Z Andrey 자동 인형 (IOI18_doll) C++14
100 / 100
 103 ms 17132 KB 
#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+1));
    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 < bruh.size(); i++) {
        haha[0].push_back(bruh[i]);
    }
    for(int i = 0; i < m+1; i++) {
        c[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:47:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i = 0; i < bruh.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
doll.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             while(e*2 < haha[i].size()) {
      |                   ~~~~^~~~~~~~~~~~~~~~
doll.cpp:71:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for(int j = 0; j < haha[i].size(); j++) {
      |                            ~~^~~~~~~~~~~~~~~~
doll.cpp:44:9: warning: unused variable 'n' [-Wunused-variable]
   44 |     int n = bruh.size();
      |         ^
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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 36 ms 10864 KB Output is correct
3 Correct 33 ms 10840 KB Output is correct
4 Correct 3 ms 6868 KB Output is correct
5 Correct 11 ms 8148 KB Output is correct
6 Correct 53 ms 12616 KB Output is correct
7 Correct 3 ms 6868 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 36 ms 10864 KB Output is correct
3 Correct 33 ms 10840 KB Output is correct
4 Correct 3 ms 6868 KB Output is correct
5 Correct 11 ms 8148 KB Output is correct
6 Correct 53 ms 12616 KB Output is correct
7 Correct 3 ms 6868 KB Output is correct
8 Correct 71 ms 13536 KB Output is correct
9 Correct 70 ms 13892 KB Output is correct
10 Correct 103 ms 17132 KB Output is correct
11 Correct 3 ms 6868 KB Output is correct
12 Correct 3 ms 6868 KB Output is correct
13 Correct 3 ms 6868 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 36 ms 10864 KB Output is correct
3 Correct 33 ms 10840 KB Output is correct
4 Correct 3 ms 6868 KB Output is correct
5 Correct 11 ms 8148 KB Output is correct
6 Correct 53 ms 12616 KB Output is correct
7 Correct 3 ms 6868 KB Output is correct
8 Correct 71 ms 13536 KB Output is correct
9 Correct 70 ms 13892 KB Output is correct
10 Correct 103 ms 17132 KB Output is correct
11 Correct 3 ms 6868 KB Output is correct
12 Correct 3 ms 6868 KB Output is correct
13 Correct 3 ms 6868 KB Output is correct
14 Correct 102 ms 16868 KB Output is correct
15 Correct 67 ms 13156 KB Output is correct
16 Correct 97 ms 16808 KB Output is correct
17 Correct 3 ms 6868 KB Output is correct
18 Correct 3 ms 6868 KB Output is correct
19 Correct 4 ms 6868 KB Output is correct
20 Correct 98 ms 16960 KB Output is correct
21 Correct 3 ms 6868 KB Output is correct
22 Correct 4 ms 6996 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 3 ms 6868 KB Output is correct
3 Correct 4 ms 6872 KB Output is correct
4 Correct 3 ms 6868 KB Output is correct
5 Correct 3 ms 6968 KB Output is correct
6 Correct 3 ms 6972 KB Output is correct
7 Correct 3 ms 6868 KB Output is correct
8 Correct 3 ms 6972 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 63 ms 12388 KB Output is correct
3 Correct 63 ms 12320 KB Output is correct
4 Correct 89 ms 15284 KB Output is correct

Subtask #6
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6868 KB Output is correct
2 Correct 63 ms 12388 KB Output is correct
3 Correct 63 ms 12320 KB Output is correct
4 Correct 89 ms 15284 KB Output is correct
5 Correct 99 ms 16524 KB Output is correct
6 Correct 97 ms 16296 KB Output is correct
7 Correct 96 ms 16412 KB Output is correct
8 Correct 98 ms 16080 KB Output is correct
9 Correct 60 ms 12372 KB Output is correct
10 Correct 96 ms 16164 KB Output is correct
11 Correct 88 ms 15716 KB Output is correct
12 Correct 62 ms 12616 KB Output is correct
13 Correct 67 ms 13052 KB Output is correct
14 Correct 67 ms 13072 KB Output is correct
15 Correct 63 ms 13232 KB Output is correct
16 Correct 4 ms 7124 KB Output is correct
17 Correct 54 ms 13312 KB Output is correct
18 Correct 63 ms 12612 KB Output is correct
19 Correct 61 ms 12540 KB Output is correct
20 Correct 97 ms 15916 KB Output is correct
21 Correct 98 ms 15616 KB Output is correct
22 Correct 95 ms 15788 KB Output is correct