oj.uz

Submission #487348

# Submission time Handle Problem Language Result Execution time Memory
487348 2021-11-15T09:07:22 Z InternetPerson10 The Collection Game (BOI21_swaps) C++17
21 / 100
 49 ms 300 KB 
//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include <bits/stdc++.h>
#include "swaps.h"

using namespace std;

void solve(int n, int v) {
    vector<int> nums(n);
    for(int i = 0; i < n; i++) nums[i] = i+1;
    for(int i = 0; i < n; i++) {
        for(int j = i%2; j < n-1; j += 2) {
            schedule(j+1, j+2);
        }
        vector<int> v = visit();
    }
    answer(nums); 
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 280 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 200 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 2.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 16 ms 268 KB Correct
4 Correct 48 ms 300 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 16 ms 268 KB Correct
4 Correct 48 ms 300 KB Correct
5 Incorrect 0 ms 200 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 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 11 ms 200 KB Correct
4 Correct 49 ms 292 KB Correct
5 Correct 42 ms 296 KB Correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 11 ms 200 KB Correct
4 Correct 49 ms 292 KB Correct
5 Correct 42 ms 296 KB Correct
6 Incorrect 1 ms 200 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 15 ms 200 KB Correct
4 Correct 38 ms 296 KB Correct
5 Correct 38 ms 296 KB Correct
6 Runtime error 8 ms 276 KB Execution killed with signal 13

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 15 ms 200 KB Correct
4 Correct 38 ms 296 KB Correct
5 Correct 38 ms 296 KB Correct
6 Runtime error 8 ms 276 KB Execution killed with signal 13

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 2 ms 200 KB Correct
3 Correct 13 ms 268 KB Correct
4 Correct 38 ms 296 KB Correct
5 Correct 36 ms 296 KB Correct
6 Runtime error 8 ms 280 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 2 ms 200 KB Correct
3 Correct 13 ms 268 KB Correct
4 Correct 38 ms 296 KB Correct
5 Correct 36 ms 296 KB Correct
6 Runtime error 8 ms 280 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -