oj.uz

Submission #847333

# Submission time Handle Problem Language Result Execution time Memory
847333 2023-09-09T13:42:48 Z Ahmed57 The Collection Game (BOI21_swaps) C++17
21 / 100
 340 ms 2168 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 = v;
    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 32 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 26 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 31 ms 344 KB Correct
2 Correct 87 ms 344 KB Correct

Subtask #3-2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 344 KB Correct
2 Correct 87 ms 344 KB Correct
3 Incorrect 30 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 34 ms 356 KB Correct
2 Correct 79 ms 344 KB Correct
3 Correct 176 ms 408 KB Correct
4 Correct 340 ms 1876 KB Correct

Subtask #4-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 356 KB Correct
2 Correct 79 ms 344 KB Correct
3 Correct 176 ms 408 KB Correct
4 Correct 340 ms 1876 KB Correct
5 Incorrect 27 ms 596 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #5-1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 344 KB Correct
2 Correct 98 ms 344 KB Correct
3 Correct 183 ms 412 KB Correct
4 Correct 327 ms 1764 KB Correct
5 Correct 32 ms 1164 KB Correct

Subtask #5-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 344 KB Correct
2 Correct 98 ms 344 KB Correct
3 Correct 183 ms 412 KB Correct
4 Correct 327 ms 1764 KB Correct
5 Correct 32 ms 1164 KB Correct
6 Incorrect 27 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 33 ms 344 KB Correct
2 Correct 82 ms 344 KB Correct
3 Correct 170 ms 412 KB Correct
4 Correct 323 ms 1908 KB Correct
5 Correct 33 ms 1424 KB Correct
6 Incorrect 7 ms 736 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #6-2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 344 KB Correct
2 Correct 82 ms 344 KB Correct
3 Correct 170 ms 412 KB Correct
4 Correct 323 ms 1908 KB Correct
5 Correct 33 ms 1424 KB Correct
6 Incorrect 7 ms 736 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #7-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 344 KB Correct
2 Correct 90 ms 344 KB Correct
3 Correct 172 ms 416 KB Correct
4 Correct 328 ms 2168 KB Correct
5 Correct 33 ms 1416 KB Correct
6 Incorrect 7 ms 1052 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #7-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 344 KB Correct
2 Correct 90 ms 344 KB Correct
3 Correct 172 ms 416 KB Correct
4 Correct 328 ms 2168 KB Correct
5 Correct 33 ms 1416 KB Correct
6 Incorrect 7 ms 1052 KB Not correct
7 Halted 0 ms 0 KB -