oj.uz

답안 #646799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646799 2022-09-30T17:30:27 Z slime 자동 인형 (IOI18_doll) C++14
90.611 / 100
 92 ms 11088 KB 
#include "doll.h"
#include "bits/stdc++.h"
using namespace std;

void create_circuit(int M, std::vector<int> A);

void answer(std::vector<int> C, std::vector<int> X, std::vector<int> Y);

int lg(int x) {
  return 32 - __builtin_clz(x) - 1;
}
vector<int> X, Y;

void create_circuit(int M, std::vector<int> A) {
  int N = A.size();

  int freq[M+1];
  for(int i=1; i<=M; i++) freq[i] = 0;

  for(int i=0; i<N; i++) freq[A[i]]++;

  int ma = 0;
  for(int i=1; i<=M; i++) ma = max(ma, freq[i]);
  vector<int> C(M + 1);
  for(int i=0; i<=M; i++) C[i] = 0;
  C[0] = A[0];
  vector<int> sequence;
  vector<int> empty;
  for(int i=0; i+1<N; i++) {
    sequence.push_back(A[i+1]);
  }
  
  if(ma <= 1) {
    for(int i=0; i<N; i++) C[A[i]] = (i+1 == N ? 0 : A[i+1]);
    answer(C, empty, empty);
    return; 
  }
  for(int i=1; i<=M; i++) C[i] = -1;
  if(N % 2 == 0) sequence.push_back(-1);
  if(ma <= 4 || N == 16) {
    X.resize(N + lg(N));
    Y.resize(N + lg(N));
  }
  else {
    X.resize(N + lg(N) + 1);
    Y.resize(N + lg(N) + 1);
  }
  int L = sequence.size();
  
  int bitcount = 1 + lg(L);
  int nxt = 0;
  int uwu = bitcount;
  for(int i=bitcount-1; i>=0; i--) {
    int val = (1 << i);
    Y[nxt] = (i == 0 ? 12073412 : nxt+1);
    // tree of size val: val - 1 swithces
    if(!(L & (1 << i))) X[nxt] = 0;
    else X[nxt] = uwu;
    nxt++;
    if(!(L & (1 << i))) continue;
    int seq = uwu + 1;
    for(int j=uwu; j<uwu+val/2-1; j++) {
      X[j] = seq;
      seq++;
      Y[j] = seq;
      seq++;
    }
    for(int j=uwu+val/2-1; j<uwu+val-1; j++) {
      X[j] = Y[j] = -1;
    }
    uwu += val - 1;
  }

  // Non-negative: switch
  // -1: to-be trigger
  // -2: origin

  int id = 0;
  int visits = 0;
  int state[N + lg(N)];
  for(int i=0; i<N+lg(N); i++) state[i] = 0;


  while(1) {
    int cur = 0;
    int prv;
    char u;
    bool done = 0;
    while(1) {
      //if(cur == 12073412) cout << "end\n";
      //else if(cur != -1) cout << -(cur + 1) << "\n";
      if(cur == -1) {
        if(u == 'X') X[prv] = -(sequence[id] + 1);
        else Y[prv] = -(sequence[id] + 1);
       // cout << sequence[id] << "\n";
        id++;
        break;
      }
      else if(cur == 12073412) {
        done = 1;
        break;
      }
      else if(state[cur] == 0) {
        state[cur] ^= 1;
        prv = cur;
        u = 'X';
        cur = X[cur];
      }
      else {
        state[cur] ^= 1;
        prv = cur;
        u = 'Y';
        cur = Y[cur];
      }
    }
    visits++;
    if(done) break;
  }


  for(int i=0; i<N+lg(N); i++) {
    if(X[i] == 12073412) X[i] = 0;
    else X[i] = -(X[i] + 1);
    if(Y[i] == 12073412) Y[i] = 0;
    else Y[i] = -(Y[i] + 1);
  }


//  for(int i=0; i<N+lg(N); i++) cout << state[i];
 // cout << "\n";

  answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 17 ms 3104 KB Output is correct
3 Correct 13 ms 2640 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 1748 KB Output is correct
6 Correct 21 ms 3748 KB Output is correct
7 Correct 1 ms 336 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 17 ms 3104 KB Output is correct
3 Correct 13 ms 2640 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 1748 KB Output is correct
6 Correct 21 ms 3748 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 61 ms 7396 KB Output is correct
9 Correct 67 ms 8052 KB Output is correct
10 Correct 92 ms 11088 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 17 ms 3104 KB Output is correct
3 Correct 13 ms 2640 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 1748 KB Output is correct
6 Correct 21 ms 3748 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 61 ms 7396 KB Output is correct
9 Correct 67 ms 8052 KB Output is correct
10 Correct 92 ms 11088 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 90 ms 10528 KB Output is correct
15 Correct 55 ms 7432 KB Output is correct
16 Correct 87 ms 10276 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 92 ms 10920 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #5
15.7161781332 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 300 KB Output is partially correct
2 Partially correct 54 ms 6412 KB Output is partially correct
3 Partially correct 51 ms 6424 KB Output is partially correct
4 Partially correct 85 ms 9664 KB Output is partially correct

Subtask #6
48.8947764144 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 300 KB Output is partially correct
2 Partially correct 54 ms 6412 KB Output is partially correct
3 Partially correct 51 ms 6424 KB Output is partially correct
4 Partially correct 85 ms 9664 KB Output is partially correct
5 Partially correct 85 ms 10236 KB Output is partially correct
6 Partially correct 83 ms 9920 KB Output is partially correct
7 Partially correct 86 ms 10036 KB Output is partially correct
8 Partially correct 84 ms 9792 KB Output is partially correct
9 Partially correct 52 ms 6456 KB Output is partially correct
10 Partially correct 82 ms 9732 KB Output is partially correct
11 Partially correct 83 ms 9708 KB Output is partially correct
12 Partially correct 53 ms 6504 KB Output is partially correct
13 Partially correct 54 ms 6612 KB Output is partially correct
14 Partially correct 52 ms 6556 KB Output is partially correct
15 Partially correct 58 ms 6748 KB Output is partially correct
16 Partially correct 2 ms 468 KB Output is partially correct
17 Partially correct 51 ms 6468 KB Output is partially correct
18 Partially correct 54 ms 6500 KB Output is partially correct
19 Partially correct 52 ms 6468 KB Output is partially correct
20 Partially correct 82 ms 9732 KB Output is partially correct
21 Partially correct 87 ms 9656 KB Output is partially correct
22 Partially correct 83 ms 9632 KB Output is partially correct