oj.uz

답안 #969680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969680 2024-04-25T13:04:35 Z CDuong 코알라 (APIO17_koala) C++17
5 / 100
 106 ms 712 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
 
int B[105], R[105];
 
int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}
 
 
int maxValue(int N, int W) {
    // vector<int> vec = {1, 2, 4, 11};
    // vector<int> good(N);
    // iota(good.begin(), good.end(), 0);
    // for(auto v: vec){
    //     fill(B, B + N, 0);
    //     for(auto id: good)B[id] = v;
    //     playRound(B, R);
    //     good.clear();
    //     for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i);
    // }
    // return good.back();
}
 
int greaterValue(int N, int W) {
    for (int i = 1; i <= 8; ++i) if (i != 2) {
        B[0] = B[1] = i;
        playRound(B, R);
        if (R[0] > i and R[1] <= i) return 0;
        if (R[1] > i and R[0] <= i) return 1;
    }
    assert(false);
    // int l = 1, r = 9;
    // while (l < r) {
    //     int mid = (l + r) >> 1;
    //     B[0] = B[1] = mid;
    //     playRound(B, R);
    //     if (R[0] > mid and R[1] > mid) l = mid + 1;
    //     else if (R[0] <= mid and R[1] <= mid) r = mid - 1;
    //     else return (R[0] < R[1]);
    // }
    // B[0] = B[1] = l;
    // playRound(B, R);
    // return (R[0] < R[1]);
    // assert(0);
    // return 0;
 }
 
int n;
 
bool cmp_subtask_4(int a, int b){
    fill(B, B + n, 0);
    B[a] = B[b] = n;
    playRound(B, R);
    return R[a] < R[b];
}
 
 
void allValues(int N, int W, int *P) {
    // n = N;
    // if (W == 2 * N) {
    //     vector<int> vec(N);
    //     iota(vec.begin(), vec.end(), 0);
    //     stable_sort(vec.begin(), vec.end(), cmp_subtask_4);
    //     for (int i = 0; i < N; i++) P[vec[i]] = i + 1;
    // } else {
    //     // TODO: Implement Subtask 5 solution here.
    //     // You may leave this block unmodified if you are not attempting this
    //     // subtask.
    // }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
5.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 96 ms 464 KB Output is partially correct
2 Partially correct 106 ms 456 KB Output is partially correct
3 Partially correct 98 ms 460 KB Output is partially correct
4 Partially correct 95 ms 460 KB Output is partially correct
5 Partially correct 99 ms 712 KB Output is partially correct
6 Partially correct 96 ms 464 KB Output is partially correct
7 Partially correct 100 ms 464 KB Output is partially correct
8 Partially correct 95 ms 464 KB Output is partially correct
9 Partially correct 95 ms 480 KB Output is partially correct
10 Partially correct 93 ms 464 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -