Submission #1231267

#TimeUsernameProblemLanguageResultExecution timeMemory
1231267damamilaNavigation 2 (JOI21_navigation2)C++20
0 / 100
0 ms816 KiB
#include "Anna.h" #include <bits/stdc++.h> using namespace std; namespace { int mod = 2; } // 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++) { int tmp = 0; for (int i = 0; i < K; i++) { int base = 1; for (int j = 0; j < i; j++) base = base*mod; if (r < R[i]) tmp += 1*base; else if (r > R[i]) tmp += 0*base; else if (c < C[i]) tmp += 0*base; else if (c > C[i]) tmp += 1*base; else tmp += 1*base; //~ cerr << field[r][c]/base << " "; } SetFlag(r, c, tmp+1); //~ cerr << endl; } //~ cerr << endl; } }
#include "Bruno.h" #include <bits/stdc++.h> using namespace std; namespace { int mod = 2; } // namespace std::vector<int> Bruno(int K, std::vector<int> value) { vector<int> res(K, 0); if (value.size() < 5) return res; for (int i = 0; i < K; i++) { vector<int> value2(9); for (int j = 0; j < 9; j++) { value2[j] = value[j]%mod; value[j] /= mod; } if (value2[4] == 1 && value2[3] == 0 && value2[7] == 0) res[i] = 4; else if (value2[4] == 1) { //south or west if (value2[7] != 0) res[i] = 2; else res[i] = 1; } else { //north or east if (value2[1] == 1) res[i] = 0; else res[i] = 3; } //~ cerr << flag << " " << res[i] << endl; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...