oj.uz

Submission #919327

# Submission time Handle Problem Language Result Execution time Memory
919327 2024-01-31T15:12:51 Z vnm06 Koala Game (APIO17_koala) C++14
93 / 100
 44 ms 608 KB 
#include<bits/stdc++.h>
#include "koala.h"
using namespace std;

int minValue(int N, int W) {
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;
    B[0]=1;
    playRound(B, R);
    for(int i=1; i<N; i++) if(!R[i]) return i;
    return 0;
}

int maxValue(int N, int W) {
    vector<int> pos, pos2;
    pos.resize(N);
    for(int i=0; i<N; i++) pos[i]=i;
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;

    while(pos.size()>1)
    {
        int k=pos.size(), v=W/k;
        for(int i=0; i<N; i++) B[i]=R[i]=0;
        for(int i=0; i<k; i++) B[pos[i]]=v;
        playRound(B, R);
        pos2.resize(0);
        for(int i=0; i<k; i++)
        {
            if(R[pos[i]]>B[pos[i]]) pos2.push_back(pos[i]);
        }
        pos.resize(pos2.size());
        for(int i=0; i<pos.size(); i++) pos[i]=pos2[i];
    }
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return pos[0];
}

int greaterValue(int N, int W) {
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;
    int le=0, ri=13;
    while(ri-le>1)
    {
        int mid=(le+ri)/2;
        B[0]=B[1]=mid;
        playRound(B, R);
        if(R[0]<=B[0] && R[1]<=B[1]) ri=mid;
        else if(R[0]>B[1] && R[1]>B[1]) le=mid;
        else return R[0]<R[1];
    }
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

void allValues(int N, int W, int *P)
{
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;

    int ord[105];
    int gr[105];

    for(int i=0; i<N; i++)
    {
        ord[i]=i;
        gr[i]=0;
    }
    int lst=0, lstle=0;
    while(1)
    {
        int i;
        for(i=0; i<N-1; i++)
        {
            ///cout<<gr[i]<<" ";
            if(!gr[i]) break;
        }
        ///for(int i=0; i<N; i++) cout<<ord[i]<<" ";
        ///cout<<endl;
        if(i==N-1) break;
        int le=i;
        int ri=i;
        while(ri+1<N-1 && !gr[ri+1]) ri++;
        ri++;
        if(le!=lstle) lst=max(0, ri-le-1+W-N);
        lstle=le;
        int br=ri-le+1, v=(W-le)/br;
        ///cout<<"    "<<le<<" "<<ri<<endl;
        ///cout<<"t"<<v<<endl;
        ///v=min(v, W-(N-ri-1));
        if(v>lst+1) v=lst+1;
        ///cout<<v<<endl;
        for(int i=0; i<N; i++) B[i]=0;
        for(int j=le; j<=ri; j++) B[ord[j]]=v;
        playRound(B, R);

        for(int j=le; j<=ri; j++)
        {
            if(B[ord[j]]<R[ord[j]])
            {
               /// cout<<j<<" "<<le<<endl;
                swap(ord[j], ord[le]);
                le++;
            }
        }
        gr[le-1]=1;
        lst=v;
       /// cout<<lst<<"Smqna"<<" "<<le-1<<endl;
    }
    for(int i=0; i<N; i++) P[ord[i]]=N-i;
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int i=0; i<pos.size(); i++) pos[i]=pos2[i];
      |                      ~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 344 KB Output is correct
2 Correct 41 ms 468 KB Output is correct
3 Correct 43 ms 608 KB Output is correct
4 Correct 40 ms 480 KB Output is correct
5 Correct 39 ms 472 KB Output is correct
6 Correct 38 ms 600 KB Output is correct
7 Correct 44 ms 456 KB Output is correct
8 Correct 39 ms 600 KB Output is correct
9 Correct 40 ms 468 KB Output is correct
10 Correct 35 ms 460 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 344 KB Output is correct
2 Correct 20 ms 444 KB Output is correct
3 Correct 20 ms 456 KB Output is correct
4 Correct 20 ms 344 KB Output is correct
5 Correct 27 ms 504 KB Output is correct
6 Correct 23 ms 448 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 22 ms 344 KB Output is correct
9 Correct 20 ms 344 KB Output is correct
10 Correct 22 ms 344 KB Output is correct
11 Correct 20 ms 448 KB Output is correct
12 Correct 19 ms 344 KB Output is correct
13 Correct 20 ms 448 KB Output is correct
14 Correct 21 ms 344 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 23 ms 344 KB Output is correct
17 Correct 23 ms 448 KB Output is correct
18 Correct 28 ms 344 KB Output is correct
19 Correct 20 ms 600 KB Output is correct
20 Correct 20 ms 448 KB Output is correct

Subtask #5
46.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 344 KB Output is partially correct
2 Partially correct 4 ms 496 KB Output is partially correct
3 Partially correct 4 ms 344 KB Output is partially correct
4 Partially correct 5 ms 344 KB Output is partially correct
5 Partially correct 4 ms 344 KB Output is partially correct
6 Partially correct 4 ms 344 KB Output is partially correct
7 Partially correct 6 ms 344 KB Output is partially correct
8 Partially correct 5 ms 344 KB Output is partially correct
9 Partially correct 5 ms 344 KB Output is partially correct
10 Partially correct 4 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 4 ms 344 KB Output is partially correct
13 Partially correct 6 ms 344 KB Output is partially correct
14 Partially correct 5 ms 344 KB Output is partially correct
15 Partially correct 5 ms 344 KB Output is partially correct
16 Partially correct 5 ms 516 KB Output is partially correct
17 Partially correct 5 ms 344 KB Output is partially correct
18 Partially correct 6 ms 344 KB Output is partially correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Partially correct 4 ms 344 KB Output is partially correct
21 Partially correct 7 ms 344 KB Output is partially correct
22 Partially correct 5 ms 344 KB Output is partially correct
23 Partially correct 4 ms 344 KB Output is partially correct
24 Partially correct 5 ms 344 KB Output is partially correct
25 Partially correct 6 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 5 ms 344 KB Output is partially correct
30 Partially correct 4 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 6 ms 344 KB Output is partially correct
33 Partially correct 4 ms 344 KB Output is partially correct
34 Partially correct 4 ms 344 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 4 ms 344 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 5 ms 344 KB Output is partially correct
39 Partially correct 4 ms 344 KB Output is partially correct
40 Partially correct 5 ms 344 KB Output is partially correct