oj.uz

Submission #1026642

# Submission time Handle Problem Language Result Execution time Memory
1026642 2024-07-18T08:58:40 Z Malix Mechanical Doll (IOI18_doll) C++14
84 / 100
 68 ms 12652 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

void create_circuit(int M, std::vector<int> A) {
  int n=A.size();
  vi c,x,y;
  vi p;
  REP(i,0,21)p.PB(pow(2,i));
  c.resize(M+1,-1);
  c[0]=A[0]; 
  vi a(M+1,0);
  vii b(M+1);
  a[0]=n;
  REP(i,1,n)b[0].PB(A[i]);
  b[0].PB(0);
  int k=0;
  REP(j,0,1){
    if(a[j]==0)continue;
    if(a[j]==1)c[j]=b[j][0];
    else if(a[j]==2){
      x.PB(b[j][0]);
      y.PB(b[j][1]);
    }
    else{
        k--;
        vi x1,y1;
        auto it=lower_bound(p.begin(),p.end(),a[j]);
        int k1=log2(*it);
        int pos=k;
        int t=0;
        x1.PB(inf);y1.PB(inf);
        REP(i,0,k1-1){
          REP(v,0,pow(2,i)){
            t++;
            x1.PB(pos-1);
            y1.PB(pos-2);
            pos-=2;
          }
        }
        REP(v,0,pow(2,k1-1)){
            x1.PB(k);
            y1.PB(k);
        }
        vi arr(*it,0);
        int g=*it;
        int pp=0;
        int r=0;
        g/=2;
        while(g){
          while(pp<*it){
            pp+=g;
            REP(i,pp,pp+g)arr[i]|=(1<<r);
            pp+=g;
          }
          r++;g/=2;pp=0;
        }
        pii brr;
        REP(i,1,a[j]+1)brr.PB({arr[*it-i],*it-i});
        sort(brr.begin(),brr.end());
        REP(i,0,a[j]){
          if(brr[i].S%2==0)x1[t+brr[i].S/2+1]=b[j][i];
          else y1[t+brr[i].S/2+1]=b[j][i];
        }
        int s=x1.size();
        for(int i=s-1;i>=2;i--)if(x1[i]==y1[i]){    
          if(i%2==0)x1[i/2]=y1[i];
          else y1[i/2]=y1[i];
          x1[i]=inf;y1[i]=inf;
        }
        pos=k;
        REP(i,1,s){
          if(x1[i]!=pos&&x1[i]!=inf){
            if(x1[i]<0){
              x.PB(k-1);
              k--;
            }
            else x.PB(x1[i]);
          }
          else if(x1[i]!=inf)x.PB(pos);
          if(y1[i]!=pos&&y1[i]!=inf){
            if(y1[i]<0){
              y.PB(k-1);
              k--;
            }
            else y.PB(y1[i]);
          }
          else if(y1[i]!=inf)y.PB(pos);
        }
    }
  }
  // for(auto u:c)cerr<<u<<" ";
  // cerr<<"\n";
  // for(auto u:x)cerr<<u<<" ";
  // cerr<<"\n";
  // for(auto u:y)cerr<<u<<" ";
  // cerr<<"\n";
  answer(c,x,y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 7108 KB Output is correct
3 Correct 23 ms 6732 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 35 ms 8784 KB Output is correct
7 Incorrect 0 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 7108 KB Output is correct
3 Correct 23 ms 6732 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 35 ms 8784 KB Output is correct
7 Incorrect 0 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 7108 KB Output is correct
3 Correct 23 ms 6732 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 35 ms 8784 KB Output is correct
7 Incorrect 0 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 21 ms 5444 KB Output is correct
3 Correct 25 ms 7904 KB Output is correct
4 Correct 38 ms 9072 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 21 ms 5444 KB Output is correct
3 Correct 25 ms 7904 KB Output is correct
4 Correct 38 ms 9072 KB Output is correct
5 Correct 68 ms 12652 KB Output is correct
6 Correct 62 ms 11876 KB Output is correct
7 Correct 60 ms 12044 KB Output is correct
8 Correct 59 ms 11632 KB Output is correct
9 Correct 35 ms 7916 KB Output is correct
10 Correct 56 ms 11376 KB Output is correct
11 Correct 58 ms 11204 KB Output is correct
12 Correct 52 ms 8260 KB Output is correct
13 Correct 35 ms 6984 KB Output is correct
14 Correct 41 ms 9796 KB Output is correct
15 Correct 42 ms 10100 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 38 ms 6736 KB Output is correct
18 Correct 33 ms 6468 KB Output is correct
19 Correct 41 ms 8052 KB Output is correct
20 Correct 57 ms 11280 KB Output is correct
21 Correct 60 ms 11180 KB Output is correct
22 Correct 58 ms 11384 KB Output is correct