Submission #398519

#TimeUsernameProblemLanguageResultExecution timeMemory
398519fedoseevtimofeyNavigation 2 (JOI21_navigation2)C++17
5 / 100
983 ms852 KiB
#include "Anna.h" #include <iostream> #include <string> #include <vector> #include <queue> #include <deque> #include <stack> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <random> #include <iomanip> #include <functional> #include <cassert> #include <bitset> #include <chrono> using namespace std; void Anna(int n, int k, vector <int> R, vector <int> C) { for (int r = 0; r < n; r++) { for (int c = 0; c < n; c++) { int cur = 0; for (int i = k - 1; i >= 0; --i) { int nd = 4; if (C[i] > c) nd = 0; else if (C[i] < c) nd = 1; else if (R[i] > r) nd = 2; else if (R[i] < r) nd = 3; cur = 5 * cur + nd; } SetFlag(r, c, cur + 1); } } }
#include "Bruno.h" #include <iostream> #include <string> #include <vector> #include <queue> #include <deque> #include <stack> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <random> #include <iomanip> #include <functional> #include <cassert> #include <bitset> #include <chrono> using namespace std; vector <int> Bruno(int k, vector <int> value) { vector<int> res(k, 0); int x = value[4] - 1; for (int i = 0; i < k; i++) { res[i] = x % 5; x /= 5; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...