oj.uz

Submission #984253

# Submission time Handle Problem Language Result Execution time Memory
984253 2024-05-16T12:08:55 Z Unforgettablepl Koala Game (APIO17_koala) C++17
29 / 100
 26 ms 504 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){
        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 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:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 11 ms 452 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 452 KB Output is correct
2 Correct 25 ms 448 KB Output is correct
3 Correct 25 ms 444 KB Output is correct
4 Correct 26 ms 448 KB Output is correct
5 Correct 25 ms 344 KB Output is correct
6 Correct 26 ms 344 KB Output is correct
7 Correct 25 ms 344 KB Output is correct
8 Correct 25 ms 344 KB Output is correct
9 Correct 25 ms 424 KB Output is correct
10 Correct 25 ms 344 KB Output is correct
11 Correct 26 ms 344 KB Output is correct
12 Correct 25 ms 344 KB Output is correct
13 Correct 25 ms 344 KB Output is correct
14 Correct 26 ms 452 KB Output is correct
15 Correct 26 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 26 ms 344 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -