Submission #1229292

#TimeUsernameProblemLanguageResultExecution timeMemory
1229292__moin__Navigation 2 (JOI21_navigation2)C++20
0 / 100
7 ms816 KiB
#include "Anna.h" #include <bits/stdc++.h> using namespace std; namespace { int FunctionExample(int r, int c, int K) { return (r + c) % K + 1; } } // namespace void Anna(int N, int K, std::vector<int> R, std::vector<int> C) { 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); } } }
#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) { std::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; }
#Verdict Execution timeMemoryGrader output
Fetching results...