Submission #1214046

#TimeUsernameProblemLanguageResultExecution timeMemory
1214046NeltRobot Contest (IOI23_robot)C++20
16 / 100
66 ms5608 KiB
#include "robot.h" #include <bits/stdc++.h> #pragma GCC optimize("O3") #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define ll long long #define endl "\n" using namespace std; using namespace __gnu_pbds; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); template <typename T, typename key = less<T>> using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>; void program_pulibot() { for (int i = -2; i <= 1; i++) for (int j = -2; j <= 1; j++) for (int k = -2; k <= 1; k++) { set_instruction({0, i, j, 0, k}, 1, 'E'); if (j < 0) set_instruction({0, i, j, -1, k}, 1, 'N'); else if (k < 0) set_instruction({0, i, j, -1, k}, 1, 'S'); if (j >= 0) set_instruction({0, i, j, -2, k}, 1, 'S'); else set_instruction({0, i, j, -2, k}, 1, 'T'); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...