oj.uz

Submission #847334

# Submission time Handle Problem Language Result Execution time Memory
847334 2023-09-09T13:44:02 Z Ahmed57 The Collection Game (BOI21_swaps) C++17
21 / 100
 38 ms 1660 KB 
#include <bits/stdc++.h>
using namespace std;
#include "swaps.h"
void solve(int n,int v){
    int rnks[n+1];
    for(int i = 1;i<=n;i++)rnks[i] = i;
    bool odd = 0;
    int its = n;
    while(its--){
        int st = odd+1;
        for(;st<n;st+=2){
            schedule(st,st+1);
        }
        vector<int> vis = visit();
        st = odd+1;int ind = 0;
        for(;st<n;st+=2){
            if(!vis[ind])swap(rnks[st],rnks[st+1]);
            ind++;
        }
        odd = !odd;
    }vector<int> lol;
    for(int i = 1;i<=n;i++){
        lol.push_back(rnks[i]);
    }
    answer(lol);
}

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 512 KB Correct
2 Correct 2 ms 344 KB Correct

Subtask #3-2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Correct
2 Correct 2 ms 344 KB Correct
3 Incorrect 0 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 3 ms 344 KB Correct
3 Correct 9 ms 436 KB Correct
4 Correct 32 ms 1172 KB Correct

Subtask #4-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 9 ms 436 KB Correct
4 Correct 32 ms 1172 KB Correct
5 Incorrect 1 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 512 KB Correct
3 Correct 10 ms 424 KB Correct
4 Correct 35 ms 1420 KB Correct
5 Correct 34 ms 1660 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 512 KB Correct
3 Correct 10 ms 424 KB Correct
4 Correct 35 ms 1420 KB Correct
5 Correct 34 ms 1660 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 412 KB Correct
4 Correct 34 ms 1184 KB Correct
5 Correct 38 ms 1164 KB Correct
6 Runtime error 7 ms 608 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 412 KB Correct
4 Correct 34 ms 1184 KB Correct
5 Correct 38 ms 1164 KB Correct
6 Runtime error 7 ms 608 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 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 420 KB Correct
4 Correct 34 ms 684 KB Correct
5 Correct 32 ms 660 KB Correct
6 Runtime error 7 ms 940 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 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 9 ms 420 KB Correct
4 Correct 34 ms 684 KB Correct
5 Correct 32 ms 660 KB Correct
6 Runtime error 7 ms 940 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -