oj.uz

Submission #1096398

# Submission time Handle Problem Language Result Execution time Memory
1096398 2024-10-04T11:37:03 Z guagua0407 Mechanical Doll (IOI18_doll) C++17
10 / 100
 1 ms 348 KB 
#include "doll.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

const int inf=1e9;

void create_circuit(int m, std::vector<int> a) {
    int n=a.size();
    int lg=__lg(n-1)+1;
    vector<int> state(1<<lg);
    vector<vector<int>> to(1<<lg,vector<int>(2,inf));
    for(int i=1;i<(1<<lg);i++){
        if(i*2<(1<<lg)) to[i][0]=-(i*2);
        if(i*2+1<(1<<lg)) to[i][1]=-(i*2+1);
    }
    for(int i=0;i<n-1;i++){
        int nxt=a[i+1];
        int cur=1;
        while(to[cur][state[cur]]!=inf){
            state[cur]^=1;
            cur=-to[cur][state[cur]^1];
        }
        to[cur][state[cur]]=nxt;
        state[cur]^=1;
    }
    for(int i=n-1;i<(1<<lg);i++){
        int nxt=(i==(1<<lg)-1?0:inf);
        int cur=1;
        while(to[cur][state[cur]]!=inf){
            state[cur]^=1;
            cur=-to[cur][state[cur]^1];
        }
        to[cur][state[cur]]=nxt;
        state[cur]^=1;
    }
    vector<int> vec;
    for(int i=1;i<(1<<lg);i++){
        if(to[i][0]!=inf and to[i][1]!=inf){
            vec.push_back(i);
        }
    }
    vector<int> c(m+1,-1);
    c[0]=a[0];
    vector<int> x(vec.size()),y(vec.size());
    vector<int> id(1<<lg,inf);
    for(int i=0;i<(int)vec.size();i++){
        id[vec[i]]=i;
    }
    for(int i=1;i<(1<<lg);i++){
        if(id[i]==inf){
            to[i/2][i-(i/2)*2]=(to[i][0]==inf?to[i][1]:to[i][0]);
            if(to[i/2][i-(i/2)*2]==inf) to[i/2][i-(i/2)*2]=-1;
        }
    }
    for(int i=0;i<(int)vec.size();i++){
        x[i]=to[vec[i]][0];
        y[i]=to[vec[i]][1];
        assert(x[i]!=inf and y[i]!=inf);
    }
    answer(c,x,y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB wrong serial number
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB wrong serial number
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB wrong serial number
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB wrong serial number
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB wrong serial number
2 Halted 0 ms 0 KB -