1624F - Interacdive Problem - CodeForces Solution


binary search constructive algorithms interactive *2000

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 


void solve() {
    int n;
    cin >> n;

    int l = 1;
    int r = n-1;
    int ans;
    int cur = 0;
    int sum = 0;
    while(l <= r) {
        int mid = (l+r)/2;
        int c = (cur+1)*n - mid - sum;
        sum+= c;

        cout << "+ " << c << endl;
        cout.flush();

        int qr; cin >> qr;

        if(qr == cur+1) {
            cur++;
            ans = mid;
            l = mid+1;
        }
        else {
            r = mid-1;
        }
    }

    cout << "! " << ans+sum << endl;
    cout.flush();

}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}


Comments

Submit
0 Comments
More Questions

967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height