Submission #1259917

#	Time	Username	Problem	Language	Result	Execution time	Memory
1259917		ewirlan	Worm Worries (BOI18_worm)	C++20	0 / 100	3079 ms	432 KiB

worm

//
#ifndef __SIZEOF_INT128__
  #define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string nm): name(nm) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    static T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
int n, m, k, q;
map <tuple <int,int,int>, int> wb;
int w(int x, int y = 1, int z = 1){
    if(x < 1 || y < 1 || z < 1 || x > n || y > m || z > k)return 0;
    if(wb.count({x,y,z}))return wb[{x,y,z}];
    cout << "? " << x << ' '<< y << ' ' <<z << endl;
    return wb[{x,y,z}] = in();
}
const double phi((sqrt(5)-1)/2);
std::int32_t main()
{
    std::cout.tie(nullptr); //for luck
    std::cin.tie(nullptr); std::ios_base::sync_with_stdio(0);
    cin >> n >> m >> k >> q;
    if(m == 1 && k == 1){
        int p(1), k(n);
        while(p != k){
            int x(round(phi*p + (1-phi)*k)), y(round((1-phi)*p + phi*k));
            if(wb.count({x-1,1,1}))--x;
            if(wb.count({x+1,1,1}))++x;
            if(wb.count({y-1,1,1}))--y;
            if(wb.count({y+1,1,1}))++y;
            if(x == y){
                if(x > p)--x;
                else ++y;
            }
            if(w(x) < w(y))p = x+1;
            else k = y-1;
        }
        cout << "! " << p << " 1 1\n";
    }
    return 0;
}

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