oj.uz

Submission #1112433

# Submission time Handle Problem Language Result Execution time Memory
1112433 2024-11-14T07:47:46 Z thelegendary08 Mechanical Doll (IOI18_doll) C++14
25 / 100
 60 ms 12228 KB 
#include "doll.h"
#include<bits/stdc++.h>
#define vi vector<int>
#define pb push_back
#define vvi vector<vector<int>>
#define f0r(i,n) for(int i = 0; i<n; i++)
using namespace std;
void create_circuit(int M, std::vector<int> A) {
	if(M == 1 && A.size() != 1){
		vi v;
		v.pb(0);
		for(auto u : A)v.pb(u);
		v.pb(0);
		int n = v.size() - 2;
		int mx = ceil(log2(n));
		int bts = (1 << mx) - n;
		int num = -1;
		vi x; 
		vi y;
		vi c(M + 1);
		c[0] = 1;
		c[1] = -1;
		f0r(i, mx){
			f0r(j, (1 << i)){
				if(i != mx - 1){
					x.pb(num * 2);
					y.pb(num * 2 - 1);
				}
				else{
					x.pb(1);
					y.pb(1);
				}
				
				num--;
			}
		}
		//cout<<bts<<'\n';
		for(int i = (1 << (mx - 1)); i < (1 << mx) - 1; i++){
			if(bts >= 2){
				x[i - 1] = -1;
				y[i-1] = -1;
				bts -= 2;
			}
			else if(bts == 1){
				x[i-1] = -1;
				bts--;
			}
		}
		y[y.size() - 1] = 0;
		//vout(c);
		//vout(x);
		//vout(y);
		answer(c,x,y);
	}
	else{
		vi v;
		v.pb(0);
		for(auto u : A)v.pb(u);
		v.pb(0);
		vvi nxt(M+1);
		f0r(i, v.size() - 1){
			nxt[v[i]].pb(v[i+1]);
		}
		int num = -1;
		vi c(M+1);
		vi x;
		vi y;
		f0r(i, M+1){
			if(nxt[i].size() == 1){
				c[i] = nxt[i][0];
			}
			else if(nxt[i].size() == 2){
				c[i] = num;
				x.pb(nxt[i][0]);
				y.pb(nxt[i][1]);
				num--;
			}
			else if(nxt[i].size() == 3){
				c[i] = num;
				x.pb(num-1);
				y.pb(num - 2);
				num--;
				x.pb(nxt[i][0]);
				y.pb(nxt[i][1]);
				num--;
				x.pb(c[i]);
				y.pb(nxt[i][2]);
				num--;
			}
			else if(nxt[i].size() == 4){
				c[i] = num;
				x.pb(num-1);
				y.pb(num - 2);
				num--;
				x.pb(nxt[i][0]);
				y.pb(nxt[i][2]);
				num--;
				x.pb(nxt[i][1]);
				y.pb(nxt[i][3]);
				num--;
			}
		}
		
		answer(c,x,y);
	}
	
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:6:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define f0r(i,n) for(int i = 0; i<n; i++)
......
   61 |   f0r(i, v.size() - 1){
      |       ~~~~~~~~~~~~~~~             
doll.cpp:61:3: note: in expansion of macro 'f0r'
   61 |   f0r(i, v.size() - 1){
      |   ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6600 KB Output is correct
3 Correct 16 ms 5576 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 7 ms 3920 KB Output is correct
6 Correct 23 ms 8136 KB Output is correct
7 Correct 1 ms 336 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6600 KB Output is correct
3 Correct 16 ms 5576 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 7 ms 3920 KB Output is correct
6 Correct 23 ms 8136 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 32 ms 8900 KB Output is correct
9 Correct 33 ms 9828 KB Output is correct
10 Correct 47 ms 12228 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6600 KB Output is correct
3 Correct 16 ms 5576 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 7 ms 3920 KB Output is correct
6 Correct 23 ms 8136 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 32 ms 8900 KB Output is correct
9 Correct 33 ms 9828 KB Output is correct
10 Correct 47 ms 12228 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 60 ms 11728 KB Output is correct
15 Correct 32 ms 7620 KB Output is correct
16 Correct 48 ms 9456 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 52 ms 11560 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB Output is partially correct
2 Correct 30 ms 5564 KB Output is correct
3 Partially correct 41 ms 8176 KB Output is partially correct
4 Partially correct 46 ms 9900 KB Output is partially correct

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB Output is partially correct
2 Correct 30 ms 5564 KB Output is correct
3 Partially correct 41 ms 8176 KB Output is partially correct
4 Partially correct 46 ms 9900 KB Output is partially correct
5 Incorrect 32 ms 6256 KB wrong motion
6 Halted 0 ms 0 KB -