Submission #316146

#	Time	Username	Problem	Language	Result	Execution time	Memory
316146		nikatamliani	커다란 상품 (IOI17_prize)	C++14	0 / 100	1 ms	384 KiB

prize

#include <bits/stdc++.h>
using namespace std;
#include "prize.h"
// int prize[] = {-1, 3, 2, 3, 1, 3, 3, 2, 3}; 
// int n = 8;
// vector < int > ask(int x) {
//     int prefix = 0, suffix = 0; 
//     for(int i = 1; i < x; ++i) {
//         if(prize[i] < prize[x]) ++prefix;
//     }
//     for(int i = x + 1; i <= n; ++i) {
//         if(prize[i] < prize[x]) ++suffix;
//     }
//     return {prefix, suffix};
// }
int find_best(int n) {
    int next = -1;
    for(int i = 1; i <= n; i = next) {
        int l = i, r = n; next = -1;
        vector < int > t = ask(i);
        while(r >= l) {
            int m = l + r >> 1;
            vector < int > x = ask(m);
            if(x == t) {
                next = m;
                l = m + 1;
            } else {
                r = m - 1; 
            }
        }
        assert(next > 0);
        vector < int > tt = ask(next);
        for(int j = next + 1; j <= n; ++j) {
            vector < int > p = ask(j);
            if(p[0] == 0 && p[1] == 0) return j; 
            if(p[0] > t[0] && t[1] == p[1] + j - next - 1) {
                next = j;
                break;
            }
        }
    }
    //this is bad
    for(int i = 1; i <= n; ++i) {
        vector < int > p = ask(i);
        if(!p[0] && !p[1]) return i; 
    }
}
// int main() {
//     cout << find_best(8) << '\n';
// }

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:22:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |             int m = l + r >> 1;
      |                     ~~^~~
prize.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80