oj.uz

Submission #829944

# Submission time Handle Problem Language Result Execution time Memory
829944 2023-08-18T16:05:08 Z radaiosm7 Mechanical Doll (IOI18_doll) C++17
6 / 100
 70 ms 13016 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
int i, n, m, s, g, j, kk, ch;
vector<int> C;
vector<int> X;
vector<int> Y;
vector<int> adj[100005];
bool visited[100005];
bool finished[200005];
vector<vector<int> > groups;
vector<int> tmp;
bool vis;
vector<int> sw;
vector<int> st;
vector<pair<int, int> > pos;

void new_switch() {
  sw.push_back(--s);
  st.push_back(0);
  X.push_back(sw.front());
  Y.push_back(sw.front());
}

void dfs(int x) {
  if (st[-x-1] == 0) {
    st[-x-1] ^= 1;
    if (X[-x-1] == sw.front()) pos.push_back(make_pair(-x-1, 0));
    else dfs(X[-x-1]);
  }

  else {
    st[-x-1] ^= 1;
    if (Y[-x-1] == sw.front()) pos.push_back(make_pair(-x-1, 1));
    else dfs(Y[-x-1]);
  }
}

void create_switch(int i) {
  int num = (int)adj[i].size();
  if (num == 0) C[i] = i;

  else if (num == 1) C[i] = adj[i][0];

  else {
    sw.clear();
    new_switch();
    C[i] = s;
    kk = 2;
    j = 0;
    
    while (kk < num) {
      new_switch();
      ++kk;
      ++j;
      if (j&1) X[-sw[j>>1]-1] = s;
      else Y[-sw[(j-1)>>1]-1] = s;
    }

    pos.clear();
    for (int j=0; j < kk; ++j) dfs(sw.front());
    --kk;

    for (j=num-1; j >= 0; --j) {
      if (pos[kk].second == 0) X[pos[kk].first] = adj[i][j];
      else Y[pos[kk].first] = adj[i][j];
      --kk;
    }
  }
}

void create_circuit(int M, vector<int> A) {
  m = M;
  n = (int)A.size();
  fill(finished, finished+n+1, false);
  C.resize(m+1);
  X.clear();
  Y.clear();
  st.clear();
  s = 0;
  A.push_back(0);
  for (i=0; i < n; ++i) adj[A[i]].push_back(A[i+1]);
  C[0] = A[0];
  for (i=1; i <= m; ++i) create_switch(i);
  answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 18 ms 6480 KB Output is correct
3 Correct 14 ms 6092 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 21 ms 7932 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 18 ms 6480 KB Output is correct
3 Correct 14 ms 6092 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 21 ms 7932 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 33 ms 9300 KB Output is correct
9 Correct 35 ms 9676 KB Output is correct
10 Correct 50 ms 12748 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2656 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 18 ms 6480 KB Output is correct
3 Correct 14 ms 6092 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 21 ms 7932 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 33 ms 9300 KB Output is correct
9 Correct 35 ms 9676 KB Output is correct
10 Correct 50 ms 12748 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2656 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Incorrect 70 ms 13016 KB state 'Y'
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB state 'Y'
2 Halted 0 ms 0 KB -