oj.uz

Submission #829476

# Submission time Handle Problem Language Result Execution time Memory
829476 2023-08-18T11:11:47 Z radaiosm7 Mechanical Doll (IOI18_doll) C++17
6 / 100
 57 ms 14148 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
int i, n, m, s, g, j, kk;
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;

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 {
    --s;
    C[i] = s;
    X.push_back(adj[i][0]);
    Y.push_back(adj[i][1]);
  }
}

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();
  s = 0;

  do {
    vis = false;
    tmp.clear();
    fill(visited, visited+m+1, false);

    for (i=0; i < n-1; ++i) {
      if (!finished[i] && !visited[A[i]]) {
        finished[i] = true;
        visited[A[i]] = true;
        tmp.push_back(i);
        vis = true;
      }
    }

    groups.push_back(tmp);
  } while(vis);

  g = (int)groups.size();

  for (i=0; i < g; ++i) {
    kk = (int)groups[i].size();
    for (j=0; j < kk; ++j) adj[A[groups[i][j]]].push_back(A[groups[i][j]+1]);
  }

  adj[A[n-1]].push_back(0);
  
  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 19 ms 6992 KB Output is correct
3 Correct 17 ms 6608 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 31 ms 8880 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 19 ms 6992 KB Output is correct
3 Correct 17 ms 6608 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 31 ms 8880 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 37 ms 9700 KB Output is correct
9 Correct 40 ms 10824 KB Output is correct
10 Correct 57 ms 14148 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 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 19 ms 6992 KB Output is correct
3 Correct 17 ms 6608 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 31 ms 8880 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 37 ms 9700 KB Output is correct
9 Correct 40 ms 10824 KB Output is correct
10 Correct 57 ms 14148 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2656 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Incorrect 51 ms 11744 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB wrong motion
2 Halted 0 ms 0 KB -