oj.uz

Submission #1026539

# Submission time Handle Problem Language Result Execution time Memory
1026539 2024-07-18T07:50:28 Z Malix Mechanical Doll (IOI18_doll) C++14
85.5534 / 100
 76 ms 11496 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,0);
  c[0]=A[0]; 
  vi a(M+1,0);
  vii b(M+1);
  REP(i,0,n)a[A[i]]++;
  REP(i,0,n-1)b[A[i]].PB(A[i+1]);
  b[A[n-1]].PB(0);
  int k=0;
  REP(j,1,M+1){
    if(a[j]==0)continue;
    if(a[j]==1)c[j]=b[j][0];
    else if(a[j]==2){
      c[j]=k-1;
      k--;
      x.PB(b[j][0]);
      y.PB(b[j][1]);
    }
    else{
        c[j]=k-1;
        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
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 16 ms 6844 KB Output is correct
3 Correct 14 ms 5468 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 23 ms 8256 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 16 ms 6844 KB Output is correct
3 Correct 14 ms 5468 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 23 ms 8256 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 27 ms 7640 KB Output is correct
9 Correct 32 ms 9176 KB Output is correct
10 Correct 42 ms 11496 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 16 ms 6844 KB Output is correct
3 Correct 14 ms 5468 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 23 ms 8256 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 27 ms 7640 KB Output is correct
9 Correct 32 ms 9176 KB Output is correct
10 Correct 42 ms 11496 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 68 ms 11252 KB Output is correct
15 Correct 36 ms 6092 KB Output is correct
16 Correct 55 ms 8892 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 60 ms 11048 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

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 344 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 0 ms 348 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 20 ms 4692 KB Output is correct
3 Correct 24 ms 7036 KB Output is correct
4 Correct 37 ms 7920 KB Output is correct

Subtask #6
41.5533523496 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 20 ms 4692 KB Output is correct
3 Correct 24 ms 7036 KB Output is correct
4 Correct 37 ms 7920 KB Output is correct
5 Partially correct 72 ms 11200 KB Output is partially correct
6 Partially correct 66 ms 10432 KB Output is partially correct
7 Partially correct 74 ms 10864 KB Output is partially correct
8 Partially correct 76 ms 9920 KB Output is partially correct
9 Correct 35 ms 5472 KB Output is correct
10 Correct 56 ms 9132 KB Output is correct
11 Partially correct 70 ms 8540 KB Output is partially correct
12 Partially correct 32 ms 5972 KB Output is partially correct
13 Partially correct 46 ms 7100 KB Output is partially correct
14 Partially correct 44 ms 7356 KB Output is partially correct
15 Partially correct 59 ms 7616 KB Output is partially correct
16 Partially correct 1 ms 604 KB Output is partially correct
17 Partially correct 31 ms 5832 KB Output is partially correct
18 Partially correct 33 ms 5468 KB Output is partially correct
19 Partially correct 37 ms 5564 KB Output is partially correct
20 Partially correct 49 ms 8228 KB Output is partially correct
21 Partially correct 51 ms 8420 KB Output is partially correct
22 Partially correct 48 ms 8128 KB Output is partially correct