oj.uz

Submission #774429

# Submission time Handle Problem Language Result Execution time Memory
774429 2023-07-05T17:48:53 Z MohamedFaresNebili Koala Game (APIO17_koala) C++14
24 / 100
 123 ms 436 KB 
#include <bits/stdc++.h>
#include "koala.h"

            using namespace std;

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

            int maxValue(int N, int W) {
                int B[N], R[N]; vector<int> A;
                for(int l = 0; l < N; l++)
                    A.push_back(l), B[l] = 1;
                while(A.size() > 1) {
                    for(int l = 0; l < N; l++) B[l] = 0;
                    for(auto u : A) B[u] = (W / A.size());
                    A.clear(); playRound(B, R);
                    for(int l = 0; l < N; l++)
                        if(R[l] > B[l] && B[l] > 0) A.push_back(l);
                }
                return A[0];
            }

            int greaterValue(int N, int W) {
                int B[N], R[N];
                for(int l = 0; l < N; l++) B[l] = 0;
                for(int l = 1; l < N; l++) {
                    B[0] = l, B[1] = l;
                    playRound(B, R);
                    if(R[0] != R[1]) return (R[0] > R[1] ? 0 : 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) {
                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 3 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 12 ms 320 KB Output is correct
3 Correct 10 ms 272 KB Output is correct
4 Correct 10 ms 208 KB Output is correct

Subtask #3
5.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 118 ms 332 KB Output is partially correct
2 Partially correct 123 ms 324 KB Output is partially correct
3 Partially correct 116 ms 324 KB Output is partially correct
4 Partially correct 119 ms 436 KB Output is partially correct
5 Partially correct 114 ms 320 KB Output is partially correct
6 Partially correct 117 ms 320 KB Output is partially correct
7 Partially correct 112 ms 320 KB Output is partially correct
8 Partially correct 118 ms 320 KB Output is partially correct
9 Partially correct 114 ms 312 KB Output is partially correct
10 Partially correct 111 ms 320 KB Output is partially correct

Subtask #4
0 / 10.0

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