oj.uz

답안 #1053940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053940 2024-08-11T21:51:48 Z aaaaaarroz 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 596 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

int nn;
int worse = INT_MAX;

int find_best(int n) {
    nn = n;
    int l = 0, r = nn - 1;
    int best_index = -1;

    while (l <= r) {
        int mid = (l + r) / 2;
        vector<int> res = ask(mid);
        int left = res[0];
        int right = res[1];

        int total_worse = left + right;
        if (total_worse < worse) {
            worse = total_worse;
            best_index = mid;
        }

        if (left == 0) {
            l = mid + 1; // El diamante debe estar en esta posición o hacia la derecha
        } else if (right == 0) {
            r = mid - 1; // El diamante debe estar en esta posición o hacia la izquierda
        } else {
            // Si hay premios más caros tanto a la izquierda como a la derecha,
            // nos movemos hacia la izquierda para reducir el rango
            r = mid - 1;
        }
    }

    return best_index;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -