이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
using namespace std;
int INF = 1LL<<30;
mt19937 rng;
vector<int> dx = {0,0,0,0,-1,1};
vector<int> dy = {0,0,-1,1,0,0};
vector<int> dz = {-1,1,0,0,0,0};
int n,m,k,q;
int qcount = 0;
int debug = 0;
vector<vector<vector<int>>> humidity;
vector<vector<int>> neighbours(vector<int> point) {
vector<vector<int>> ans;
for (int dir=0; dir<6; dir++) {
int nx,ny,nz; nx=point[0]+dx[dir]; ny=point[1]+dy[dir]; nz=point[2]+dz[dir];
if (!(1<=nx && nx<=n && 1<=ny && ny<=m && 1<=nz && nz<=k)) {
continue;
}
ans.push_back({nx,ny,nz});
}
return ans;
}
map<vector<int>,int> cache;
int query(int x, int y, int z) {
if (cache.count({x,y,z})) return cache[{x,y,z}];
cout << "? " << x <<" " << y <<" " <<z << endl;
qcount++;
if (qcount>=q-1) {
while (1==1) {
int o=0;
}
}
int an;
if (!debug) {
cin >> an;
}
else {
cout << humidity[x-1][y-1][z-1] << endl;
return cache[{x,y,z}] = humidity[x-1][y-1][z-1];
}
return cache[{x,y,z}] = an;
}
void answer(int x, int y, int z) {
cout << "! " << x << " " << y << " " << z << endl;
if (debug) {
cout << "in " << qcount <<" " << "queries" << endl;
int gg=0;
for (auto j:neighbours({x,y,z})) {
if (humidity[j[0]-1][j[1]-1][j[2]-1]>humidity[x-1][y-1][z-1]) {
gg=1;
}
}
if (gg) {
cout << "INCORRECT" << endl;
}
else {
cout << "CORRECT" << endl;
}
}
}
signed main() {
rng.discard((time(NULL))%100000);
cin >> n >> m >> k >> q;
if (debug) humidity = vector<vector<vector<int>>>(n,vector<vector<int>>(m,vector<int>(k,0)));
if (debug) {
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
for (int k1=0; k1<k; k1++) {
humidity[i][j][k1]=rng();
}
}
}
}
vector<vector<int>> points; //humidity,x,y,z
int q1 = q/6;
int q2 = q-q1;
int pathlength = q2/6;
for (int i=0; i<q1; i++) {
int x,y,z; x=rng()%n; y=rng()%m; z=rng()%k; x++; y++; z++;
points.push_back({query(x,y,z),x,y,z});
}
sort(points.begin(), points.end());
reverse(points.begin(), points.end());
int a,x,y,z;
a = points[0][0]; x = points[0][1]; y = points[0][2]; z = points[0][3];
while (1) {
bool changed = 0;
int ma=query(x,y,z);
for (vector<int> j:neighbours({x,y,z})) {
if (query(j[0],j[1],j[2])>ma) {
x = j[0]; y=j[1]; z=j[2]; changed=1; ma=query(j[0],j[1],j[2]);
}
}
if (!changed) break;
}
answer(x,y,z);
}
컴파일 시 표준 에러 (stderr) 메시지
worm.cpp: In function 'long long int query(long long int, long long int, long long int)':
worm.cpp:35:17: warning: unused variable 'o' [-Wunused-variable]
35 | int o=0;
| ^
worm.cpp: In function 'int main()':
worm.cpp:87:9: warning: unused variable 'pathlength' [-Wunused-variable]
87 | int pathlength = q2/6;
| ^~~~~~~~~~
worm.cpp:94:9: warning: variable 'a' set but not used [-Wunused-but-set-variable]
94 | int a,x,y,z;
| ^
# | 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... |