# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94177 | gs14004 | Worm Worries (BOI18_worm) | C++17 | 693 ms | 420 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<bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
const int dx[6] = {1, -1, 0, 0, 0, 0};
const int dy[6] = {0, 0, 1, -1, 0, 0};
const int dz[6] = {0, 0, 0, 0, 1, -1};
int n, m, k, q;
int query(int x, int y, int z = 1){
if(x <= 0 || x > n || y <= 0 || y > m || z <= 0 || z > k) return 0;
printf("? %d %d %d\n", x, y, z);
fflush(stdout);
int v; scanf("%d",&v); return v;
}
void report(int x, int y, int z){
printf("! %d %d %d\n", x, y, z);
fflush(stdout);
exit(0);
}
int global_max = 0;
pi attain_max;
void solve(int sx, int ex, int sy, int ey){
if(ex - sx <= 2 && ey - sy <= 2){
for(int i=sx; i<=ex; i++){
for(int j=sy; j<=ey; j++){
if(max({query(i-1, j), query(i, j-1), query(i+1, j), query(i, j+1)}) <= query(i, j)){
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... |