oj.uz

답안 #1111907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111907 2024-11-13T10:10:36 Z epicci23 자동 인형 (IOI18_doll) C++17
2 / 100
 1000 ms 7760 KB 
#include "bits/stdc++.h"
#include "doll.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

vector<int> x,y,state,hm;
int p=0,p2=0;

void give_index(int rt,int l,int r){
  if(l==r) return;
  x[rt] = (++p) * -1;
  y[rt] = (++p) * -1;
  int mid = (l+r)/2;
  give_index(x[rt],l,mid),give_index(y[rt],mid+1,r);
}

void make_leaf(int rt){
  if(rt==-1){
    while(1){};
    return;
  }
  if(state[rt]==0){
    if(x[rt]==-1) x[rt]=hm[p2++];
    else make_leaf(x[rt]);
  }
  else{
    if(y[rt]==-1) y[rt]=hm[p2++];
    else make_leaf(y[rt]);
  }
  state[rt]^=1;
}

void create_circuit(int m, vector<int> a){
  int n = sz(a);
  vector<int> c(m+1);
  vector<int> adj[m+5];

  for(int i=0;i<n;i++){
    if(i==0) adj[0].push_back(a[i]);
    else adj[a[i-1]].push_back(a[i]);
  }
  adj[a.back()].push_back(0);

  for(int i=0;i<=m;i++){
    if(sz(adj[i])==0) c[i]=i;
    else if(sz(adj[i])==1) c[i]=adj[i][0];
    else{
      int xd = sz(adj[i]);
      int leaf=1;
      while(leaf<xd) leaf<<=1;
      int nd = leaf - 1;
      for(int j=0;j<nd;j++){
        x.push_back(-1);
        y.push_back(-1);
        state.push_back(0);
      }
      c[i] = (++p) * -1;
      give_index(c[i],1,leaf/2);
      p2=0;
      hm=adj[i];
      for(int j=0;j<xd;j++) make_leaf(c[i]);
    }
  }

  answer(c, x, y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6480 KB Output is correct
3 Correct 17 ms 5200 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 11 ms 3920 KB Output is correct
6 Correct 27 ms 7760 KB Output is correct
7 Correct 1 ms 504 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6480 KB Output is correct
3 Correct 17 ms 5200 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 11 ms 3920 KB Output is correct
6 Correct 27 ms 7760 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Execution timed out 1073 ms 5200 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 19 ms 6480 KB Output is correct
3 Correct 17 ms 5200 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 11 ms 3920 KB Output is correct
6 Correct 27 ms 7760 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Execution timed out 1073 ms 5200 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1052 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1058 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1058 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -