Submission #1229301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229301		__moin__	Navigation 2 (JOI21_navigation2)	C++20	0 / 100	6 ms	816 KiB

Anna

#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

namespace {} // namespace

void Anna(int N, int K, std::vector<int> R, std::vector<int> C) {
    assert(R.size() == K && C.size() == K);
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            vector<int> movement(K);
            for (int k = 0; k < K; k++) {
                if (r < R[k]) movement[k] = 2;
                else if (r > R[k]) movement[k] = 3;
                else if (c < C[k]) movement[k] = 0;
                else if (c > C[k]) movement[k] = 1;
                else movement[k] = 4;
            }
            int value = 0;
            for (int e : movement) {
                value *= 5;
                value += e;
            }
            SetFlag(r, c, value);
        }
    }
}

Bruno

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

int variable_example = 1;

} // namespace

std::vector<int> Bruno(int K, std::vector<int> value) {
    assert(value.size() == 9);
    vector<int> res(K, 0);
    vector<vector<int>> cells(9, vector<int>(K));
    for (int i = 0; i < 9; i++) {
        int val = value[i];
        for (int j = 0; j < K; j++) {
            cells[i][K-j-1] = val % 5;
            val /= 5;
        }
    }
    for (int k = 0; k < K; k++) {
        // if (cells[1][k] == 2 && cells[3][k] == 0 && cells[5][k] == 1 && cells[7][k] == 3) res[k] = 4;
        // else res[k] = cells[4][k];
        res[k] = cells[4][k];
    }
    return res;
}

• Subtask 1: 0 / 100