oj.uz

Submission #78720

# Submission time Handle Problem Language Result Execution time Memory
78720 2018-10-08T02:34:22 Z wleung_bvg Mechanical Doll (IOI18_doll) C++14
84 / 100
 182 ms 7400 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define all(a) (a).begin(),(a).end()
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define FOR(i,b) For(i,0,b)
#define Rev(i,a,b) for(auto i=(a);i>(b);i--)
#define REV(i,a) Rev(i,a,-1)
#define FORE(i,a) for(auto&&i:a)
#define sz(a) (int((a).size()))
using ll=long long;using ld=long double;using uint=unsigned int;using ull=unsigned long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pill=pair<int,ll>;using plli=pair<ll,int>;using pdd=pair<double,double>;using pld=pair<ld,ld>;
constexpr const char nl='\n',sp=' ';constexpr const int INT_INF=0x3f3f3f3f;constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f;
constexpr const double D_INF=numeric_limits<double>::infinity();constexpr const ld LD_INF=numeric_limits<ld>::infinity();constexpr const double EPS=1e-9;

const int MAXN = 2e5 + 5;

int N, H, cur = 1, X[MAXN * 2], Y[MAXN * 2];
bool T[MAXN * 2];

int build(int l, int r) {
    if (r < H - N) return 1;
    if (l >= r) return 0;
    int m = l + (r - l) / 2, ret = cur++;
    T[ret] = false;
    X[ret] = build(l, m);
    Y[ret] = build(m + 1, r);
    return ret;
}

void update(int i, int a) {
    int &j = T[i] ? Y[i] : X[i];
    T[i] = !T[i];
    assert(j >= 0);
    if (j == 0) j = -a;
    else update(j, a);
}

void create_circuit(int M, vector<int> A) {
    N = A.size();
    for (H = 1; H < N; H *= 2);
    build(0, H - 1);
    For(i, 1, N) update(1, A[i]);
    update(1, 0);
    For(i, 1, cur) {
        assert(!T[i]);
        X[i] = -X[i];
        Y[i] = -Y[i];
    }
    vector<int> C(M + 1, -1);
    C[0] = A[0];
    answer(C, vector<int>(X + 1, X + cur), vector<int>(Y + 1, Y + cur));
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 46 ms 3580 KB Output is correct
3 Correct 43 ms 3208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 1484 KB Output is correct
6 Correct 68 ms 4656 KB Output is correct
7 Incorrect 1 ms 204 KB wrong serial number

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 46 ms 3580 KB Output is correct
3 Correct 43 ms 3208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 1484 KB Output is correct
6 Correct 68 ms 4656 KB Output is correct
7 Incorrect 1 ms 204 KB wrong serial number

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 46 ms 3580 KB Output is correct
3 Correct 43 ms 3208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 1484 KB Output is correct
6 Correct 68 ms 4656 KB Output is correct
7 Incorrect 1 ms 204 KB wrong serial number

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 74 ms 4532 KB Output is correct
3 Correct 78 ms 4528 KB Output is correct
4 Correct 118 ms 6724 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 74 ms 4532 KB Output is correct
3 Correct 78 ms 4528 KB Output is correct
4 Correct 118 ms 6724 KB Output is correct
5 Correct 182 ms 7228 KB Output is correct
6 Correct 126 ms 7344 KB Output is correct
7 Correct 133 ms 7400 KB Output is correct
8 Correct 129 ms 7036 KB Output is correct
9 Correct 77 ms 4544 KB Output is correct
10 Correct 117 ms 7044 KB Output is correct
11 Correct 116 ms 6700 KB Output is correct
12 Correct 77 ms 4548 KB Output is correct
13 Correct 102 ms 4820 KB Output is correct
14 Correct 108 ms 4904 KB Output is correct
15 Correct 109 ms 5024 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 74 ms 4492 KB Output is correct
18 Correct 73 ms 4532 KB Output is correct
19 Correct 77 ms 4532 KB Output is correct
20 Correct 128 ms 6804 KB Output is correct
21 Correct 134 ms 6720 KB Output is correct
22 Correct 126 ms 6704 KB Output is correct