# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080901 | Boomyday | Robot Contest (IOI23_robot) | C++17 | 145 ms | 5712 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
//void set_instruction(vector<int>, int, char);
void program_pulibot()
{
// home, west, south, east, north
// left, down, right, up
int cu = 9;
vector<int> path = {2,3,4,5};
vector<int> tree = {6,7,8,9};
map<int,char> d;
d[0] = 'W';
d[1] = 'S';
d[2] = 'E';
d[3] = 'N';
// path to tree interactions
for (int i=-2;i<2;++i) for (int j=-2;j<2;++j) {for(int k=-2;k<2;++k) for(int l=-2;l<2;++l) {
if (k != -1 && k != -2 ) set_instruction({0, i, j, k, l}, 1, 'E');
if (j != -1 && j != -2 && (k == -1 || k == -2)) set_instruction({0, i, j, k, l}, 1, 'S');
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |