oj.uz

답안 #969672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969672 2024-04-25T13:02:27 Z CDuong 코알라 (APIO17_koala) C++17
30 / 100
 120 ms 468 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 != 4) {
        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.
    }
}

Subtask #1
0 / 4.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
5.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 120 ms 468 KB Output is partially correct
2 Partially correct 109 ms 452 KB Output is partially correct
3 Partially correct 106 ms 464 KB Output is partially correct
4 Partially correct 102 ms 468 KB Output is partially correct
5 Partially correct 115 ms 464 KB Output is partially correct
6 Partially correct 105 ms 464 KB Output is partially correct
7 Partially correct 105 ms 460 KB Output is partially correct
8 Partially correct 104 ms 468 KB Output is partially correct
9 Partially correct 107 ms 464 KB Output is partially correct
10 Partially correct 116 ms 460 KB Output is partially correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 344 KB Output is correct
2 Correct 30 ms 452 KB Output is correct
3 Correct 28 ms 344 KB Output is correct
4 Correct 27 ms 344 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 30 ms 344 KB Output is correct
7 Correct 27 ms 456 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 30 ms 344 KB Output is correct
11 Correct 29 ms 344 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Correct 26 ms 432 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 24 ms 344 KB Output is correct
16 Correct 25 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 24 ms 344 KB Output is correct
19 Correct 25 ms 344 KB Output is correct
20 Correct 27 ms 452 KB Output is correct

Subtask #5
0 / 53.0

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