oj.uz

Submission #847384

# Submission time Handle Problem Language Result Execution time Memory
847384 2023-09-09T15:02:00 Z MinaRagy06 The Collection Game (BOI21_swaps) C++17
21 / 100
 37 ms 1664 KB 
#include <bits/stdc++.h>
#include "swaps.h"
#ifdef MINA
    #include "grader.cpp"
#endif
using namespace std;
typedef int64_t ll;

void solve(int n, int v) {
    for (int cur = 0; cur < n; cur++) {
        for (int i = (cur & 1); i + 1 < n; i += 2) {
            schedule(i + 1, i + 2);
        }
        visit();
    }
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = i + 1;
    }
    answer(a);
}

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3-1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct

Subtask #3-2
0 / 2.0

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

Subtask #4-1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 8 ms 436 KB Correct
4 Correct 32 ms 1416 KB Correct

Subtask #4-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 8 ms 436 KB Correct
4 Correct 32 ms 1416 KB Correct
5 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #5-1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 596 KB Correct
4 Correct 32 ms 912 KB Correct
5 Correct 37 ms 676 KB Correct

Subtask #5-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 596 KB Correct
4 Correct 32 ms 912 KB Correct
5 Correct 37 ms 676 KB Correct
6 Incorrect 0 ms 344 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 428 KB Correct
4 Correct 34 ms 1664 KB Correct
5 Correct 32 ms 1424 KB Correct
6 Runtime error 7 ms 852 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #6-2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 428 KB Correct
4 Correct 34 ms 1664 KB Correct
5 Correct 32 ms 1424 KB Correct
6 Runtime error 7 ms 852 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #7-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 416 KB Correct
4 Correct 33 ms 920 KB Correct
5 Correct 32 ms 916 KB Correct
6 Runtime error 7 ms 412 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #7-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 416 KB Correct
4 Correct 33 ms 920 KB Correct
5 Correct 32 ms 916 KB Correct
6 Runtime error 7 ms 412 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -