oj.uz

Submission #116362

# Submission time Handle Problem Language Result Execution time Memory
116362 2019-06-12T10:42:16 Z zubec Mechanical Doll (IOI18_doll) C++14
37 / 100
 302 ms 10508 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 200100;

int dir[N*4], n, sz;

pair<int, int> pr[N];

void add(int v, int l, int r, int x){
    if (l == r){
        //cout << "kek " << v << ' ' << v/2-sz/2+1 << ' ' << x << endl;
        if (v % 2 == 0)
            pr[v/2-sz/2+1].first = x; else
            pr[v/2-sz/2+1].second = x;
        return;
    }
    int mid = (l+r)>>1;
    if (dir[v] == 0)
        add(v+v, l, mid, x); else
        add(v+v+1, mid+1, r, x);
    dir[v] ^= 1;
}

void create_circuit(int M, std::vector<int> A) {
    n = A.size();
    sz = 1;
    while(sz < (n+1))
        sz += sz;
    for (int i = 1; i <= n; i++){
        add(1, 1, sz, A[i-1]);
    }
    for (int i = n+1; i < sz; i++){
        add(1, 1, sz, -1);
    }
    add(1, 1, sz, 0);
    vector <int> C, X, Y;
    C.push_back(-1);
    for (int i = 1; i <= M; i++)
        C.push_back(-1);
    for (int i = 1; i <= sz/2-1; i++){
        X.push_back(-(i+i));
        Y.push_back(-(i+i+1));
    }
    int kol = 0;
    for (int i = 1; i <= sz/2; i++){
        X.push_back(pr[i].first);
        Y.push_back(pr[i].second);
    }

    answer(C, X, Y);
}

/**

4 4
1 2 1 3

*/

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:46:9: warning: unused variable 'kol' [-Wunused-variable]
   46 |     int kol = 0;
      |         ^~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
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 #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 115 ms 9732 KB Output is partially correct
3 Partially correct 116 ms 9776 KB Output is partially correct
4 Partially correct 302 ms 10272 KB Output is partially correct

Subtask #6
28.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 115 ms 9732 KB Output is partially correct
3 Partially correct 116 ms 9776 KB Output is partially correct
4 Partially correct 302 ms 10272 KB Output is partially correct
5 Partially correct 161 ms 10508 KB Output is partially correct
6 Partially correct 127 ms 10416 KB Output is partially correct
7 Partially correct 133 ms 10416 KB Output is partially correct
8 Partially correct 130 ms 10380 KB Output is partially correct
9 Partially correct 117 ms 9772 KB Output is partially correct
10 Partially correct 126 ms 10284 KB Output is partially correct
11 Partially correct 145 ms 10204 KB Output is partially correct
12 Partially correct 125 ms 9696 KB Output is partially correct
13 Partially correct 141 ms 9724 KB Output is partially correct
14 Partially correct 142 ms 9776 KB Output is partially correct
15 Partially correct 118 ms 9772 KB Output is partially correct
16 Partially correct 6 ms 588 KB Output is partially correct
17 Correct 85 ms 5588 KB Output is correct
18 Partially correct 144 ms 9740 KB Output is partially correct
19 Partially correct 115 ms 9572 KB Output is partially correct
20 Partially correct 144 ms 10236 KB Output is partially correct
21 Partially correct 128 ms 10216 KB Output is partially correct
22 Partially correct 145 ms 10116 KB Output is partially correct