Submission #94983

# Submission time Handle Problem Language Result Execution time Memory
94983 2019-01-26T12:10:48 Z someone_aa Mechanical Doll (IOI18_doll) C++17
16 / 100
123 ms 11748 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++) {
        //cout<<i<<": "<<after[i].size()<<"\n";
        if(after[i].size() == 0) continue;
        else if(after[i].size() == 1) {
            C[i] = after[i][0];
        }
        else if(after[i].size() == 2){
            C[i] = -br;
            X.pb(after[i][0]);
            Y.pb(after[i][1]);
            br++;
        }
        else if(after[i].size() == 3) {
            C[i] = -br;
            int lbr = br + 1;
            int rbr = br + 2;
            X.pb(-lbr);
            Y.pb(-rbr);

            //cout<<i<<": "<<(-lbr)<<" and "<<(-rbr)<<"\n";

            X.pb(after[i][0]);
            Y.pb(-br);

           //cout<<after[i][0]<<" "<<i<<"\n";

            X.pb(after[i][1]);
            Y.pb(after[i][2]);


            br += 3;
        }
        else {
            C[i] = -br;
            int lbr = br + 1;
            int rbr = br + 2;

            X.pb(-lbr);
            Y.pb(-rbr);
            X.pb(after[i][0]);
            Y.pb(after[i][2]);
            X.pb(after[i][1]);
            Y.pb(after[i][3]);
            br += 3;
        }
    }
    /*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();
      |         ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6348 KB Output is correct
3 Correct 30 ms 5920 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 46 ms 7652 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6348 KB Output is correct
3 Correct 30 ms 5920 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 46 ms 7652 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 68 ms 8036 KB Output is correct
9 Correct 56 ms 8664 KB Output is correct
10 Correct 94 ms 10972 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6348 KB Output is correct
3 Correct 30 ms 5920 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 46 ms 7652 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 68 ms 8036 KB Output is correct
9 Correct 56 ms 8664 KB Output is correct
10 Correct 94 ms 10972 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Correct 123 ms 11748 KB Output is correct
15 Correct 57 ms 7384 KB Output is correct
16 Correct 86 ms 9796 KB Output is correct
17 Correct 4 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 88 ms 11056 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 3 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2636 KB wrong motion
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2636 KB wrong motion
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2636 KB wrong motion
2 Halted 0 ms 0 KB -