oj.uz

Submission #1054230

# Submission time Handle Problem Language Result Execution time Memory
1054230 2024-08-12T07:50:34 Z 정희우(#11059) Koala Game (APIO17_koala) C++14
19 / 100
 8 ms 456 KB 
#include "koala.h"
#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;
using lint = long long;
using vint = vector<int>;
using pii = pair<int,int>;

const int n=100;

int ba[n],ra[n];

int minValue(int N, int W)
{
    fill(ba,ba+n,1);
    playRound(ba,ra);
    int p=0;
    for(int i=0;i<n;i++)
        if(ra[i])p=i;
    fill(ba,ba+n,0);
    ba[p]=1;
    playRound(ba,ra);
    for(int i=0;i<n;i++)
        if(!ra[i])return i;
    return 0;
}

int f[4]={1,2,4,11};
int check[n];
int maxValue(int N, int W)
{
    int p=0;
    fill(check,check+n,0);
    for(int t=0;t<4;t++)
    {
        fill(ba,ba+n,0);
        int c=0;
        for(int i=0;i<n;i++)
            if(!check[i])
            {
                ba[i]=f[t];
                c++;
            }
        if(t==3)ba[p]=1;
        playRound(ba,ra);
        for(int i=0;i<n;i++)
            if(!check[i] && !ra[i])
            {
                check[i]=1;
                if(t==2)p=i;
            }
    }
    for(int i=0;i<n;i++)
        if(!check[i])return i;
    return 0;
}

int greaterValue(int N, int W)
{
    // 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)
{
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -