제출 #421909

#제출 시각아이디문제언어결과실행 시간메모리
421909shenxyNavigation 2 (JOI21_navigation2)C++17
19 / 100
1057 ms872 KiB
#include "Anna.h" #include <algorithm> #include <vector> using namespace std; void Anna(int N, int K, vector<int> R, vector<int> C) { for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { int flag = 0; for (int k = 0; k < K; ++k) flag = flag * 3 + (abs(i - R[k]) + abs(j - C[k])) % 3; SetFlag(i, j, flag + 1); } } }
#include "Bruno.h" #include <algorithm> #include <vector> using namespace std; int arr[4] = {5, 3, 7, 1}; vector<int> Bruno(int K, vector<int> value) { for (int i = 0; i < 9; ++i) --value[i]; vector<int> ans(K, 4); for (int i = 0; i < K; ++i) { for (int j = 0; j < 4; ++j) { if ((value[arr[j]] + 1) % 3 == value[4] % 3) ans[i] = j; value[arr[j]] /= 3; } value[4] /= 3; } reverse(ans.begin(), ans.end()); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...