oj.uz

Submission #1028546

# Submission time Handle Problem Language Result Execution time Memory
1028546 2024-07-20T04:12:16 Z vjudge1 Koala Game (APIO17_koala) C++17
33 / 100
 79 ms 472 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
    int me[100]{1},you[100];
    playRound(me,you);
    for(int i=0;i<N;i++)
        if(you[i]==0)
            return i;
    return 0;
}

int maxValue(int N, int W) {
    int me[100],you[100];
    vector<int>theposs(N);
    iota(theposs.begin(),theposs.end(),0);
    while(theposs.size()>1){
        memset(me,0,sizeof me);
        for(auto i:theposs)
            me[i]=W/theposs.size();
        playRound(me,you);
        vector<int>theposs2;
        for(auto i:theposs)
            if(you[i])theposs2.push_back(i);
        theposs=theposs2;
    }
    return theposs[0];
}
int maxValue2(set<int>theposs, int W) {
    int me[100],you[100], ORIG=theposs.size();
    while(theposs.size()>1){
        memset(me,0,sizeof me);
        for(auto i:theposs)
            me[i]=(W+theposs.size()-ORIG)/theposs.size();
        playRound(me,you);
        set<int>theposs2;
        for(auto i:theposs)
            if(you[i])theposs2.insert(i);
        theposs=theposs2;
    }
    return *theposs.begin();
}

int greaterValue(int N, int W) {
    int me[100]{1,1},you[100];
    int L=1,R=min(W/2,8);
    while(L<=R){
        int mid=L+R>>1;
        me[0]=mid;
        me[1]=mid;
        playRound(me,you);
        if(you[0]-you[1])
            return !you[0];
        if(you[0])
            L=mid+1;
        else R=mid-1;
    }
}

void allValues(int N, int W, int *P) {
    
    set<int>V;
    for(int i=0;i<N;i++)V.insert(i);
    for(int i=N;i;i--){
        int k=maxValue2(V,W);
        P[k]=i;
        V.erase(k);
    }
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:48:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |         int mid=L+R>>1;
      |                 ~^~
koala.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 448 KB Output is correct
4 Correct 3 ms 452 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 12 ms 452 KB Output is correct
4 Correct 9 ms 344 KB Output is correct

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 56 ms 344 KB Output is partially correct
2 Partially correct 55 ms 344 KB Output is partially correct
3 Partially correct 48 ms 468 KB Output is partially correct
4 Partially correct 48 ms 344 KB Output is partially correct
5 Partially correct 45 ms 344 KB Output is partially correct
6 Partially correct 46 ms 344 KB Output is partially correct
7 Partially correct 45 ms 464 KB Output is partially correct
8 Partially correct 46 ms 344 KB Output is partially correct
9 Partially correct 45 ms 472 KB Output is partially correct
10 Partially correct 44 ms 344 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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