oj.uz

Submission #1073833

# Submission time Handle Problem Language Result Execution time Memory
1073833 2024-08-24T22:58:44 Z Gabriel Mechanical Doll (IOI18_doll) C++17
6 / 100
 129 ms 11212 KB 
#include "doll.h"
#include "bits/stdc++.h"
using namespace std;
void create_circuit(int M, vector<int> A){
  int n = A.size();
  map<int, int> Mapa;
  bool _1 = 1, _2 = 1;
  for(int i = 0; i < n; i++){
    Mapa[A[i]]++;
    if(Mapa[A[i]] > 1) _1 = 0;
    if(Mapa[A[i]] > 2) _2 = 0; 
  }
  vector<int> c(M + 1, 0), x, y;
  if(M == 1){
    if(n == 1) c = {1, 0};
    else {
      c = {1, -1};
      int j = -1;
      for(int i = 0; i < n - 1; i++){
        if(j + 1 == 0) x.push_back(1);
        else x.push_back(j + 1);
        y.push_back(j - 1);
        j--;
      }
      y.back() = 0;
    }
  } else if(_1){
    for(int i = 0; i < n; i++){
      if(i == 0){
        c[0] = A[i];
      } else {
        c[A[i - 1]] = A[i];
      }
    }
  } else if(_2){
    vector<bool> Usados(M + 1, 0);
    int j = -1;
    A.push_back(0);
    for(int i = 0; i <= n; i++){
      if(i == 0){
        c[0] = A[i];
      } else {
        if(Usados[A[i - 1]]){
          x.push_back(c[A[i - 1]]);
          c[A[i - 1]] = j;
          j--;
          y.push_back(A[i]);
        } else {
          c[A[i - 1]] = A[i];
          Usados[A[i - 1]] = 1;
        }
      }
    }
  }
  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 36 ms 4968 KB Output is correct
3 Correct 36 ms 4772 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 62 ms 6968 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 36 ms 4968 KB Output is correct
3 Correct 36 ms 4772 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 62 ms 6968 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 75 ms 7348 KB Output is correct
9 Correct 86 ms 7876 KB Output is correct
10 Correct 129 ms 11212 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 36 ms 4968 KB Output is correct
3 Correct 36 ms 4772 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 62 ms 6968 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 75 ms 7348 KB Output is correct
9 Correct 86 ms 7876 KB Output is correct
10 Correct 129 ms 11212 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 113 ms 5824 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 24 ms 5584 KB over 20000000 inversions
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 24 ms 5584 KB over 20000000 inversions
3 Halted 0 ms 0 KB -