oj.uz

답안 #1030282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030282 2024-07-22T02:08:58 Z vjudge1 코알라 (APIO17_koala) C++17
63 / 100
 60 ms 484 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(243987);
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 cerr<<mid,!you[0];
        if(you[0])
            L=mid+1;
        else R=mid-1;
    }
    return 0;
}
int lst[101];
int greaterValue2(int A,int B) {
    if(lst[A]-lst[B])
        return lst[A]<lst[B];
    int me[100]{},you[100];
    me[A]=lst[A];me[B]=lst[B];
    playRound(me,you);
    return !you[A];
}
void allValues(int N, int W, int *P) {
    for(int i=0;i<N;i++){
        int l=1,r=8;
        while(l<=r){
            int mid=l+r+1>>1;
            int me[100]{},you[100];
            me[i]=mid;
            playRound(me,you);
            if(you[i])
                lst[i]=mid,l=mid+1;
            else r=mid-1;
        }
    }
    vector<int>v(N);
    iota(v.begin(),v.end(),0);
    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:49:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |         int mid=L+R>>1;
      |                 ~^~
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:74:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   74 |             int mid=l+r+1>>1;
      |                     ~~~^~

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 9 ms 456 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 49 ms 344 KB Output is partially correct
2 Partially correct 60 ms 344 KB Output is partially correct
3 Partially correct 47 ms 344 KB Output is partially correct
4 Partially correct 55 ms 480 KB Output is partially correct
5 Partially correct 52 ms 468 KB Output is partially correct
6 Partially correct 48 ms 344 KB Output is partially correct
7 Partially correct 49 ms 480 KB Output is partially correct
8 Partially correct 48 ms 484 KB Output is partially correct
9 Partially correct 49 ms 344 KB Output is partially correct
10 Partially correct 46 ms 344 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
30.0 / 53.0

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