oj.uz

Submission #132751

# Submission time Handle Problem Language Result Execution time Memory
132751 2019-07-19T12:59:27 Z hugo_pm Mechanical Doll (IOI18_doll) C++17
53 / 100
 203 ms 16056 KB 
#include "doll.h"
#include <vector>
#include <cassert>
#include <iostream>
using namespace std;

vector<int> seqVoulue;
vector<vector<int>> sortiesVoulues;

vector<int> dirSort;
vector<int> sw1, sw2;


int lenSeq;
int nbTriggers;
int nbSwitchs = 0;

int newSwitch()
{
	++nbSwitchs;
	sw1.push_back(0);
	sw2.push_back(0);
	return nbSwitchs;
}

void repartir(int switchId, vector<int> sortiesOrd)
{
	assert(switchId > 0);
	int sz = sortiesOrd.size();
	assert(sz >= 2);

	int IND = switchId-1;

	if (sz == 2) {
		sw1[IND] = sortiesOrd.front();
		sw2[IND] = sortiesOrd.back();
	} else {
		vector<vector<int>> subSor(2);
		for (int i = 0; i < sz; ++i) {
			subSor[i%2].push_back(sortiesOrd[i]);
		}
		if (subSor[0].size() > subSor[1].size()) {
			subSor[1].push_back(subSor[0].back());
			subSor[0].back() = -switchId;
		}
		sw1[IND] = -newSwitch();
		sw2[IND] = -newSwitch();

		repartir(-sw1[IND], subSor[0]);
		repartir(-sw2[IND], subSor[1]);
	}
}

void create_circuit(int M, std::vector<int> A) {
	nbTriggers = M;
	seqVoulue = A;
	lenSeq = seqVoulue.size();
	sortiesVoulues.resize(nbTriggers + 1);
	dirSort.resize(nbTriggers + 1);

	sortiesVoulues[0].push_back(seqVoulue.front());

	for (int pos = 0; pos < lenSeq; ++pos) {
		int cur = seqVoulue[pos];
		int suiv = 0;
		if (pos + 1 < lenSeq) {
			suiv = seqVoulue[pos+1];
		}
		sortiesVoulues[cur].push_back(suiv);
	}

	for (int trig = 0; trig <= nbTriggers; ++trig) {
		int szVoulu = sortiesVoulues[trig].size();
		if (szVoulu == 0) {
			dirSort[trig] = 0;
		} else if (szVoulu == 1) {
			dirSort[trig] = sortiesVoulues[trig].front();
		} else {
			int sid = newSwitch();
			dirSort[trig] = -sid;
			repartir(sid, sortiesVoulues[trig]);
		}
	}

	answer(dirSort, sw1, sw2);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 34 ms 6552 KB Output is correct
3 Correct 25 ms 5444 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 50 ms 8040 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 34 ms 6552 KB Output is correct
3 Correct 25 ms 5444 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 50 ms 8040 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 61 ms 7948 KB Output is correct
9 Correct 67 ms 9128 KB Output is correct
10 Correct 96 ms 11832 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 34 ms 6552 KB Output is correct
3 Correct 25 ms 5444 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 50 ms 8040 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 61 ms 7948 KB Output is correct
9 Correct 67 ms 9128 KB Output is correct
10 Correct 96 ms 11832 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 117 ms 12612 KB Output is correct
15 Correct 63 ms 6460 KB Output is correct
16 Correct 101 ms 9736 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 108 ms 12004 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 75 ms 7108 KB Output is correct
3 Partially correct 125 ms 12056 KB Output is partially correct
4 Partially correct 141 ms 12956 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 75 ms 7108 KB Output is correct
3 Partially correct 125 ms 12056 KB Output is partially correct
4 Partially correct 141 ms 12956 KB Output is partially correct
5 Partially correct 149 ms 14072 KB Output is partially correct
6 Partially correct 171 ms 14784 KB Output is partially correct
7 Partially correct 162 ms 14564 KB Output is partially correct
8 Partially correct 178 ms 15112 KB Output is partially correct
9 Partially correct 138 ms 11328 KB Output is partially correct
10 Partially correct 179 ms 16056 KB Output is partially correct
11 Partially correct 203 ms 15448 KB Output is partially correct
12 Partially correct 121 ms 10416 KB Output is partially correct
13 Partially correct 134 ms 9724 KB Output is partially correct
14 Partially correct 111 ms 9508 KB Output is partially correct
15 Partially correct 97 ms 9156 KB Output is partially correct
16 Partially correct 4 ms 548 KB Output is partially correct
17 Partially correct 97 ms 8180 KB Output is partially correct
18 Partially correct 98 ms 8152 KB Output is partially correct
19 Partially correct 118 ms 8664 KB Output is partially correct
20 Partially correct 139 ms 11220 KB Output is partially correct
21 Partially correct 164 ms 13300 KB Output is partially correct
22 Partially correct 137 ms 10328 KB Output is partially correct