oj.uz

Submission #581195

# Submission time Handle Problem Language Result Execution time Memory
581195 2022-06-22T11:01:22 Z alontanay The Collection Game (BOI21_swaps) C++14
0 / 100
 1 ms 336 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 "swaps.h"
#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;
using pi = pair<int,int>;

void solve(int N, int V) {
    vector<vector<int>> lw(N,vector<int>(N,-1));
    for(int st = 0; st < N; st ++) {
        vector<int> res;
        int idx;
        vector<pi> ss;
        for(int l = 0; l < N/2; l ++) {
            int i = (st + l)%N;
            int j = (st + N - 1 - l)%N;
            if(i > j) { swap(i,j); }
            ss.push_back({i,j});
        }
        for(pi p : ss) {
            schedule(p.f+1,p.s+1);
        }
        res = visit();
        idx = 0;
        for(pi p : ss) {
            lw[p.f][p.s] = res[idx];
            lw[p.f][p.s] = 1 - res[idx];
            idx ++;
        }
        ss.clear();
        for(int l = 0; l < (N-1)/2; l ++) {
            int i = (st + l)%N;
            int j = (st + N - 2 - l)%N;
            if(i > j) { swap(i,j); }
            ss.push_back({i,j});
        }
        for(pi p : ss) {
            schedule(p.f+1,p.s+1);
        }
        res = visit();
        idx = 0;
        for(pi p : ss) {
            lw[p.f][p.s] = res[idx];
            lw[p.f][p.s] = 1 - res[idx];
            idx ++;
        }
        
    }
    vector<int> res(N);
    for(int i = 0; i < N; i ++) {
        res[i] = i;
    }
    // for(int it = 0; it < 2*N; it ++) {
    //     for(int i = 1; i < N; i ++) {
    //         if(lw[res[i-1]][res[i]]) {
    //             swap(res[i-1],res[i]);
    //         }
    //     }
    // }
    for(int &r : res) { r ++; }
    answer(res);
}

/*
g++ swaps.cpp grader.cpp -o g.exe && g.exe
5 1000
2 1 5 3 4

*/

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0 / 3.0

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

Subtask #4
0 / 2.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 6.0

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

Subtask #7
0 / 9.0

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

Subtask #8
0 / 6.0

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

Subtask #9
0 / 21.0

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

Subtask #10
0 / 14.0

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

Subtask #11
0 / 9.0

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

Subtask #12
0 / 6.0

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