oj.uz

Submission #94980

# Submission time Handle Problem Language Result Execution time Memory
94980 2019-01-26T11:46:54 Z someone_aa Mechanical Doll (IOI18_doll) C++17
6 / 100
 93 ms 10972 KB 
#include <bits/stdc++.h>
#include "doll.h"
#define pb push_back
#define mp make_pair
using namespace std;
const int maxm = 100100;
vector<int> after[maxm];

void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    std::vector<int> C(M + 1, 0);
    C[0] = A[0];
    for(int i=1;i<A.size();i++) {
       after[A[i-1]].pb(A[i]);
    }
    after[A.back()].pb(0);

    vector<int> X, Y;
    int br = 1;
    for(int i=1;i<=M;i++) {
        if(after[i].size() == 0) continue;
        else if(after[i].size() == 1) {
            C[i] = after[i][0];
        }
        else {
            C[i] = -br;
            X.pb(after[i][0]);
            Y.pb(after[i][1]);
            br++;
        }
    }
    /*for (int k = 0; k < N; ++k) {
        X[k] = Y[k] = A[k];
    }*/
    answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=1;i<A.size();i++) {
      |                 ~^~~~~~~~~
doll.cpp:10:9: warning: unused variable 'N' [-Wunused-variable]
   10 |     int N = A.size();
      |         ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 40 ms 6368 KB Output is correct
3 Correct 31 ms 5964 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 39 ms 7648 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 40 ms 6368 KB Output is correct
3 Correct 31 ms 5964 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 39 ms 7648 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 56 ms 8000 KB Output is correct
9 Correct 74 ms 8656 KB Output is correct
10 Correct 83 ms 10972 KB Output is correct
11 Correct 4 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2588 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 40 ms 6368 KB Output is correct
3 Correct 31 ms 5964 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 39 ms 7648 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 56 ms 8000 KB Output is correct
9 Correct 74 ms 8656 KB Output is correct
10 Correct 83 ms 10972 KB Output is correct
11 Correct 4 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2588 KB Output is correct
14 Incorrect 93 ms 8792 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0.0 / 18.0

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

Subtask #6
0.0 / 56.0

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