oj.uz

Submission #1054363

# Submission time Handle Problem Language Result Execution time Memory
1054363 2024-08-12T09:09:06 Z 변재우(#11060) Koala Game (APIO17_koala) C++14
37 / 100
 32 ms 460 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
    int tmp[100]={0}, tmp2[100]={0};
    tmp[0]=1;
    playRound(tmp, tmp2);
    if(tmp2[0]<=1) return 0;
    for(int i=1; i<N; i++) if(!tmp2[i]) return i;
}

int maxValue(int N, int W) {
    int tmp[100]={0}, tmp2[100]={0};
    vector<int> V;
    for(int i=0; i<N; i++) V.push_back(i);
    while(V.size()>1) {
        fill(tmp, tmp+N, 0);
        for(int i=0; i<V.size(); i++) tmp[V[i]]=N/(int)V.size();
        playRound(tmp, tmp2);
        vector<int> V2;
        for(int i=0; i<V.size(); i++) if(tmp2[V[i]]) V2.push_back(V[i]);
        V=V2;
    }
    return V[0];
}

int greaterValue(int N, int W) {
    int tmp[100]={0}, tmp2[100]={0};
    for(int s=1, e=14; s<=e; ) {
        int m=(s+e)/2;
        tmp[0]=tmp[1]=m;
        playRound(tmp, tmp2);
        if(tmp2[0]<=m && tmp2[1]<=m) e=m-1;
        else if(tmp2[0]>m && tmp2[1]>m) s=m+1;
        else if(tmp2[0]<=m && tmp2[1]>m) return 1;
        else 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.
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         for(int i=0; i<V.size(); i++) tmp[V[i]]=N/(int)V.size();
      |                      ~^~~~~~~~~
koala.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int i=0; i<V.size(); i++) if(tmp2[V[i]]) V2.push_back(V[i]);
      |                      ~^~~~~~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:11:1: warning: control reaches end of non-void function [-Wreturn-type]
   11 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 448 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 452 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 452 KB Output is correct
4 Correct 8 ms 452 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 344 KB Output is correct
2 Correct 30 ms 460 KB Output is correct
3 Correct 26 ms 460 KB Output is correct
4 Correct 28 ms 344 KB Output is correct
5 Correct 27 ms 456 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 32 ms 344 KB Output is correct
8 Correct 29 ms 344 KB Output is correct
9 Correct 32 ms 344 KB Output is correct
10 Correct 28 ms 344 KB Output is correct

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 -