oj.uz

답안 #775646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775646 2023-07-06T16:58:25 Z MohamedAliSaidane 코알라 (APIO17_koala) C++14
0 / 100
 0 ms 208 KB 
#include "koala.h"
#include<bits/stdc++.h>

using namespace std;

#define pb push_back

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) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}
vector<int> p;
int n;
void srch(int l, int r, vector<int> idx)
{
    if(l == r)
    {
        for(auto e: idx)
            p[e] = l;
        return ;
    }
    int B[n], Res[n];
    memset(B, 0, sizeof(B));
    memset(Res, 0, sizeof(Res));
    for(auto e: idx)
        B[e] = 1;
    playRound(B, Res);
    int mid = (l + r)/2 ;
    vector<int> L, R;
    for(auto e: idx)
    {
        if(Res[e] == 2)
            R.pb(e);
        else
            L.pb(e);
    }
    srch(l, mid, L);
    srch(mid + 1, r, R);
}
void allValues(int N, int W, int *P) {
    vector<int> idx;
    for(int i = 0; i < n; i++)
        idx.pb(i);
    srch(1, N, idx);
    for(int i = 0; i < n; i++)
        P[i] = p[i];
    return ;
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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