oj.uz

Submission #787047

# Submission time Handle Problem Language Result Execution time Memory
787047 2023-07-18T17:03:55 Z APROHACK Mechanical Doll (IOI18_doll) C++17
47 / 100
 62 ms 11156 KB 
#include <bits/stdc++.h>
#include "doll.h"
#define ll long long
#define pb push_back
#define ff first
#define ss second
using namespace std;
int n, m, cur;

vector<int>c, x, y;
vector<int>a;

int generar(int desde, int cada, int div, bool lastt){
	if(div == 0){
		return a[desde];
	}
	if(a[desde] == -1 and ! lastt){
		return a[desde];
	}
	int posi = cur;
	int real = -(cur + 1);
	x.pb(0);
	y.pb(0);
	cur ++ ;
	x[posi] = generar(desde, cada*2, div-1, false);
	y[posi] = generar(desde + cada, cada*2, div-1, lastt);
	
	return real;
}

void create_circuit(int M, std::vector<int> A) {
	cur = 0;
	a = A;
	n = A.size();
	m = M;
	c.pb(A[0]);
	for(int i = 1 ; i <= M ; i ++)c.pb(-1);
	int k = 1, pot = 0;
	while(k <= a.size()-1 ){
		k *= 2;
		pot ++;
	}
	while(a.size()-1 < k)a.pb(-1);
	a.pop_back();
	a.push_back(0);
	c[A[0]] = generar(1, 1, pot, true);
	answer(c, x, y);
	
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:39:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  while(k <= a.size()-1 ){
      |        ~~^~~~~~~~~~~~~
doll.cpp:43:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |  while(a.size()-1 < k)a.pb(-1);
      |        ~~~~~~~~~~~^~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Correct 29 ms 5920 KB Output is correct
3 Partially correct 52 ms 8704 KB Output is partially correct
4 Partially correct 58 ms 10136 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Correct 29 ms 5920 KB Output is correct
3 Partially correct 52 ms 8704 KB Output is partially correct
4 Partially correct 58 ms 10136 KB Output is partially correct
5 Partially correct 59 ms 11156 KB Output is partially correct
6 Partially correct 58 ms 11024 KB Output is partially correct
7 Partially correct 60 ms 11008 KB Output is partially correct
8 Partially correct 55 ms 10196 KB Output is partially correct
9 Partially correct 59 ms 8732 KB Output is partially correct
10 Partially correct 56 ms 10732 KB Output is partially correct
11 Partially correct 55 ms 10476 KB Output is partially correct
12 Partially correct 62 ms 8924 KB Output is partially correct
13 Correct 31 ms 6328 KB Output is correct
14 Partially correct 57 ms 9480 KB Output is partially correct
15 Partially correct 52 ms 9356 KB Output is partially correct
16 Partially correct 2 ms 596 KB Output is partially correct
17 Correct 33 ms 6136 KB Output is correct
18 Correct 31 ms 6084 KB Output is correct
19 Partially correct 54 ms 9040 KB Output is partially correct
20 Partially correct 55 ms 10020 KB Output is partially correct
21 Partially correct 54 ms 10528 KB Output is partially correct
22 Partially correct 54 ms 10524 KB Output is partially correct