oj.uz

Submission #1030309

# Submission time Handle Problem Language Result Execution time Memory
1030309 2024-07-22T02:31:30 Z vjudge1 Koala Game (APIO17_koala) C++17
33 / 100
 61 ms 592 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(243987);
int you[100],cnt;
int minValue(int N, int W) {
    int me[100]{1};
    playRound(me,you),cnt++;
    for(int i=0;i<N;i++)
        if(you[i]==0)
            return i;
    return 0;
}

int maxValue(int N, int W) {
    int me[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),cnt++;
        vector<int>theposs2;
        for(auto i:theposs)
            if(you[i])theposs2.push_back(i);
        theposs=theposs2;
    }
    return theposs[0];
}
int greaterValue(int N, int W) {
    int me[100]{1,1};
    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),cnt++;
        if(you[0]-you[1])
            return cerr<<mid,!you[0];
        if(you[0])
            L=mid+1;
        else R=mid-1;
    }
    return 0;
}
int lst[101];
int smal[101];
int greaterValue2(int A,int B) {
    if(lst[A]-lst[B])
        return lst[A]<lst[B];
    int me[100]{};
    me[A]=lst[A]-10;me[B]=lst[B]-10;
    if(cnt==700)assert(0);
    playRound(me,you),cnt++;
    return !you[A];
}

void allValues(int N, int W, int *P) {  
    vector<int>v(N);
    iota(v.begin(),v.end(),0);
    for(int i=0;i<N;i++){
        if(i==1000) {lst[i]=1e9;continue;}
        int l=101,r=108;
        while(l<=r){
            int mid=l+r+1>>1;
            int me[100]{};
            me[i]=mid;
            if(cnt==700)assert(0);
            playRound(me,you),cnt++;
            if(you[i])
                lst[i]=mid,l=mid+1;
            else r=mid-1;
        }
        if(!lst[i])lst[i]=50;
    }
    stable_sort(v.begin(),v.end(),[](int a,int b){
        return !greaterValue2(a,b);
    });
    for(int i=0;i<N;i++)
        P[v[i]]=N-i;
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:35:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         int mid=L+R>>1;
      |                 ~^~
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:66:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |             int mid=l+r+1>>1;
      |                     ~~~^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 456 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 10 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 50 ms 484 KB Output is partially correct
2 Partially correct 61 ms 472 KB Output is partially correct
3 Partially correct 53 ms 344 KB Output is partially correct
4 Partially correct 57 ms 344 KB Output is partially correct
5 Partially correct 56 ms 344 KB Output is partially correct
6 Partially correct 49 ms 484 KB Output is partially correct
7 Partially correct 56 ms 480 KB Output is partially correct
8 Partially correct 55 ms 480 KB Output is partially correct
9 Partially correct 53 ms 476 KB Output is partially correct
10 Partially correct 47 ms 480 KB Output is partially correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 464 KB Output is correct
2 Runtime error 30 ms 592 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

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