oj.uz

Submission #911357

# Submission time Handle Problem Language Result Execution time Memory
911357 2024-01-18T20:01:25 Z biank Mechanical Doll (IOI18_doll) C++14
47 / 100
 86 ms 15428 KB 
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
#define SIZE(x) (int)x.size()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define pb push_back
typedef vector<int> vi;

int n;

void dfs(int u, vi &v, vi &s, int a) {
    if(u>=n) {
        v[u]=a;
        return;
    }
    s[u]^=1;
    if(s[u]) dfs(2*u,v,s,a);
    else dfs(2*u+1,v,s,a);
}

void create_circuit(int m, vi a) {
    vi c(m+1);
    c[0]=a[0];
    forsn(i,1,m+1) c[i]=-1;
    n=1;
    while(n<SIZE(a)) n*=2;
    while(SIZE(a)<n) a.pb(-1);
    a.pb(0);
    vi v(2*n,0), s(n,0);
    forn(i,n) v[i] = -i-1;
    forsn(i,1,n+1) dfs(0,v,s,a[i]);
    vi state(2*n,0);
    vi x(n), y(n);
    forn(i,n) x[i]=v[2*i], y[i]=v[2*i+1];
    answer(c,x,y);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
9.0000000018 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Correct 37 ms 7984 KB Output is correct
3 Partially correct 66 ms 14160 KB Output is partially correct
4 Partially correct 72 ms 14916 KB Output is partially correct

Subtask #6
28.0000000056 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Correct 37 ms 7984 KB Output is correct
3 Partially correct 66 ms 14160 KB Output is partially correct
4 Partially correct 72 ms 14916 KB Output is partially correct
5 Partially correct 86 ms 15396 KB Output is partially correct
6 Partially correct 75 ms 15264 KB Output is partially correct
7 Partially correct 79 ms 15428 KB Output is partially correct
8 Partially correct 73 ms 15172 KB Output is partially correct
9 Partially correct 65 ms 14180 KB Output is partially correct
10 Partially correct 75 ms 15028 KB Output is partially correct
11 Partially correct 71 ms 14916 KB Output is partially correct
12 Partially correct 73 ms 14116 KB Output is partially correct
13 Correct 42 ms 8024 KB Output is correct
14 Partially correct 70 ms 14376 KB Output is partially correct
15 Partially correct 68 ms 14416 KB Output is partially correct
16 Partially correct 2 ms 1116 KB Output is partially correct
17 Correct 37 ms 8020 KB Output is correct
18 Correct 37 ms 8024 KB Output is correct
19 Partially correct 66 ms 14160 KB Output is partially correct
20 Partially correct 73 ms 15008 KB Output is partially correct
21 Partially correct 73 ms 14924 KB Output is partially correct
22 Partially correct 72 ms 14896 KB Output is partially correct