Submission #442540

#	Time	Username	Problem	Language	Result	Execution time	Memory
442540		abc864197532	Worm Worries (BOI18_worm)	C++17	10 / 100	5 ms	4176 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;

int ask(int i, int j, int k) {
    cout << "? " << i + 1 << ' ' << j + 1 << ' ' << k + 1 << endl;
    cin >> i;
    return i;
}

void ans(int i, int j, int k) {
    cout << "! " << i + 1 << ' ' << j + 1 << ' ' << k + 1 << endl;
    exit(0);
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k, q;
    cin >> n >> m >> k >> q;
    if (m == 1 && k == 1) {
        // task 1 & 2
        int l = 0, r = n;
        while (r - l > 100) {
            int mid = l + r >> 1;
            if (ask(mid, 0, 0) > ask(mid + 1, 0, 0)) r = mid;
            else l = mid;
        }
        vector <int> a(n, 0);
        for (int i = l; i < r; ++i) {
            a[i] = ask(i, 0, 0);
        }
        for (int i = l; i < r; ++i) {
            if (i == 0) {
                if (a[i] >= a[i + 1]) ans(i, 0, 0);
            } else if (i == n - 1) {
                if (a[i - 1] <= a[i]) ans(i, 0, 0);
            } else {
                if (a[i] >= a[i - 1] && a[i] >= a[i + 1]) ans(i, 0, 0);
            }
        }
    } else if (k == 1) {
        // task 3 & 4

    } else {
        // task 5 & 6

    }
}

Compilation message (stderr)

worm.cpp: In function 'int main()':
worm.cpp:42:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |             int mid = l + r >> 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