Submission #442600

#	Time	Username	Problem	Language	Result	Execution time	Memory
442600		abc864197532	Worm Worries (BOI18_worm)	C++17	10 / 100	1531 ms	19484 KiB

worm

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define test(args...) abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cerr << *l << " \n"[++l == r];
}
const int mod = 1e9 + 7, N = 200000;

map <array<int, 3>, int> m1;
int n, m, k, q, dx[6] = {1, -1, 0, 0, 0, 0}, dy[6] = {0, 0, 1, -1, 0, 0}, dz[6] = {0, 0, 0, 0, 1, -1};

int ask(int i, int j, int kk) {
    if (i < 0 || i >= n || j < 0 || j >= m || kk < 0 || kk >= k) return 0;
    if (!m1.count({i, j, kk})) {
        assert(q);
        cout << "? " << i + 1 << ' ' << j + 1 << ' ' << kk + 1 << endl;
        cin >> m1[{i, j, kk}];
        q--;
    }
    return m1[{i, j, kk}];
}

void chk(int i, int j, int kk) {
    bool is = true;
    for (int ii = 0; ii < 6; ++ii) {
        is &= ask(i, j, kk) >= ask(i + dx[ii], j + dy[ii], kk + dz[ii]);
    }
    if (is) {
        cout << "! " << i + 1 << ' ' << j + 1 << ' ' << kk + 1 << endl;
        exit(0);
    }
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> k >> q;
    if (m == 1 && k == 1) {
        // task 1 & 2
        int l = 0, r = n;
        while (r - l > 2) {
            int mid = l + r >> 1;
            if (ask(mid, 0, 0) > ask(mid + 1, 0, 0)) r = mid + 1;
            else l = mid + 1;
        }
        for (int i = l; i < r; ++i) chk(i, 0, 0);
    } else if (k == 1) {
        // task 3 & 4
        int l1 = 0, r1 = n, l2 = 0, r2 = m;
        while (r1 - l1 > 5) {
            {
                int mid = l1 + r1 >> 1;
                int mx1 = 0, mx2 = 0;
                for (int j = l2; j < r2; ++j) {
                    mx1 = max(mx1, ask(mid - 1, j, 0));
                    mx2 = max(mx2, ask(mid, j, 0));
                }
                if (mx1 > mx2) r1 = mid;
                else l1 = mid;
            }
            {
                int mid = l2 + r2 >> 1;
                int mx1 = 0, mx2 = 0;
                for (int j = l1; j < r1; ++j) {
                    mx1 = max(mx1, ask(j, mid - 1, 0));
                    mx2 = max(mx2, ask(j, mid, 0));
                }
                if (mx1 > mx2) r2 = mid;
                else l2 = mid;
            }
        }
        for (int i = l1; i < r1; ++i) {
            for (int j = l2; j < r2; ++j) {
                chk(i, j, 0);
            }
        }
        assert(false);
    } else {
        // task 5 & 6
        int l1 = 0, r1 = n;
        for (int _ = 0; _ < 5; ++_) {
            int mid = l1 + r1 >> 1;
            int mx1 = 0, mx2 = 0;
            for (int i = 0; i < m; ++i) for (int j = 0; j < k; ++j) {
                mx1 = max(mx1, ask(mid - 1, i, j));
                mx2 = max(mx2, ask(mid, i, j));
            }
            if (mx1 > mx2) r1 = mid;
            else l1 = mid;
        }
        for (int i = l1; i < r1; ++i) for (int j = 0; j < m; ++j) for (int kk = 0; kk < k; ++kk) {
            chk(i, j, k);
        }
        assert(false);
    }
}

Compilation message (stderr)

worm.cpp: In function 'int main()':
worm.cpp:55:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |             int mid = l + r >> 1;
      |                       ~~^~~
worm.cpp:65:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |                 int mid = l1 + r1 >> 1;
      |                           ~~~^~~~
worm.cpp:75:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |                 int mid = l2 + r2 >> 1;
      |                           ~~~^~~~
worm.cpp:95:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |             int mid = l1 + r1 >> 1;
      |                       ~~~^~~~

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