oj.uz

Submission #946495

# Submission time Handle Problem Language Result Execution time Memory
946495 2024-03-14T17:18:36 Z PagodePaiva Mechanical Doll (IOI18_doll) C++17
6 / 100
 50 ms 13732 KB 
#include "doll.h"
#include<bits/stdc++.h>

using namespace std;

void create_circuit(int M, std::vector<int> A) {
  vector <int> v;
  v.push_back(0);
  for(auto x : A) v.push_back(x);
  int m = M;
  int n = v.size();
  vector <int> c, x, y;
  vector <int> g[m+1];
  v.push_back(0);
  for(int i = 0;i < (int) (v.size()) - 1;i++){
    int val = v[i], nx = v[i+1];
    g[val].push_back(nx);
  }
  int tp = -1;
  for(int i = 0;i <= m;i++){
    if(g[i].size() == 0) {
      c.push_back(0);
      continue;
    }
    if(g[i].size() == 1){
      c.push_back(g[i][0]);
      continue;
    }
    if(g[i].size() == 2){
      c.push_back(tp);
      x.push_back(g[i][0]);
      y.push_back(g[i][1]);
      tp--;
      continue;
    }
    if(g[i].size() == 3){
      c.push_back(tp);
      tp--;
      x.push_back(tp);
      y.push_back(g[i][2]);
      x.push_back(g[i][0]);
      y.push_back(g[i][1]);
      tp--;
      continue;
    }
    if(g[i].size() == 4){
      c.push_back(tp);
      tp--;
      x.push_back(tp);
      y.push_back(tp-1);
      x.push_back(g[i][0]);
      y.push_back(g[i][1]);
      tp--;
      tp--;
      x.push_back(g[i][2]);
      y.push_back(g[i][3]);
    }
  }
  // for(auto t : c){
  //   cout << t << ' ';
  // }
  answer(c, x, y);
  return;
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:11:7: warning: unused variable 'n' [-Wunused-variable]
   11 |   int n = v.size();
      |       ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 19 ms 7208 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 24 ms 9048 KB Output is correct
7 Correct 0 ms 344 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 19 ms 7208 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 24 ms 9048 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 32 ms 9100 KB Output is correct
9 Correct 34 ms 10448 KB Output is correct
10 Correct 49 ms 13732 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 19 ms 7208 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 4052 KB Output is correct
6 Correct 24 ms 9048 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 32 ms 9100 KB Output is correct
9 Correct 34 ms 10448 KB Output is correct
10 Correct 49 ms 13732 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 50 ms 12148 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong Answer: wrong array length
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong Answer: wrong array length
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong Answer: wrong array length
2 Halted 0 ms 0 KB -