oj.uz

Submission #954858

# Submission time Handle Problem Language Result Execution time Memory
954858 2024-03-28T18:08:51 Z Trisanu_Das Mechanical Doll (IOI18_doll) C++17
53 / 100
 115 ms 17620 KB 
#include "doll.h"
#include <bits/stdc++.h>
std::vector < int > X,Y,C,nx[100005];
void build(int stt,std::vector < int > tar){
	X.push_back(0);
	Y.push_back(0);
	std::vector < int > G[2];
	int i,j,k;
	for(i=0;i<(int)tar.size();++i){
		G[i&1].push_back(tar[i]);
	}
	if((int)tar.size()&1){
		G[1].push_back(tar.back());
		G[0].back()=-stt-1;
	}
	for(i=0;i<2;++i){
		int *T=(i?&Y[stt]:&X[stt]);
		if((int)G[i].size()==1)
			*T=G[i][0];
		else{
			*T=-(int)X.size()-1;
			build((int)X.size(),G[i]);
		}
	}
}
void create_circuit(int M, std::vector<int> A) {
	C.resize(M+1);
	int i,j,k;
	for(i=0;i<(int)A.size();++i){
		nx[A[i]].push_back(i==((int)A.size()-1)?0:A[i+1]);
	}
	C[0]=A[0];
	X.clear();
	Y.clear();
	for(i=1;i<=M;++i){
		if(nx[i].size()==0)
			C[i]=i;
		else if(nx[i].size()==1)
			C[i]=nx[i][0];
		else{
			C[i]=-(int)X.size()-1;
			build((int)X.size(),nx[i]);
		}
	}
	answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void build(int, std::vector<int>)':
doll.cpp:8:8: warning: unused variable 'j' [-Wunused-variable]
    8 |  int i,j,k;
      |        ^
doll.cpp:8:10: warning: unused variable 'k' [-Wunused-variable]
    8 |  int i,j,k;
      |          ^
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:28:8: warning: unused variable 'j' [-Wunused-variable]
   28 |  int i,j,k;
      |        ^
doll.cpp:28:10: warning: unused variable 'k' [-Wunused-variable]
   28 |  int i,j,k;
      |          ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 17 ms 6864 KB Output is correct
3 Correct 14 ms 6492 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 21 ms 8548 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 17 ms 6864 KB Output is correct
3 Correct 14 ms 6492 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 21 ms 8548 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 34 ms 9156 KB Output is correct
9 Correct 34 ms 9688 KB Output is correct
10 Correct 51 ms 12544 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 17 ms 6864 KB Output is correct
3 Correct 14 ms 6492 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 21 ms 8548 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 34 ms 9156 KB Output is correct
9 Correct 34 ms 9688 KB Output is correct
10 Correct 51 ms 12544 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 71 ms 14120 KB Output is correct
15 Correct 44 ms 8400 KB Output is correct
16 Correct 65 ms 12052 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2788 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 62 ms 13168 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2852 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 2652 KB Output is partially correct
2 Correct 53 ms 8568 KB Output is correct
3 Partially correct 81 ms 14048 KB Output is partially correct
4 Partially correct 84 ms 13120 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2652 KB Output is partially correct
2 Correct 53 ms 8568 KB Output is correct
3 Partially correct 81 ms 14048 KB Output is partially correct
4 Partially correct 84 ms 13120 KB Output is partially correct
5 Partially correct 96 ms 14804 KB Output is partially correct
6 Partially correct 103 ms 15912 KB Output is partially correct
7 Partially correct 101 ms 15552 KB Output is partially correct
8 Partially correct 108 ms 16508 KB Output is partially correct
9 Partially correct 78 ms 13328 KB Output is partially correct
10 Partially correct 114 ms 17620 KB Output is partially correct
11 Partially correct 115 ms 17176 KB Output is partially correct
12 Partially correct 76 ms 12148 KB Output is partially correct
13 Partially correct 68 ms 11272 KB Output is partially correct
14 Partially correct 77 ms 10868 KB Output is partially correct
15 Partially correct 62 ms 10524 KB Output is partially correct
16 Partially correct 3 ms 2904 KB Output is partially correct
17 Partially correct 61 ms 9804 KB Output is partially correct
18 Partially correct 61 ms 9932 KB Output is partially correct
19 Partially correct 64 ms 10620 KB Output is partially correct
20 Partially correct 87 ms 12572 KB Output is partially correct
21 Partially correct 101 ms 14908 KB Output is partially correct
22 Partially correct 78 ms 12008 KB Output is partially correct