oj.uz

Submission #704928

# Submission time Handle Problem Language Result Execution time Memory
704928 2023-03-03T06:53:29 Z cig32 The Collection Game (BOI21_swaps) C++17
42 / 100
 7 ms 520 KB 
#include "swaps.h"
#include "bits/stdc++.h"
using namespace std;

void solve(int N, int V) {
  // TODO implement this function
  for(int i=1; i<=9; i++) {
    int tot = 0;
    for(int j=(1 << ((int) log2(N))); j>=1; j>>=1) {
      tot++;
      if(tot > i + 1) break;
      int count = 0;
      for(int k=1; k<=N; k+=(j<<1)) {
        for(int l=k; l<k+j; l++) {
          if((k<<1) + (j<<1) - 1 - l <= N) {
            count++;
            schedule(l, k + k+(j<<1)-1 - l);
          }
        }
      }
      if(!count) continue;
      vector<int> uni = visit();
    }
  }
  vector<int> identity;
  for(int i=1; i<=N; i++) identity.push_back(i);
  answer(identity);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 5 ms 304 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 5 ms 304 KB Correct
5 Incorrect 1 ms 208 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 5 ms 304 KB Correct
5 Correct 6 ms 276 KB Correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 1 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 5 ms 304 KB Correct
5 Correct 6 ms 276 KB Correct
6 Incorrect 1 ms 208 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #9
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 7 ms 300 KB Correct
5 Correct 5 ms 520 KB Correct
6 Correct 5 ms 288 KB Correct

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 7 ms 300 KB Correct
5 Correct 5 ms 520 KB Correct
6 Correct 5 ms 288 KB Correct
7 Incorrect 1 ms 208 KB Not correct
8 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 4 ms 300 KB Correct
4 Correct 5 ms 296 KB Correct
5 Correct 7 ms 384 KB Correct
6 Correct 5 ms 284 KB Correct
7 Runtime error 6 ms 276 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 4 ms 300 KB Correct
4 Correct 5 ms 296 KB Correct
5 Correct 7 ms 384 KB Correct
6 Correct 5 ms 284 KB Correct
7 Runtime error 6 ms 276 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -