oj.uz

Submission #79037

# Submission time Handle Problem Language Result Execution time Memory
79037 2018-10-10T18:17:02 Z doowey Mechanical Doll (IOI18_doll) C++14
6 / 100
 125 ms 14460 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

const int N = (int)2e5 + 912;

vector<int> fow[N];

void create_circuit(int m, vector<int> A) {	
	vector<int> c;
	vector<int> xi, yi;
	A.push_back(0);
	int nx, cr;
	for(int i = 0; i + 1 < (int)A.size(); i ++ ){
		nx = A[i + 1];
		cr = A[i];
		fow[cr].push_back(nx);
	}
	int n1, n2;
	int p = -1;
	for(int i = 0; i <= m; i ++ ){
		if(fow[i].size() == 0){
			if(i != 0)c.push_back(0);
			else if(i == 0)c.push_back(A[0]);
		}
		else if(fow[i].size() == 1 or (fow[i].size() == 2 and fow[i][0] == fow[i][1])){
			n1 = fow[i][0];
			c.push_back(n1);
		}
		else{
			c.push_back(p);
			-- p;
			n1 = fow[i][0];
			n2 = fow[i][1];
			xi.push_back(n1);
			yi.push_back(n2);
		}
	}
	answer(c, xi, yi);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 39 ms 8780 KB Output is correct
3 Correct 35 ms 8268 KB Output is correct
4 Correct 5 ms 4940 KB Output is correct
5 Correct 16 ms 6212 KB Output is correct
6 Correct 48 ms 10052 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 39 ms 8780 KB Output is correct
3 Correct 35 ms 8268 KB Output is correct
4 Correct 5 ms 4940 KB Output is correct
5 Correct 16 ms 6212 KB Output is correct
6 Correct 48 ms 10052 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 62 ms 11276 KB Output is correct
9 Correct 77 ms 11820 KB Output is correct
10 Correct 125 ms 14460 KB Output is correct
11 Correct 5 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 39 ms 8780 KB Output is correct
3 Correct 35 ms 8268 KB Output is correct
4 Correct 5 ms 4940 KB Output is correct
5 Correct 16 ms 6212 KB Output is correct
6 Correct 48 ms 10052 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 62 ms 11276 KB Output is correct
9 Correct 77 ms 11820 KB Output is correct
10 Correct 125 ms 14460 KB Output is correct
11 Correct 5 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Incorrect 71 ms 11908 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0.0 / 18.0

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

Subtask #6
0.0 / 56.0

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