oj.uz

Submission #95712

# Submission time Handle Problem Language Result Execution time Memory
95712 2019-02-02T07:59:43 Z oolimry Mechanical Doll (IOI18_doll) C++14
53 / 100
 262 ms 37812 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
std::set<int> sss;
void create_circuit(int M, std::vector<int> A) {
  int n = A.size();
  vector<int> C(M + 1);
  //C[0] = 1;
  //C[1] = -1;
  //C[2] = 1;
  //C[3] = 0;
  //C[4] = 0;
  int sw = -1;
  int xxx = 1;
  while(xxx < 1000000){
    sss.insert(xxx);
    xxx *= 2;
  }
  vector<int> X, Y;
 // X.push_back(2);
  //Y.push_back(3);

  vector<int> target[M+1];
  for(int i = 0;i < n-1;i++){
    target[A[i]].push_back(A[i+1]);
  }
  target[A[n-1]].push_back(0);
  target[0].push_back(A[0]);
  std::map<int, ii> mm;
  for(int i = 0;i <= M;i++){
    //printf("%d: ",i);


    if(target[i].size() == 0) C[i] = 0;
    else if(target[i].size() == 1) C[i] = target[i][0];
    else{
        int nn = *sss.lower_bound(target[i].size());
        int tree[2 * nn];
        tree[0] = 0;
        for(int j = nn;j < 2 * nn;j++){
            int l = j;
            int v = 0;
            while(l > 1){
                v *= 2;
                if(l % 2 == 1) v++;
                l /= 2;
            }
            tree[j] = v;
        }
        for(int j = 1;j < nn;j++){
            tree[j] = sw;
            sw--;
        }

        for(int j = nn;j < 2 * nn;j++){
            if(tree[j] < nn - target[i].size()) tree[j] = tree[1];
            else tree[j] = target[i][tree[j] - (nn - target[i].size())];
        }
        //for(int j = 0;j < 2 * nn;j++){
        //    printf("%d ",tree[j]);
        //}
        for(int j = 1;j < nn;j++){
            mm[tree[j]] = ii(tree[j*2],tree[j*2+1]);
        }
        C[i] = tree[1];
    }

    //printf("\n");
  }
  for(map<int,ii>::iterator it = mm.begin();it != mm.end();it++){
    X.push_back(it->second.first);
    Y.push_back(it->second.second);
  }
  reverse(X.begin(),X.end());
  reverse(Y.begin(),Y.end());
  /*
  for(int i = 0;i < C.size();i++){
    printf("%d ",C[i]);
  }
  printf("\n");
  for(int i = 0;i < X.size();i++){
    printf("%d %d\n",X[i],Y[i]);
  }
  */
  answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:57:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             if(tree[j] < nn - target[i].size()) tree[j] = tree[1];
      |                ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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 6348 KB Output is correct
3 Correct 25 ms 5144 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 41 ms 7660 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 6348 KB Output is correct
3 Correct 25 ms 5144 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 41 ms 7660 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 75 ms 11328 KB Output is correct
9 Correct 82 ms 11376 KB Output is correct
10 Correct 139 ms 17152 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 6348 KB Output is correct
3 Correct 25 ms 5144 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 41 ms 7660 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 75 ms 11328 KB Output is correct
9 Correct 82 ms 11376 KB Output is correct
10 Correct 139 ms 17152 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 164 ms 23456 KB Output is correct
15 Correct 99 ms 11956 KB Output is correct
16 Correct 137 ms 18084 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 145 ms 20068 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 85 ms 14604 KB Output is correct
3 Partially correct 153 ms 26596 KB Output is partially correct
4 Partially correct 164 ms 27364 KB Output is partially 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 85 ms 14604 KB Output is correct
3 Partially correct 153 ms 26596 KB Output is partially correct
4 Partially correct 164 ms 27364 KB Output is partially correct
5 Partially correct 204 ms 29524 KB Output is partially correct
6 Partially correct 253 ms 33300 KB Output is partially correct
7 Partially correct 246 ms 32128 KB Output is partially correct
8 Partially correct 262 ms 35384 KB Output is partially correct
9 Partially correct 154 ms 26268 KB Output is partially correct
10 Partially correct 238 ms 37540 KB Output is partially correct
11 Partially correct 237 ms 37812 KB Output is partially correct
12 Partially correct 168 ms 24928 KB Output is partially correct
13 Partially correct 160 ms 22020 KB Output is partially correct
14 Partially correct 137 ms 20916 KB Output is partially correct
15 Partially correct 140 ms 19400 KB Output is partially correct
16 Partially correct 4 ms 864 KB Output is partially correct
17 Partially correct 133 ms 19508 KB Output is partially correct
18 Partially correct 118 ms 19616 KB Output is partially correct
19 Partially correct 138 ms 21068 KB Output is partially correct
20 Partially correct 184 ms 26364 KB Output is partially correct
21 Partially correct 231 ms 32752 KB Output is partially correct
22 Partially correct 165 ms 25068 KB Output is partially correct