oj.uz

Submission #95734

# Submission time Handle Problem Language Result Execution time Memory
95734 2019-02-02T08:34:56 Z dwsc Mechanical Doll (IOI18_doll) C++14
6 / 100
 105 ms 11996 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    std::vector<int> C(M + 1);
    A.push_back(0);
    vector<int> X,Y;
    if (M == 1){
        if (N == 1){
            C[0] = 1;
            C[1] = 0;
        }
        else if (N == 2){
            C[0] = 1;
            C[1] = -1;
            X.push_back(1);
            Y.push_back(0);
        }
        answer(C,X,Y);
        return;
    }
    vector<int> adj[M+1];
    int cur = 0;
    for (int i = 0; i < N; i++){
        adj[cur].push_back(A[i]);
        cur = A[i];
    }
    adj[A[N-1]].push_back(0);
    int num = -1;
    for (int i = 0; i <= M; i++){
        unique(adj[i].begin(),adj[i].end());
        if (adj[i].size() == 0) C[i] = 0;
        else if (adj[i].size() == 1) C[i] = adj[i][0];
        else{
            C[i] = num--;
            X.push_back(adj[i][0]);
            Y.push_back(adj[i][1]);
        }
    }
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 36 ms 6288 KB Output is correct
3 Correct 40 ms 5140 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 48 ms 7692 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 36 ms 6288 KB Output is correct
3 Correct 40 ms 5140 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 48 ms 7692 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 59 ms 7708 KB Output is correct
9 Correct 75 ms 8732 KB Output is correct
10 Correct 105 ms 11996 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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 36 ms 6288 KB Output is correct
3 Correct 40 ms 5140 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 48 ms 7692 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 59 ms 7708 KB Output is correct
9 Correct 75 ms 8732 KB Output is correct
10 Correct 105 ms 11996 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 Incorrect 76 ms 8260 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0.0 / 18.0

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

Subtask #6
0.0 / 56.0

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