oj.uz

답안 #984259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984259 2024-05-16T12:12:52 Z Unforgettablepl 코알라 (APIO17_koala) C++17
63 / 100
 40 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
 
void playRound(int *B, int *R);
 
int minValue(int N, int W) {
    int arr[100];fill(arr,arr+100,0);
    int res[100];fill(res,res+100,0);
    arr[0] = 1;
    playRound(arr,res);
    for(int i=0;i<N;i++)if(res[i]<=arr[i])return i;
}
 
int maxValue(int N, int W) {
    vector<int> poss(N);iota(poss.begin(), poss.end(),0);
    while(poss.size()>1){
        int arr[100];fill(arr,arr+100,0);
        int res[100];fill(res,res+100,0);
        int distrib = W/poss.size();
        for(int&i:poss)arr[i]=distrib;
        playRound(arr,res);
        poss.clear();
        for(int i=0;i<N;i++)if(arr[i] and res[i]>arr[i])poss.emplace_back(i);
    }
    return poss[0];
}
 
bool lessth(int a,int b,bool second_way=false){
    if(second_way){
        int arr[100];
        fill(arr, arr + 100, 0);
        int res[100];
        fill(res, res + 100, 0);
        arr[a] = arr[b] = 100;
        playRound(arr,res);
        return res[b] > arr[b];
    }
    int lo = 1, hi = 16;
    while (true) {
        int mid = (lo + hi) / 2;
        int arr[100];
        fill(arr, arr + 100, 0);
        int res[100];
        fill(res, res + 100, 0);
        arr[a] = arr[b] = mid;
        playRound(arr, res);
        bool zerogud = res[a] > arr[a];
        bool onegud = res[b] > arr[b];
        if (zerogud == onegud) {
            if (zerogud) {
                lo = mid + 1;
            } else {
                hi = mid - 1;
            }
            continue;
        }
        return onegud;
    }
}
 
int greaterValue(int N, int W) {
    return lessth(0,1);
}
 
void allValues(int N, int W, int *P) {
    vector<int> permutation;
    for(int i=0;i<N;i++){
        int x = 0;
        for(int jump=64;jump;jump/=2){
            if(x+jump>permutation.size())continue;
            if(lessth(permutation[x+jump-1],i))x+=jump;
        }
        permutation.insert(permutation.begin()+x,i);
    }
    for(int i=0;i<N;i++){
        P[permutation[i]]=i+1;
    }
}

Compilation message

koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             if(x+jump>permutation.size())continue;
      |                ~~~~~~^~~~~~~~~~~~~~~~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 480 KB Output is correct
2 Partially correct 36 ms 472 KB Output is partially correct
3 Correct 35 ms 488 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Partially correct 35 ms 480 KB Output is partially correct
6 Correct 36 ms 484 KB Output is correct
7 Partially correct 40 ms 460 KB Output is partially correct
8 Correct 34 ms 468 KB Output is correct
9 Correct 34 ms 596 KB Output is correct
10 Correct 34 ms 472 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
30.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 10 ms 344 KB Output is partially correct
2 Partially correct 15 ms 344 KB Output is partially correct
3 Partially correct 15 ms 452 KB Output is partially correct
4 Partially correct 15 ms 452 KB Output is partially correct
5 Partially correct 15 ms 500 KB Output is partially correct
6 Partially correct 15 ms 344 KB Output is partially correct
7 Partially correct 15 ms 344 KB Output is partially correct
8 Partially correct 18 ms 344 KB Output is partially correct
9 Partially correct 17 ms 344 KB Output is partially correct
10 Partially correct 15 ms 344 KB Output is partially correct
11 Partially correct 15 ms 452 KB Output is partially correct
12 Partially correct 16 ms 444 KB Output is partially correct
13 Partially correct 15 ms 344 KB Output is partially correct
14 Partially correct 16 ms 344 KB Output is partially correct
15 Partially correct 15 ms 344 KB Output is partially correct
16 Partially correct 15 ms 448 KB Output is partially correct
17 Partially correct 15 ms 344 KB Output is partially correct
18 Partially correct 15 ms 448 KB Output is partially correct
19 Partially correct 16 ms 344 KB Output is partially correct
20 Partially correct 15 ms 448 KB Output is partially correct
21 Partially correct 15 ms 344 KB Output is partially correct
22 Partially correct 16 ms 448 KB Output is partially correct
23 Partially correct 15 ms 344 KB Output is partially correct
24 Partially correct 15 ms 344 KB Output is partially correct
25 Partially correct 15 ms 448 KB Output is partially correct
26 Partially correct 15 ms 344 KB Output is partially correct
27 Partially correct 15 ms 344 KB Output is partially correct
28 Partially correct 15 ms 344 KB Output is partially correct
29 Partially correct 15 ms 344 KB Output is partially correct
30 Partially correct 15 ms 344 KB Output is partially correct
31 Partially correct 15 ms 344 KB Output is partially correct
32 Partially correct 15 ms 344 KB Output is partially correct
33 Partially correct 15 ms 452 KB Output is partially correct
34 Partially correct 17 ms 448 KB Output is partially correct
35 Partially correct 16 ms 444 KB Output is partially correct
36 Partially correct 15 ms 344 KB Output is partially correct
37 Partially correct 15 ms 448 KB Output is partially correct
38 Partially correct 14 ms 344 KB Output is partially correct
39 Partially correct 15 ms 444 KB Output is partially correct
40 Partially correct 15 ms 344 KB Output is partially correct