제출 #1259963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1259963		Szymon_Pilipczuk	Worm Worries (BOI18_worm)	C++20	0 / 100	0 ms	420 KiB

worm

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(),a.end()
#define rep(a,b) for(int a = 0;a<b;a++)
const int inf = 1e9;
const ll infl = 1e18;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int los(int a,int b)
{
    return rng()%(b-a+1)+a;
}
int main()
{
    int n,m,k,q;
    cin>>n>>m>>k>>q;
    vector<int> mx(3);
    int mxmx = 0;
    rep(i,q/2)
    {
        int a = los(1,n), b = los(1,m), c = los(1,k);
        cout<<"?"<<" "<<a<<" "<<b<<" "<<c<<" "<<endl;
        int cc;
        cin>>cc;
        if(cc > mxmx)
        {
            mxmx = cc;
            mx = {a,b,c};
        }
    }
    return 0;
    while(true)
    {
        if(mx[0] != 1)
        {
            cout<<"?"<<" "<<mx[0]-1<<" "<<mx[1]<<" "<<mx[2]<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[0]--;
                continue;

            }
        }
        if(mx[0] != n)
        {
            cout<<"?"<<" "<<mx[0]+1<<" "<<mx[1]<<" "<<mx[2]<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[0]++;
                continue;

            }
        }
        if(mx[1] != 1)
        {
            cout<<"?"<<" "<<mx[0]<<" "<<mx[1]-1<<" "<<mx[2]<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[1]--;
                continue;

            }
        }
        if(mx[1] != m)
        {
            cout<<"?"<<" "<<mx[0]<<" "<<mx[1]+1<<" "<<mx[2]<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[1]++;
                continue;

            }
        }
        if(mx[2] != 1)
        {
            cout<<"?"<<" "<<mx[0]<<" "<<mx[1]<<" "<<mx[2]-1<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[2]--;
                continue;

            }
        }
        if(mx[2] != k)
        {
            cout<<"?"<<" "<<mx[0]<<" "<<mx[1]<<" "<<mx[2]+1<<" "<<endl;
            int cc;
            cin>>cc;
            if(cc > mxmx)
            {
                mxmx = cc;
                mx[2]++;
                continue;
            }
        }
        break;
    }
    cout<<"!"<<" "<<mx[0]<<" "<<mx[1]<<" "<<mx[2]<<endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 22
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 14
• Subtask 6: 0 / 23