oj.uz

Submission #1017058

# Submission time Handle Problem Language Result Execution time Memory
1017058 2024-07-08T19:47:11 Z MohamedFaresNebili The Collection Game (BOI21_swaps) C++14
15 / 100
 46 ms 956 KB 
    #include <bits/stdc++.h>
    #include "swaps.h"
     
     
            using namespace std;
     
            vector<int> dcS(vector<int> A) {
                bool ok = false;
                int N = A.size();
                while(ok == false) {
                    ok = true;
                    for(int l = 0; l + 1 < N; l += 2) 
                        schedule(A[l], A[l + 1]);
                    vector<int> K = visit();
                    for(int l = 0, cur = 0; l + 1 < N; l += 2, cur++) {
                        if(K[cur] == 0) {
                            ok = false;
                            swap(A[l], A[l + 1]);
                        }
                    }
     
                    for(int l = 1; l + 1 < N; l += 2) 
                        schedule(A[l], A[l + 1]);
                    K.clear(); K = visit();
                    for(int l = 1, cur = 0; l + 1 < N; l += 2, cur++) {
                        if(K[cur] == 0) {
                            ok = false;
                            swap(A[l], A[l + 1]);
                        }
                    }
                }
                return A;
            }
     
            void solve(int N, int V) {
                vector<int> res(N);
                for(int l = 0; l < N; l++)
                    res[l] = l + 1;
                res = dcS(res);
                answer(res);
            }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 2 ms 344 KB Correct
3 Correct 6 ms 344 KB Correct
4 Correct 24 ms 956 KB Correct
5 Correct 0 ms 344 KB Correct
6 Correct 23 ms 412 KB Correct
7 Correct 41 ms 572 KB Correct
8 Correct 24 ms 576 KB Correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 6 ms 344 KB Correct
4 Correct 23 ms 440 KB Correct
5 Correct 0 ms 344 KB Correct
6 Correct 25 ms 440 KB Correct
7 Correct 38 ms 532 KB Correct
8 Correct 27 ms 672 KB Correct
9 Correct 24 ms 608 KB Correct
10 Correct 1 ms 344 KB Correct
11 Correct 23 ms 416 KB Correct
12 Correct 24 ms 436 KB Correct
13 Correct 46 ms 416 KB Correct

Subtask #3-1
0 / 3.0

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

Subtask #3-2
0 / 2.0

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

Subtask #4-1
0 / 9.0

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

Subtask #4-2
0 / 6.0

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

Subtask #5-1
0 / 9.0

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

Subtask #5-2
0 / 6.0

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

Subtask #6-1
0 / 21.0

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

Subtask #6-2
0 / 14.0

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

Subtask #7-1
0 / 9.0

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

Subtask #7-2
0 / 6.0

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