oj.uz

Submission #53067

# Submission time Handle Problem Language Result Execution time Memory
53067 2018-06-28T00:53:59 Z arthur_nascimento Koala Game (APIO17_koala) C++14
47 / 100
 133 ms 816 KB 
#include "koala.h"

int minValue(int N, int W) {
    int v[N];
    v[0] = 1;
    for(int i=1;i<N;i++)
        v[i] = 0;
    int ans[N];
    playRound(v,ans);
    for(int i=0;i<N;i++)
        if(ans[i] == 0)
            return i;
    return 0;
}

int maxValue(int N, int W) {
    int v[N];
    int ans[N];
    int tot[N];
    for(int i=0;i<N;i++)
        v[i] = 1, tot[i] = 0;
    playRound(v,ans);
    for(int i=0;i<N;i++){
        tot[i] += (ans[i] > v[i]);
        v[i] = (ans[i]?2:0);
    }
    playRound(v,ans);
    int u = 0;
    for(int i=0;i<N;i++){
        tot[i] += (ans[i] > v[i]);
        if(tot[i] == 2) v[i] = 4, u++;
        else v[i] = 0;
    }

    playRound(v,ans);
    for(int i=0;i<N;i++){
        tot[i] += (ans[i] > v[i]);
        if(tot[i] == 3) v[i] = 11;
        else v[i] = 0;
    }
    playRound(v,ans);
    for(int i=0;i<N;i++)
        if(tot[i]+(ans[i]>v[i]) == 4)
            return i;
        
    return 0;
}

int greaterValue(int N, int W) {
    int lo[8] = {-0,-1,-2,2,-4,3,-6,6};
    int hi[8] = {-0,-1,-2,4,-4,7,-6,8};
    int cur = 5;
    int v[N];
    int ans[N];
    for(int i=0;i<3;i++){
       // printf("cur %d\n",cur);
        if(cur == 8){
            for(int j=0;j<N;j++)
                v[j] = (j <= 1) ? 10 : 0;
            playRound(v,ans);
            return (ans[1] > 10);
        }
        for(int j=0;j<N;j++)
            v[j] = (j <= 1) ? (cur-1) : 0;
        playRound(v,ans);
        ans[0] = (ans[0] > v[0]);
        ans[1] = (ans[1] > v[1]);
        if(ans[0] != ans[1])
            return ans[1] > ans[0];
        if(ans[0] == 0)
            cur = lo[cur];
        else
            cur = hi[cur];
    }
    return 0;
}

#include <bits/stdc++.h>
void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        int u = 0;
        int v[N];
        int ans[N];
        int pos[N];
        for(int i=0;i<N;i++){
            int val = i+1;
            int lo = 0, hi = i;
            while(lo != hi){
                int mid = (lo+hi)/2;
                for(int j=0;j<N;j++)
                    v[j] = 0;
                v[i] = W/2;
                v[pos[mid]] = W/2;
              //  printf("put %d %d\n",pos[mid],i);
                playRound(v,ans);u++;
                assert(u <= 700);
                if(ans[i] > W/2)
                    lo = mid+1;
                else
                    hi = mid;
            }//printf("lo %d\n",lo);
            if(lo == i){
                P[i] = i;
                pos[i] = i;
            }
            
            else {
                for(int j=i-1;j>=lo;j--){
                   // pos[P[j]] = j+1;
                    pos[j+1] = pos[j];
                    P[j+1] = P[j];
                }
                P[lo] = i;
                pos[lo] = i;
            }
           // for(int j=0;j<=i;j++)
            //    printf("%d ",P[j]);
        //    printf("\n");
        }
        for(int i=0;i<N;i++)
            P[pos[i]] = i+1;
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Compilation message

koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:86:17: warning: unused variable 'val' [-Wunused-variable]
             int val = i+1;
                 ^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 484 KB Output is correct
4 Correct 7 ms 524 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 596 KB Output is correct
2 Correct 23 ms 596 KB Output is correct
3 Correct 18 ms 596 KB Output is correct
4 Correct 24 ms 596 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 636 KB Output is correct
2 Correct 133 ms 636 KB Output is correct
3 Correct 116 ms 728 KB Output is correct
4 Correct 92 ms 728 KB Output is correct
5 Correct 103 ms 728 KB Output is correct
6 Correct 84 ms 728 KB Output is correct
7 Correct 109 ms 732 KB Output is correct
8 Correct 113 ms 744 KB Output is correct
9 Correct 126 ms 744 KB Output is correct
10 Correct 101 ms 744 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 744 KB Output is correct
2 Correct 46 ms 744 KB Output is correct
3 Correct 59 ms 764 KB Output is correct
4 Correct 55 ms 764 KB Output is correct
5 Correct 46 ms 764 KB Output is correct
6 Correct 64 ms 764 KB Output is correct
7 Correct 53 ms 764 KB Output is correct
8 Correct 57 ms 764 KB Output is correct
9 Correct 57 ms 764 KB Output is correct
10 Correct 49 ms 764 KB Output is correct
11 Correct 57 ms 764 KB Output is correct
12 Correct 54 ms 812 KB Output is correct
13 Correct 41 ms 812 KB Output is correct
14 Correct 44 ms 816 KB Output is correct
15 Correct 38 ms 816 KB Output is correct
16 Correct 40 ms 816 KB Output is correct
17 Correct 68 ms 816 KB Output is correct
18 Correct 52 ms 816 KB Output is correct
19 Correct 45 ms 816 KB Output is correct
20 Correct 48 ms 816 KB Output is correct

Subtask #5
0 / 53.0

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