結果

問題 No.594 壊れた宝物発見機
ユーザー fura
提出日時 2020-05-12 07:47:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 160 ms / 2,000 ms
コード長 905 bytes
コンパイル時間 2,397 ms
コンパイル使用メモリ 193,124 KB
最終ジャッジ日時 2025-01-10 10:37:09
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int ask(int, int, int)’:
main.cpp:15:21: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 |         int d; scanf("%d",&d);
      |                ~~~~~^~~~~~~~~
main.cpp: In function ‘int solve(int)’:
main.cpp:29:17: warning: ‘d1’ may be used uninitialized [-Wmaybe-uninitialized]
   29 |                 if(d1<=d2) hi=mi2;
      |                 ^~
main.cpp:25:21: note: ‘d1’ was declared here
   25 |                 int d1,d2;
      |                     ^~
main.cpp:29:17: warning: ‘d2’ may be used uninitialized [-Wmaybe-uninitialized]
   29 |                 if(d1<=d2) hi=mi2;
      |                 ^~
main.cpp:25:24: note: ‘d2’ was declared here
   25 |                 int d1,d2;
      |                        ^~
main.cpp:39:17: warning: ‘d’ may be used uninitialized [-Wmaybe-uninitialized]
   39 |                 if(d<=mn) mn=d, pos=t;
      |                 ^~
main.cpp:35:21: note: ‘d’ was declared here
   35 |                 int d;
      |                     ^
main.cpp:41:16: warning: ‘pos’ may be used uninitialized [-Wmaybe-uninitialized]
   41 |         return pos;
      |                ^~~
main.cpp:33:24: note: ‘pos’ was declared here
   33 |         int mn=INT_MAX,pos;
      |                        ^~~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int memo[201][201][201];
int ask(int x,int y,int z){
    int& res=memo[x+100][y+100][z+100];
    if(res!=-1) return res;
    printf("? %d %d %d\n",x,y,z);
    fflush(stdout);
    int d; scanf("%d",&d);
    return res=d;
}
int solve(int i){
    int lo=-100,hi=100;
    while(hi-lo>4){
        int mi1=(2*lo+hi)/3;
        int mi2=(lo+2*hi)/3;
        int d1,d2;
        if(i==0) d1=ask(mi1,0,0), d2=ask(mi2,0,0);
        if(i==1) d1=ask(0,mi1,0), d2=ask(0,mi2,0);
        if(i==2) d1=ask(0,0,mi1), d2=ask(0,0,mi2);
        if(d1<=d2) hi=mi2;
        else       lo=mi1;
    }
    int mn=INT_MAX,pos;
    for(int t=lo;t<=hi;t++){
        int d;
        if(i==0) d=ask(t,0,0);
        if(i==1) d=ask(0,t,0);
        if(i==2) d=ask(0,0,t);
        if(d<=mn) mn=d, pos=t;
    }
    return pos;
}
int main(){
    memset(memo,-1,sizeof memo);
    int x=solve(0);
    int y=solve(1);
    int z=solve(2);
    printf("! %d %d %d\n",x,y,z);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0